2010 | OriginalPaper | Chapter
An Efficient Distributed Subgraph Mining Algorithm in Extreme Large Graphs
Authors : Bin Wu, YunLong Bai
Published in: Artificial Intelligence and Computational Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Graph mining plays an important part in the researches of data mining, and it is widely used in biology, physics, telecommunications and Internet in recently emerging network science. Subgraph mining is a main task in this area, and it has attracted much interest. However, with the growth of graph datasets, most of these former works which mainly rely on single chip computational capacity, cannot process massive graphs. In this paper, we propose a distributed method in solving subgraph mining problems with the help of MapReduce, which is an efficient method of computing. The candidate subgraphs are reduced efficiently according to the degrees of nodes in graphs. The results of our research show that the algorithm is efficient and scalable, and it is a better solution of subgraph mining in extreme large graphs.