Mining top-K large structural patterns in a massive network

Proceedings of the VLDB Endowment

Volumn 4, Issue 11, 2011, Pages 807-818

  Zhu, Feida ^a   Qu, Qiang ^b   Lo, David ^a   Yan, Xifeng ^c   Han, Jiawei ^d   Yu, Philip S ^e  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^b PEKING UNIVERSITY   (China)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^e UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING;

BOUNDED DIAMETER; HUGE NETWORKS; ITS EFFICIENCIES; MASSIVE NETWORKS; NOVEL ALGORITHM; PATTERN DISCOVERY; PATTERN GROWTH; PATTERN MINING METHODS; POWER; STRUCTURAL PATTERN;

EFFICIENCY;

EID: 84863730213     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402720     Document Type: Conference Paper

References (36)

1. Jeti. Version 0.7.6(Oct. 2006). http://jeti.sourceforge.net/.
2. B. Berendt, A. Hotho, and G. Stumme. Towards semantic web mining. In International Semantic Web Conference, pages 264-278, 2002.
3. C. Borgelt and M. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In ICDM, pages 211-218, 2002.
4. G. Canfora and A. Cimitile. Software Maintenance, volume 1 of Handbook of Software Engineering and Knowledge Engineering, pages 91-120. World Scientific, 2002.
5. J. Cheng, Y. Ke, W. Ng, and A. Lu. Fg-index: towards verification-free query processing on graph databases. In SIGMOD, pages 857-872, 2007.
6. P. Crescenzi. On the analysis of graphs evolving over time. http://cost295.net/docs/dagstuhl/les/crescenzi.pdf, 2009.
7. D. Easley and J. Kleinberg. Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, 2010.
8. E. Erlikh. Leveraging legacy system dollars for e-business. IEEE IT Pro, pages 17-23, 2000.
9. M. Fiedler and C. Borgelt. Support computation for mining frequent subgraphs in a single graph. In The 5th International Workshop on Mining and Learning with Graphs, 2007.
10. S. Ghazizadeh and S. S. Chawathe. Seus: Structure extraction using summaries. In In Proc. of the 5th International Conference on Discovery Science, pages 71-85. Springer, 2002.
11. F. Harary. On the notion of balance of a signed graph. Michigan Math. Journal, 2(2):143-146, 1953.
12. M. A. Hasan, V. Chaoji, S. Salem, J. Besson, and M. J. Zaki. Origami: Mining representative orthogonal graph patterns. In ICDM, pages 153-162, 2007.
13. L. Holder, D. Cook, and S. Djoko. Substructure discovery in the subdue system. In KDD, pages 169-180, 1994.
14. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In ICDM, pages 549-552, 2003.
15. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD, pages 13-23, 2000.
16. A. Inokuchi, T. Washio, and H. Motoda. Complete mining of frequent patterns from graphs:mining graph data. Machine Learning, 50(3):321-354, 2003.
17. J. K. J. Leskovec and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In KDD, pages 177-187, 2005.
18. U. Kang, C. Tsourakakis, A. Appel, C. Faloutsos, and J. Leskovec. Hadi fast diameter estimation and mining in massive graphs with hadoop. Technical Report CMU-ML-08-117, December 2008.
19. M. Kuramochi and G. Karypis. An efficient algorithm for discovering frequent subgraphs. In IEEE TKDE, pages 1038-1051, 2004.
20. M. Kuramochi and G. Karypis. Grew-a scalable frequent subgraph discovery algorithm. In ICDM, pages 439-442, 2004.
21. M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. Data Mining and Knowledge Discovery, (11):243-271, 2005.
22. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR, abs/0810.1355, 2008.
23. D. Lo, S.-C. Khoo, and C. Liu. Efficient mining of iterative patterns for software specification discovery. In KDD, pages 460-469, 2007.
24. I. F. M. Worlein, T. Meinl and M. Philippsen. A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston. In PKDD, pages 392-403, 2005.
25. M.Fowler. Refactoring - Improving the Design of Existing Code. Addison-Wesley, 1999.
26. C. Olston, S. Chopra, and U. Srivastava. Generating example data for dataflow programs. In SIGMOD, pages 245-256, 2009.
27. J. Prins, J. Yang, J. Huan, and W. Wang. Spin: Mining maximal frequent subgraphs from graph databases. In KDD, pages 581-586, 2004.
28. T. Standish. An essay on software reuse. IEEE TSE, pages 494-497, 1984.
29. W. Stevens, G. Myers, and L. Constantine. Structured design. IBM Systems Journal, 13:115-139, 1974.
30. L. Thomas, S. Valluri, and K. Karlapalem. Margin: Maximal frequent subgraph mining. In ICDM, pages 1097-1101, 2006.
31. N. Vanetik, E. Gudes, and S. Shimony. Computing frequent graph patterns from semistructured data. In ICDM, pages 458-465, 2002.
32. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by leap search. In SIGMOD, pages 433-444, 2008.
33. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
34. X. Yan and J. Han. CloseGraph: Mining closed frequent graph patterns. In KDD, pages 286-295, 2003.
35. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD, pages 335-346, 2004.
36. F. Zhu, X. Yan, J. Han, P. S. Yu, and H. Cheng. Mining colossal frequent patterns by core pattern fusion. In ICDE, pages 706-715, 2007.