Subgraph support in a single large graph

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 399-404

  Fiedler, Mathias ^a   Borgelt, Christian ^a  

^a European Center for Soft Computing   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATA MINING; DATABASE SYSTEMS; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; MINING; SEARCH ENGINES;

EMBEDDINGS; INTERNATIONAL CONFERENCES; NON-EXISTENCE; OF GRAPHS; SUB GRAPHS;

GRAPH THEORY;

EID: 49549098568     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2007.74     Document Type: Conference Paper

References (15)

1. C. Borgelt and M.R. Berthold. Mining Molecular Fragments: Finding Relevant Substructures of Molecules. Proc. IEEE Int. Conf. on Data Mining (ICDM 2002, Maebashi, Japan), 51-58. IEEE Press, Piscataway, NJ, USA 2002
2. C. Borgelt. On Canonical Forms for Frequent Graph Mining. Proc. 3rd Int. Workshop on Mining Graphs, Trees and Sequences (MGTS'05, Porto, Portugal), 1-12. ECML/PKDD 2005 Organization Committee, Porto, Portugal 2005
3. D.J. Cook and L.B. Holder. Graph-Based Data Mining. IEEE Trans. on Intelligent Systems 15(2):32-41. IEEE Press, Piscataway, NJ, USA 2000
4. B. Bringmann and S. Nijssen. What is Frequent in a Single Graph? Proc. 5th Int. Workshop on Mining and Learning with Graphs (MLG 2007, Florence, Italy), 183-186. University of Florence, Italy 2007
5. D.J. Cook and L.B. Holder. SUBDUE datasets. http://cygnus.uta.edu/subdue/ download.htm
6. P.W. Finn, S. Muggleton, D. Page, and A. Srinivasan. Pharmacore Discovery Using the Inductive Logic Programming System PROGOL. Machine Learning, 30(2-3):241-270. Kluwer, Amsterdam, Netherlands 1998
7. J. Huan, W. Wang, and J. Prins. Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. Proc. 3rd IEEE Int. Conf. on Data Mining (ICDM 2003, Melbourne, FL), 549-552. IEEE Press, Piscataway, NJ, USA 2003
8. Index Chemicus - Subset from 1993. Institute of Scientific Information, Inc. (ISI). Thomson Scientific, Philadelphia, PA, USA 1993 http://www.thomsonscientific.com/products/indexchemicus/
9. S. Kramer, L. de Raedt, and C. Helma. Molecular Feature Mining in HIV Data. Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2001, San Francisco, CA), 136-143. ACM Press, New York, NY, USA 2001
10. M. Kuramochi and G. Karypis. Frequent Subgraph Discovery. Proc. 1st IEEE Int. Conf. on Data Mining (ICDM 2001, San Jose, CA), 313-320. IEEE Press, Piscataway, NJ, USA 2001
11. M. Kuramochi and G. Karypis. Finding Frequent Patterns in a Large Sparse Graph. Proc. 4th SIAM Int. Conf. on Data Mining (SDM 2004, Lake Buena Vista, FL). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA 2004
12. S. Nijssen and J.N. Kok. A Quickstart in Frequent Structure Mining Can Make a Difference. Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD2004, Seattle, WA), 647-652. ACM Press, New York, NY, USA 2004
13. N. Vanetik, E. Gudes, and S.E. Shimony. Computing Frequent Graph Patterns from Semistructured Data. Proc. IEEE Int. Conf. on Data Mining (ICDM 2002, Maebashi, Japan), 458-465. IEEE Press, Piscataway, NJ, USA 2002
14. X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. Proc. 2nd IEEE Int. Conf. on Data Mining (ICDM 2003, Maebashi, Japan), 721-724. IEEE Press, Piscataway, NJ, USA 2002
15. X. Yan and J. Han. Closegraph: Mining Closed Frequent Graph Patterns. Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2003, Washington, DC), 286-295. ACM Press, New York, NY, USA 2003