Mining significant graph patterns by leap search

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 433-444

  Yan, Xifeng ^a   Cheng, Hong ^b   Han, Jiawei ^b   Yu, Philip S ^c  

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

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

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Classification; Graph; Optimality; Pattern

Indexed keywords

DATA MINING; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; MINING; PROBABILITY DENSITY FUNCTION;

ART METHODS; BRANCH AND BOUNDS; CLASSIFICATION; COMPREHENSIVE STUDIES; EMPIRICAL RESULTS; GRAPH; GRAPH KERNEL METHODS; GRAPH MININGS; GRAPH PATTERNS; MINING METHODS; NOVEL CONCEPTS; OBJECTIVE FUNCTIONS; OF GRAPHS; OPTIMALITY; ORDERS OF MAGNITUDES; PATTERN; SPEED-UP; STRUCTURAL SIMILARITIES;

BRANCH AND BOUND METHOD;

EID: 57149124218     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376662     Document Type: Conference Paper

References (28)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of SIGMOD, pages 207-216, 1993.
2. S. Bay and M. Pazzani. Detecting group differences: Mining contrast sets. Data Mining and Knowledge Discovery, 5:213-246, 2001.
3. 2 - decision trees for tree structured data. In Proc. of 2005 European Symp. Principle of Data Mining and Knowledge Discovery, pages 46-58, 2005.
4. C. Chang and C. Lin. LIBSVM: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/~cjlin/ libsvm.
5. H. Cheng, X. Yan, J. Han, and C. Hsu. Discriminative frequent pattern analysis for effective classification. In Proc. of ICDE, pages 716-725, 2007.
6. J. Cheng, Y. Ke, W. Ng, and A. Lu. Fg-index: towards verification-free query processing on graph databases. In Proc. of SIGMOD, pages 857 - 868, 2007.
7. 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.
8. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In Proc. of SIGKDD, pages 15-18, 1999.
9. H. Fröhlich, J. Wegner, F. Sieker, and A. Zell. Optimal assignment kernels for attributed molecular graphs. In Proc. of ICDM, pages 225-232, 2005.
10. M. Hasan, V. Chaoji, S. Salem, J. Besson, and M. Zaki. ORIGAMI: Mining representative orthogonal graph patterns. In Proc. of ICDM, pages 153 - 162, 2007.
11. H. He and A. Singh. Graphrank: Statistical modeling and mining of significant subgraphs in the feature space. In Proc. of ICDM, pages 885 - 890, 2006.
12. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of 2000 European Symp. Principle of Data Mining and Knowledge Discovery, pages 13-23, 2000.
13. M. Kamber and R. Shinghal. Evaluating the interestingness of characteristic rules. In Proc. of SIGKDD, pages 263-266, 1996.
14. B. Kelley, R. Sharan, R. Karp, E. Sittler, D. Root, B. Stockwell, and T. Ideker. Conserved pathways within bacteria and yeast as revealed by global protein network alignment. Proc Natl Acad Sci USA, 100:11394-9, 2003.
15. S. Kramer, L. Raedt, and C. Helma. Molecular feature mining in HIV data. In Proc. of SIGKDD, pages 136-143, 2001.
16. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. of ICDM, pages 313-320, 2001.
17. S. Morishita and J. Sese. Traversing itemset lattice with statistical metric pruning. In Proc. of SIGMOD, pages 226 - 236, 2000.
18. F. Pennerath and A. Napoli. Mining frequent most informative subgraphs. In the 5th Int. Workshop on Mining and Learning with Graphs, 2007.
19. G. Piatetsky-Shapiro. Discovery, analysis and presentation of strong rules. Knowledge Discovery in Databases, MIT press, pages 229-248, 1991.
20. T. Scheffer and S. Wrobel. Finding the most interesting patterns in a database quickly by using sequential sampling. J. of Machine Learning Research, 3:833-862, 2002.
21. R. Sokal and F. Rohlf. Biometry: the principles and practice of statistics in biological research. W. H. Freeman, New York, 1994.
22. P. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proc. of SIGKDD, pages 32 - 41, 2002.
23. N. Wale and G. Karypis. Comparison of descriptor spaces for chemical compound retrieval and classification. In Proc. of ICDM, pages 678-689, 2006.
24. G. I. Webb. Opus: An efficient admissible algorithm for unordered search. J. of Artificial Intelligence Research, 3:431-465, 1995.
25. G. I. Webb. Discovering significant patterns. Machine Learning, 68:1 - 33, 2007.
26. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proc. of ICDM, 2002.
27. X. Yan and J. Han. CloseGraph: Mining closed frequent graph patterns. In Proc. of SIGKDD, pages 286-295, 2003.
28. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In Proc. of SIGMOD, pages 335-346, 2004.