Towards proximity pattern mining in large graphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 867-878

  Khan, Arijit ^a   Yan, Xifeng ^a   Wu, Kun Lung ^b  

^a University of California   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

association; graph; mining; pattern

Indexed keywords

ASSOCIATION GRAPH; EMPIRICAL RESULTS; FP TREE; FREQUENT ITEMSETS; FREQUENT SUBGRAPHS; GRAPH MINING; GRAPH PATTERNS; ISOMORPHISM TESTING; ITEM SETS; ITEMSET; ITEMSET MINING; LARGE GRAPHS; LARGE NETWORKS; MALWARE DETECTION; PATTERN DEFINITION; PATTERN MINING; RIGID STRUCTURE;

COMPUTER CRIME; RIGID STRUCTURES; SECURITY OF DATA; WAVELET TRANSFORMS;

TREES (MATHEMATICS);

EID: 77954693818     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807261     Document Type: Conference Paper

References (40)

1. L. A. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211-230, 2003.
2. C. C. Aggarwal, Y. Li, J. Wang, and J. Wang. Frequent pattern mining with uncertain data. In KDD, pages 29-38, 2009.
3. R. Agrawal, T. Imielinski, and A. Swami. Database mining: A performance perspective. IEEE Trans. Knowledge and Data Engineering, 5:914-925, 1993.
4. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In SIGMOD, pages 69-84, 1993.
5. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, pages 487-499, 1994.
6. W. Au and K. C. C. Chan. Farm: A data mining system for discovering fuzzy association rules. In FUZZY-IEEE, pages 1217-1222, 1999.
7. S. Nijssen B. Bringmann. What is frequent in a single graph? In PAKDD, pages 858-863, 2008.
8. T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, and A. Zuefle. Probabilistic frequent itemset mining in uncertain databases. In KDD, pages 119-128, 2009.
9. C. Borgelt and M. R. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In ICDM, pages 211-218, 2002.
10. N.R. Buchan, E.J. Johnson, and R.T.A. Croson. Lets get personal: An international examination of the influence of communication, culture and social distance on other regarding preferences. Journal of Economic Behavior and Organization, 60(3):373-398, 2006.
11. J. Chen, W. Hsu, M.-L. Lee, and S.-K. Ng. NeMoFinder: Dissecting genome-wide protein-protein interactions with meso-scale network motifs. In KDD, pages 106-115, 2006.
12. J. Cheng, Y. Ke, W. Ng, and A. Lu. FG-Index: Towards verification-free query processing on graph databases. In SIGMOD, 2007.
13. M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis. Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. on Knowledge and Data Engineering, 17:1036-1050, 2005.
14. S. Feld. The focused organization of social ties. American Journal of Sociology, 86:1015-1035, 1981.
15. M. Fiedler and C. Borgelt. Support computation for mining frequent subgraphs in a single graph. In MLG, pages 25-30, 2007.
16. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD, pages 1-12, 2000.
17. H. He and A. Singh. Efficient algorithms for mining significant substructures in graphs with quality guarantees. In ICDM, page 163Ucombining double acute accent172, 2007.
18. E. Hoffman, K. McCabe, K. Shachat, and V. Smith. Social distance and other-regarding behavior. American Economic Review, 86:653-666, 1996.
19. L. B. Holder, D. J. Cook, and S. Djoko. Substructure discovery in the subdue system. In KDD, pages 169-180, 1994.
20. J. Huan, W. Wang, D. Bandyopadhyay, J. Snoeyink, J. Prins, and A. Tropsha. Mining spatial motifs from protein structure graphs. In RECOMB, pages 308-315, 2004.
21. J. Huan, W. Wang, J. Prins, and J. Yang. Spin: Mining maximal frequent subgraphs from graph databases. In KDD, pages 581-586, 2004.
22. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD, pages 13-23, 1998.
23. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
24. M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. In SDM, 2004.
25. P. Lazarsfeld and R. Merton. Friendship as a social process: A substantive and methodological analysis. In Freedom and Control in Modern Society, pages 18-66. Van Nostrand, 1954.
26. A. Mangalampalli and V. Pudi. Fuzzy logic-based pre-processing for fuzzy association rule mining. Technical report, International Institute of Information Technology Hyderabad, India, 2008.
27. S. Milgram. The small world problem. Psychology Today, 6:62-67, 1967.
28. S. Nijssen and J. Kok. A quick start in frequent structure mining can make a difference. In KDD, pages 647-652, 2004.
29. A. Papoulis. Probability, Random Variables, and Stochastic Processes. NY: McGraw Hill, 1991.
30. J. S. Park, M. S. Chen, and P. S. Yu. Mining association rules with adjustable accuracy. In IBM Research Report, 1995.
31. R. Sokal and F. Rohlf. Biometry: the principles and practice of statistics in biological research. W. H. Freeman and Co., 1994.
32. N. Vanetik, E. Gudes, and S. E. Shimony. Computing frequent graph patterns from semistructured data. In ICDM, pages 458-465, 2002.
33. K. Wang, L. Tang, J. Han, and J. Liu. Top down fp-growth for association rule mining. In PAKDD, pages 334-340, 2002.
34. F. Wu, B. A. Huberman, L. A. Adamic, and J. R. Tyler. Information flow in social groups. Physica A, 337:327-335, 2004.
35. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by leap search. In SIGMOD, pages 433-444, 2008.
36. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
37. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD, pages 335-346, 2004.
38. Guizhen Yang. Computational aspects of mining maximal frequent patterns. Theor. Comput. Sci., 362(1):63-85, 2006.
39. M. J. Zaki. Scalable algorithms for association mining. IEEE Trans. Knowledge and Data Engineering, 12:372-390, 2000.
40. P. Zhao, J. Yu, and P. Yu. Graph indexing: tree + delta >= graph. In VLDB, pages 938-949, 2007.