Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yang, S., Wang, B., Zhao, H., Wu, B.: Efficient Dense Structure Mining Using MapReduce icdmw. In: IEEE International Conference on Data Mining Workshops, pp. 332–337 (2009)
Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proc. 2nd IEEE Int. Conf. on Data Mining (ICDM 2003), Maebashi, Japan, pp. 721–724. IEEE Press, Piscataway (2002)
Chu, C.T., Kim, S.K., Lin, Y.A., Yu, Y., Bradski, G.R., Ng, A.Y., Olukotun, K.: Map-reduce for machine learning on multicore, pp. 281–288. MIT Press, Cambridge (2006)
Cohen, J.: Graph twiddling in a mapreduce world. Computing in Science and Engineering 11(4), 29–41 (2009)
Yan, X., Han, J.: Closegraph: Mining Closed Frequent Graph Patterns. In: Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD 2003 (2003)
Du, N., Wu, B., Xu, L., Wang, B., Pei, X.: A parallel algorithm for enumerating all maximal cliques in complex network. In: ICDMW 2006, pp. 320–324 (2006)
Kuramochi, M., Karypis, G.: Finding Frequent Patterns in a Large Sparse Graph. In: Proc. 4th SIAM Int. Conf. on Data Mining (SDM 2004), Lake Buena Vista, FL. Society for Industrial and Applied Mathematics, Philadelphia (2004)
Borgelt, C., Berthold, M.R.: Mining Molecular Fragments: Finding Relevant Substructures of Molecules. In: Proc. IEEE Int. Conf. on Data Mining (ICDM 2002), Maebashi, Japan, pp. 51–58. IEEE Press, Piscataway (2002)
Huan, J., Wang, W., Prins, J.: Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In: Proc. 3rd IEEE Int. Conf. on Data Mining (ICDM 2003), Melbourne, FL, pp. 549–552. IEEE Press, Piscataway (2003)
Nijssen, S., Kok, J.N.: A Quickstart in Frequent Structure Mining Can Make a Difference. In: Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2004), Seattle, WA, pp. 647–652. ACM Press, New York (2004)
Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: OSDI 2004, pp. 137–150 (2004)
Cook, D.J., Holder, L.B. (eds.): Mining Graph Data. Wiley-Interscience, Hoboken (2005)
Washio, T., Motoda, H.: State of the art of graph-based data mining. SIGKDD Explorations 5(1), 59–68 (2003)
Finn, P.W., Muggleton, S., Page, D., Srinivasan, A.: Pharmacore Discovery Using the Inductive Logic Programming System PROGOL. Machine Learning 30(2-3), 241–270 (1998)
Kramer, S., de Raedt, L., Helma, C.: Molecular Feature Mining in HIV Data. In: Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2001), San Francisco, CA, pp. 136–143. ACM Press, New York (2001)
Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: Proc. 1st IEEE Int. Conf. on Data Mining (ICDM 2001), San Jose, CA, pp. 313–320. IEEE Press, Piscataway (2001)
Zhou, H., Shaverdian, A.A., Jagadish, H.V., Michailidis, G.: Multiple step social structure analysis with Cytoscape. In: IEEE Symposium on Visual Analytics Science and Technology, VAST 2009, October 12-13, pp. 263–264 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, B., Bai, Y. (2010). An Efficient Distributed Subgraph Mining Algorithm in Extreme Large Graphs. In: Wang, F.L., Deng, H., Gao, Y., Lei, J. (eds) Artificial Intelligence and Computational Intelligence. AICI 2010. Lecture Notes in Computer Science(), vol 6319. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16530-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-16530-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16529-0
Online ISBN: 978-3-642-16530-6
eBook Packages: Computer ScienceComputer Science (R0)