Margin: Maximal frequent subgraph mining

ACM Transactions on Knowledge Discovery from Data

Volumn 4, Issue 3, 2010, Pages

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

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

Graph mining; Maximal frequent subgraph mining

Indexed keywords

CANDIDATE PATTERNS; EXPONENTIAL NUMBERS; FREQUENT SUBGRAPH MINING; FREQUENT SUBGRAPHS; GRAPH MINING; PROOF OF CORRECTNESS; SEARCH SPACES; SUBGRAPH MINING; SUBGRAPHS;

EID: 78049342020     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1839490.1839491     Document Type: Article

References (51)

1. BORGELT, C. AND BERTHOLD, M. R. 2002. Mining molecular fragments: Finding relevant substructures of molecules. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 51-58.
2. BUEHRER, G., PARTHASARATHY, S., AND CHEN, Y.-K. 2006. Adaptive parallel graph mining for cmp architectures. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 97-106.
3. BURDICK, D., CALIMLIM, M., AND GEHRKE, J. 2001. Mafia: A maximal frequent itemset algorithm for transactional databases. In Proceedings of the IEEE International Conference on Data Engineering (ICDE). 443-452.
4. CHI, Y., MUNTZ, R. R., NIJSSEN, S., AND KOK, J. N. 2005a. Frequent subtree mining-an overview. Fund. Informatics 66, 1-2, 161-198.
5. CHI, Y., XIA, Y., YANG, Y., AND MUNTZ, R. R. 2005b. Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Trans. Knowl. Data Eng. 17, 190-202.
6. CHI, Y., YANG, Y., AND MUNTZ, R. R. 2004. Hybridtreeminer: An efficient algorithm for mining frequent rooted trees and free trees using canonical form. In Proceedings of the International Conference on Scientific and Statistical Database Management (SSDBM). 11-20.
7. COHEN, M. AND GUDES, E. 2004. Diagonally subgraphs pattern mining. In Proceedings of the 9th International Workshop on Data Mining and Knowledge Discovery (DMKD). 51-58.
8. COOK, D. J. AND HOLDER, L. B. 1994. Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. 1, 231-255.
9. DEHASPE, L. AND TOIVONEN, H. 1999. Discovery of frequent datalog patterns. Data Min. Knowl. Discov. 3, 7-36.
10. GOUDA, K. AND ZAKI, M. J. 2001. Efficiently mining maximal frequent itemsets. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 163-170.
11. GSPAN. gspan Software. http://www.xifengyan. net/software/gSpan.htm.
12. GTL. Graph Template Library. http://www.infosun. fmi.uni-passau.de/GTL/.
13. GUNOPULOS, D., KHARDON, R., MANNILA, H., SALUJA, S., TOIVONEN, H., AND SHARM, R. S. 2003. Discovering all most specific sentences. ACM Trans. Datab. Syst. 28, 2, 140-174.
14. HASAN, M., CHAOJI, V., SALEM, S., BESSON, J., AND ZAKI, M. 2007. Origami: Mining representative orthogonal graph patterns. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 153-163.
15. HE, H. AND SINGH, A. K. 2006. Closure-tree: An index structure for graph queries. In Proceedings of the IEEE International Conference on Data Engineering (ICDE). 38.
16. HU, J., SHEN, X., SHAO, Y., BYSTROFF, C., AND ZAKI, M. J. 2002. Mining protein contact maps. BIOKDD, 3-10.
17. HUAN, J., WANG, W., AND PRINS, J. 2003. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 549-552.
18. HUAN, J., WANG, W., PRINS, J., AND YANG, J. 2004. Spin: Mining maximal frequent subgraphs from graph databases. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD). 581-586.
19. IGRAPH. igraph Library. http://igraph.sourceforge.net/.
20. INOKUCHI, A., WASHIO, T., AND MOTODA, H. 2000. An apriori-based algorithm for mining frequent substructures from graph data. PKDD, 13-23.
21. JIANG, H., WANG, H., YU, P. S., AND ZHOU, S. 2007. Gstring: A novel approach for efficient search in graph databases. In Proceedings of the IEEE International Conference on Data Engineering (ICDE). 566-575.
22. KAUSHIK, R., SHENOY, P., BOHANNON, P., AND GUDES, E. 2002. Exploiting local similarity for indexing paths in graph-structured data. In Proceedings of the IEEE International Conference on Data Engineering (ICDE). 129-140.
23. KE, Y., CHENG, J., AND NG, W. 2007. Correlation search in graph databases. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD). 390-399.
24. KOYUTURK, M., GRAMA, A., AND SZPANKOWSKI, W. 2004. An efficient algorithm for detecting frequent subgraphs in biological networks. ISMB, 200-207.
25. KURAMOCHI, M. AND KARYPIS, G. 2005. Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov. 11, 243-271.
26. KURAMOCHI, M. AND KARYPIS, G. 2001. Frequent subgraph discovery. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 313-320.
27. KURAMOCHI, M. AND KARYPIS, G. 2002. Discovering frequent geometric subgraphs. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 258-265.
28. LIBGTOP. Unix Libgtop Utility. http://library.gnome.org/devel/libgtop/ stable/libgtop-GlibTop.html.
29. NIJSSEN, S. AND KOK, J. 2004. The gaston tool for frequent subgraph mining. In Proceedings of the International Workshop on Graph-Based Tools.
30. PEI, J., DONG, G., ZOU, W., AND HAN, J. 2002. On computing condensed frequent pattern bases. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 378-385.
31. PEI, J., HAN, J., AND MAO, R. 2000. Closet: An efficient algorithm for mining frequent closed itemsets. In Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. ACM, New York, 21-30.
32. SRINIVASA, S. AND BALASUNDARARAMAN, L. 2004. A filtration based technique for mining maximal common subgraphs. Tech. rep., International Institute of Information Technology, Bangalore.
33. THOMAS, L. T., VALLURI, S. R., AND Karlapalem, K. 2006. MARGIN: Maximal frequent subgraph mining. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 1097-1101.
34. TONG, H., FALOUTSOS, C., GALLAGHER, B., AND ELIASSI-RAD, T. 2007. Fast best-effort pattern matching in large attributed graphs. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD). 737-746.
35. TOP. Unix Top Utility. http://en. wikipedia.org/wiki/Top (Unix).
36. UCI KDD ARCHIVE. Anonymous web data of msnbc.com. http://kdd.ics.uci.edu/ databases/msnbc/msnbc.html.
37. VANETIK, N., GUDES, E., AND SHIMONY, S. E. 2002. Computing frequent graph patterns from semistructured data. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 458-465.
38. WANG, J., HSU, W., LEE, M.-L., AND SHENG, C. 2006a. A partition-based approach to graph mining. In Proceedings of the IEEE International Conference on Data Engineering (ICDE). 74.
39. WANG, J., ZENG, Z., AND ZHOU, L. 2006b. Clan: An algorithm for mining closed cliques from large dense graph databases. In Proceedings of the IEEE International Conference on Data Engineering (ICDE). 73. (Pubitemid 44539865)
40. WASHIO, T. AND MOTODA, H. 2003. State of the art of graph-based data mining. SIGKDD Explorations, 5, 59-68.
41. WILLIAMS, D. W., HUAN, J., AND WANG, W. 2007. Graph database indexing using structured graph decomposition. In Proceedings of the IEEE International Conference on Data Engineering (ICDE). 976-985.
42. YAHOO FINANCE. Yahoo Finance Stock Data. http://finance.yahoo.com/.
43. YAN, X. AND HAN, J. 2002. gspan: Graph-based substructure pattern mining. In Proceedings of the IEEE International Conference on Data Mining (ICDM). 721-724.
44. YAN, X. AND HAN, J. 2003. Closegraph: Mining closed frequent graph patterns. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD). 286-295.
45. YAN, X., YU, P. S., AND HAN, J. 2004. Graph indexing: A frequent structure-based approach. SIGMOD, 335-346.
46. YANG, G. 2004. The complexity of mining maximal frequent itemsets and maximal frequent patterns. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD). 344-353.
47. YOSHIDA, K., MOTODA, H., AND INDURKHYA, N. 1994. Graph-based induction as a unified learning framework. J. Applied Intel. 4, 297-328.
48. ZAKI, M. J. 2002. Efficiently mining frequent trees in a forest. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD). 71-80.
49. ZAKI, M. J. AND HSIAO, C.-J. 2002. Charm: An efficient algorithm for closed itemset mining. SDM.
50. ZENG, Z., WANG, J., ZHOU, L., AND KARYPIS, G. 2006. Coherent closed quasi-clique discovery from large dense graph databases. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD). 797-802. (Pubitemid 44535593)
51. ZHANG, S., HU, M., AND YANG, J. 2007. Treepi: A new graph indexing method. In Proceedings of the IEEE International Conference on Data Engineering (ICDE). 966-975.