MARGIN: Maximal frequent subgraph mining

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 1097-1101

  Thomas, Lini T ^a   Valluri, Satyanarayana R ^a   Karlapalem, Kamalakar ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

SEARCH SPACE; SUBGRAPH MINING; SUBGRAPH MINING ALGORITHM;

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING;

DATA MINING;

EID: 34748817998     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.102     Document Type: Conference Paper

References (8)

1. The graph template library.
2. J. Hu, X. Shen, Y. Shao, C. Bystroff, and M. J. Zaki. Mining protein contact; maps, pages 3-10. BIOKDD, 2002.
3. J. Huan, W. Wang, J. Prins, and J. Yang. Spin: mining maximal frequent, subgraphs from, graph databases, pages 581-586. KDD, 2004.
4. M. Koyuturk, A. Grama, and W. Szpankowski. An efficient algorithm for detecting frequent subgraphs in biological networks, pages 200-207. ISMB, 2004.
5. M. Kuramochi and G. Karypis. Frequent subgraph discovery, pages 313-320. ICDM, 2001.
6. L. Thomas, S. R. Valluri, and K. Karlapalem. Margin: Maximal frequent subgraph mining. Technical Report IHT/TR/2006/24, HIT, Hyderabad, July 2006.
7. X. Yan and J. Han. gspan: Graph-based substructure pattern mining, pages 721-724. ICDM, 2002.
8. X. Yan and J. Han. Closegraph: mining closed frequent graph patterns, pages 286-295. KDD, 2003.