Mining minimal contrast subgraph patterns

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 639-643

  Ting, Roger Ming Hieng ^a   Bailey, James ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Graph mining; Hypergraph transversals

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTATIONAL METHODS; DATA MINING; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

BACKTRACKING TREE; GRAPH MINING; HYPERGRAPH TRANSVERSALS; SUBGRAPHS;

PATTERN RECOGNITION;

EID: 33745454871     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.76     Document Type: Conference Paper

References (15)

1. J. Bailey, T. Manoukian, and K. Ramamohanarao. A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. In ICDM 2003, pages 485-488.
2. C. Borgelt and M. R. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In Proc. of ICDM 2002, pages 51-58.
3. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In KDD 1999, pages 43-52.
4. P.J. Durand, R.Pasari, J.W.Baker, and Chun che Tsai. An efficient algorithm for similarity analysis of molecules. Internet Journal of Chemistry, 2, 1999.
5. A. Inokuchi, T. Washio, and H. Motoda. An aprioribased algorithm for mining frequent substructures from graph data. In PKDD 2000, pages 13-23.
6. S. Kramer, L. De Raedt, and C. Helma. Molecular feature mining in HIV data. In KDD 2001, pages 136-143.
7. Evgeny B. Krissinel and Kim Henrick. Common subgraph isomorphism detection by backtracking search. Softw., Pract. Exper., 34(6):591-607, 2004.
8. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM 2001, pages 313-320.
9. J. Mcgregor. Backtrack search algorithms and the maximal common subgraph problem. Soft. Practice and Experience, 12(1):23-34, 1982.
10. B. D. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45-87, 1981.
11. J. W. Raymond and P. Willett. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J. of Computer-Aided Molecular Design, 16(7):521-533, 2002.
12. P. Shoubridge, M. Kraetzl, W. Wallis, and H. Bunke. Detection of abnormal change in a time series of graphs. J. of Interconnection Networks, 3(1-2):85-101, 2002.
13. A. Srinivasan, R. King, S. Muggleton, and M. Sternberg. The predictive toxicology evaluation challenge. In IJCAI 1997, pages 4-9.
14. Julian R. Ullmann. An algorithm for subgraph isomorphism. J. ACM, 23(1):31-42, 1976.
15. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM 2002, pages 721-724.