A distributed approach for graph mining in massive networks

• Autores: A. Talukder, M. J. Zaki
• Localización: Data mining and knowledge discovery, ISSN 1384-5810, Vol. 30, Nº 5, 2016, págs. 1024-1052
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We propose a novel distributed algorithm for mining frequent subgraphs from a single, very large, labeled network. Our approach is the first distributed method to mine a massive input graph that is too large to fit in the memory of any individual compute node. The input graph thus has to be partitioned among the nodes, which can lead to potential false negatives. Furthermore, for scalable performance it is crucial to minimize the communication among the compute nodes. Our algorithm, DistGraph, ensures that there are no false negatives, and uses a set of optimizations and efficient collective communication operations to minimize information exchange. To our knowledge DistGraphis the first approach demonstrated to scale to graphs with over a billion vertices and edges. Scalability results on up to 2048 IBM Blue Gene/Q compute nodes, with 16 cores each, show very good speedup.