Efficiently mining δ-tolerance closed frequent subgraphs

Machine Learning

Volumn 82, Issue 2, 2011, Pages 95-121

  Takigawa, Ichigaku ^a,b   Mamitsuka, Hiroshi ^a,b  

^a KYOTO UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

tolerance closedness; Frequent subgraph mining; Partial reverse search

Indexed keywords

CLOSEDNESS; COMPLEX NATURE; EFFICIENT ALGORITHM; FREQUENT PATTERN MINING; FREQUENT PATTERNS; FREQUENT SUBGRAPH MINING; FREQUENT SUBGRAPHS; REAL COMPUTATION; REVERSE SEARCH; STANDARD SOLUTIONS; TWO-STEP APPROACH; UNDERSTANDABILITY;

ALGORITHMS;

EID: 79851510632     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-010-5215-6     Document Type: Article

References (25)

1. Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., & Arikawa, S. (2002). Efficient substructure discovery from large semi-structured data. In SDM.
2. D. Avis K. Fukuda 1996 Reverse search for enumeration Discrete Applied Mathematics 65 1-3 21 46 0854.68070 10.1016/0166-218X(95)00026-N 1380066 (Pubitemid 126386259)
3. Borgelt, C., & Berthold, M. R. (2002). Mining molecular fragments: finding relevant substructures of molecules. In ICDM (pp. 51-58).
4. Borgelt, C., & Meinl, T. (2006). Full perfect extension pruning for frequent graph mining. In MCD.
5. Borgelt, C., Meinl, T., & Berthold, M. R. (2004). Advanced pruning strategies to speed up mining closed molecular fragments. In SMC (pp. 4565-4570). (Pubitemid 40415747)
6. D. Chakrabarti C. Faloutsos 2006 Graph mining: laws, generators, and algorithms ACM Computing Surveys 38 1 2 10.1145/1132952.1132954 (Pubitemid 44029962)
7. Chen, C., Lin, C. X., Yan, X., & Han, J. (2008). On effective presentation of graph patterns: a structural representative approach. In CIKM (pp. 299-308).
8. Cheng, J., Ke, Y., & Ng, W. (2006). δ-tolerance closed frequent itemsets. In ICDM (pp. 139-148).
9. Cheng, J., Ke, Y., Ng, W., & Lu, A. (2007). FG-index: towards verification-free query processing on graph databases. In SIGMOD (pp. 857-872). (Pubitemid 47630859)
10. Y. Chi Y. Xia Y. Yang R. R. Muntz 2005 Mining closed and maximal frequent subtrees from databases of labeled rooted trees IEEE Transactions on Knowledge and Data Engineering 17 2 190 202 10.1109/TKDE.2005.30 (Pubitemid 40320178)
11. M. Deshpande M. Kuramochi N. Wale 2005 Frequent substructure-based approaches for classifying chemical compounds IEEE Transactions on Knowledge and Data Engineering 17 8 1036 1050 10.1109/TKDE.2005.127 (Pubitemid 41259847)
12. J. Han H. Cheng D. Xin X. Yan 2007 Frequent pattern mining: current status and future directions Data Mining and Knowledge Discovery 15 55 86 10.1007/s10618-006-0059-1 2380777 (Pubitemid 47142811)
13. K. Hashimoto I. Takigawa M. Shiga M. Kanehisa H. Mamitsuka 2008 Mining significant tree patterns in carbohydrate sugar chains Bioinformatics 24 16 i167 i173 10.1093/bioinformatics/btn293 Proceedings of the seventh European conference on computational biology, ECCB 2008
14. Huan, J., Wang, W., Prins, J., & Yang, J. (2004). SPIN: mining maximal frequent subgraphs from graph databases. In KDD (pp. 581-586). (Pubitemid 40114974)
15. Kuramochi, M., & Karypis, G. (2001). Frequent subgraph discovery. In ICDM (pp. 313-320).
16. Liu, Y., Li, J., & Gao, H. (2008). Summarizing graph patterns. In ICDE (pp. 903-912).
17. Maggiora, G. M., & Shanmugasundaram, V. (2004). Methods in molecular biology : Vol. 275. Molecular similarity measures (Chap. 1, pp. 1-50). Clifton: Humana Press
18. Meinl, T., Wörlein, M., Urzova, O., Fischer, I., & Philippsen, M. (2006). The ParMol package for frequent subgraph mining. Electron. Commun. EASST, 1, 1-12. ISSN:1863-2122.
19. R. Tarjan 1972 Depth-first search and linear graph algorithms SIAM Journal on Computing 1 2 146 160 0251.05107 10.1137/0201010 304178
20. Thomas, L. T., Valluri, S. R., & Karlapalem, K. (2006). MARGIN: maximal frequent subgraph mining. In ICDM (pp. 1097-1101).
21. Wörlein, M. S. (2006). Extension and parallelization of a graph-mining-algorithm. Technical report, Diploma Thesis, Friedrich-Alexander- Universität.
22. S. B. Yahia T. Hamrouni E. M. Nguifo 2006 Frequent closed itemset based algorithms: a thorough structural and analytical survey ACM SIGKDD Explorations 8 1 93 104 10.1145/1147234.1147248
23. Yan, X., & Han, J. (2002). gSpan: graph-based substructure pattern mining. In ICDM (pp. 721-724).
24. Yan, X., & Han, J. (2003). CloseGraph: mining closed frequent graph patterns. In KDD (pp. 286-295).
25. Yan, X., Yu, P. S., & Han, J. (2004). Graph indexing: a frequent structure-based approach. In SIGMOD (pp. 335-346).