Out-of-core coherent closed quasi-clique mining from large dense graph databases

ACM Transactions on Database Systems

Volumn 32, Issue 2, 2007, Pages

  Zeng, Zhiping ^a   Wang, Jianyong ^a   Zhou, Lizhu ^a   Karypis, George ^b,c  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF MINNESOTA   (United States)

^c University of Minnesota   (United States)

Author keywords

Coherent subgraph; Frequent closed subgraph; Graph mining; Out of core algorithm; Quasi clique

Indexed keywords

COHERENT SUBGRAPHS; FREQUENT CLOSED SUBGRAPHS; GRAPH MINING; OUT-OF-CORE ALGORITHMS; QUASI-CLIQUE;

DATA STRUCTURES; DATABASE SYSTEMS; GRAPH THEORY; INDEXING (OF INFORMATION); REDUNDANCY;

DATA MINING;

EID: 34547455408     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1242524.1242530     Document Type: Article

References (53)

1. ABELLO, J., RESENDE, M. G., AND SUDARSKY, S. 2002. Massive quasi-clique detection. In Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN) (Cancun, Mexico). 598-612.
2. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD) (Washington, D.C.). 207-216.
3. AGRAWAL, R. AND SRIKANT, R. 1994. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB) (Santiago, Chile). 487-499.
4. AGRAWAL, R. AND SRIKANT, R. 1995. Mining sequential patterns. In Proceedings of the 11th International Conference on Data Engineering (ICDE) (Taipei, Taiwan). 3-14.
5. BOGINSKI, V., BUTENKO, S., AND PARDALOS, P. M. 2004. On structural properties of the market graph. In Innovations in Financial and Economic Networks, A. Nagurney ed. Edward Elgar. 29-45.
6. 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) (Washington, DC). 51-58.
7. BRIN, S., MOTWANI, R., AND SILVERSTEIN, C. 1997. Beyond market baskets: Generalizing association rules to correlations. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD) (Tucson, AZ). 265-276.
8. BRODER, A., KUMAR, R., MAGHOUL, F., RAGHAVAN, P., RAJAGOPALAN, S., STATA, R., TOMKINS, A., AND WIENER, J. 2000. Graph structure in the web: Experiments and models. In Proceedings of the 9th International World Wide Web Conference (WWW) (Amsterdam, the Netherlands). 309-320.
9. BRON, C. AND KERBOSCH, J. 1973. Finding all cliques of an undireced graph. Commun. ACM 16, 9, 575-576.
10. BUEHRER, G., PARTHASARATHY, S., AND GHOTING, A. 2006. Out-of-Core frequent pattern mining on a commodity PC. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD). (Philadelphia, PA) 86-95.
11. CHAKRABARTI, D. AND FALOUTSOS, C. 2006. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 38, 1 (Mar.), Article 2.
12. CHEN, Q., LIM, A., AND ONG, K. W. 2003. D(k)-index: An adaptive structural summary for graph-structured data. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD) (San Diego, CA). 134-144.
13. CHI, Y., NIJSSEN, S., MUNTZ, R., AND KOK, J. 2005. Frequent subtree mining - An overview. Fundam. Inf. 66, 1-2, 161-198.
14. DEHASPE, L., TOIVONEN, H., AND KING, R. 1998. Finding frequent substructures in chemical compounds. In Proceedings of the 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (New York). 30-36.
15. DESHPANDE, M., KURAMOCHI, M., AND WALE, N. 2005. Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng. 17, 8, 1036-1050.
16. DONG, G. AND LI, J. 1999. Efficient mining of emerging patterns: Discovering trends and differences. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (San Diego, CA). 43-52.
17. FEIGE, U., GOLDWASSER, S., LOVASZ, L., SAFRA, S., AND SZEGEDY, M. 1991. Approximating clique is almost NP-complete. In Proceedings of the 32nd Annual Symposium, on Foundations of Computer Science (FOCS) (San Juan, PR). 2-12.
18. FRAWLEY, W. J., PIATETSKY-SHAPIRO, G., AND MATHEUS, C. J. 1992. Knowledge discovery in databases - An overview. AI Mag. 13, 3, 57-70.
19. HASHIMOTO, K., AOKI-KINOSHITA, K. F., UEDA, N., KANEHISA, M., AND MAMITSUKA, H. 2006. A new efficient probabilistic model for mining labeled ordered trees. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (Philadelphia, PA). 177-186.
20. 1-ε. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS) (Burlington, VT). 627-636.
21. HORVATH, T., BRINGMANN, B., AND RAEDT., L. D. 2006. Frequent hypergraph mining. In Proceedings of the 16th International Conference on Inductive Logic Programming (ILP) (Santiago, Spain).
22. HORVATH, T., RAMON, J., AND WROBEL, S. 2006. Frequent subgraph mining in outerplanar graphs. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (Philadelphia, PA). 197-206.
23. HU, Y., OLMAN, V., AND XU, D. 2002. Clustering gene expression data using a graph-theoretic approach: An application of minimum spanning trees. Bioinformatics 18, 4, 536-545.
24. HU, H., YAN, X., HANG, Y., HAN, J., AND ZHOU, X. J. 2005. Mining coherent dense subgraphs across massive biological network for functional discovery. Bioinformatics 21, 213-221.
25. HUAN, J., WANG, W., AND PRINS, J. 2003. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM) (Melbourne, FL). 549-552.
26. INOKUCHI, A., WASHIO, T., AND MOTODA, H. 2000. An apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD) (Freiburg, Germany). 13-23.
27. KARP, R. 1972. Reducibility among combinational problems. In Complexity of Computer Computations, R. E. Miller and Thatcher eds. Plenum Press, New York. 85-103.
28. KATO, H. AND TAKAHASHI, Y. 2001. Automated identification of three-dimensional common structural features of proteins. Genome Inf. 8, 296-297.
29. KLEMETTINEN, M., MANNILA, H., RONKAINEN, P., TOIVONEN, H., AND VERKAMO, A. I. 1994. Finding interesting rules from large sets of discovered association rules. In Proceedings of the 3rd International Conference on Information and Knowledge Management (CIKM) (Gaithersburg, MD). 401-407.
30. KURAMOCHI, M. AND KARYPIS, G. 2001. Frequent subgraph discovery. In Proceedings of the IEEE International Conference on Data Mining (ICDM) (San Jose, CA). 313-320.
31. LAXMAN, S. AND UNNIKRISHNAN, K. P. 2005. Discovering frequent episodes and learning hidden Markov models: A formal connection. IEEE Trans. Knowl. Data Eng. 17, 11, 1505-1517.
32. MANNILA, H., TOIVONEN, H., AND VERKAMO, A. I. 1997. Discovery of frequent episodes in event sequences. Data Mining Knowl. Discov. 1, 3, 259-289.
33. MATSUDA, H., ISHIHARA, T., AND HASHIMOTO, A. 1999. Classifying molecular sequences using a linkage graph with their pairwise similarities. Theor. Comput. Sci. 210, 2, 305-320.
34. OSTERGARD, P. R. 2002. A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120, 1-3, 197-207.
35. PAPADIAS, D., TAO, Y., MOURATIDIS, K., AND HUI, C. K. 2005. Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst. 30, 2, 529-576.
36. PEI, J., JIANG, D., AND ZHANG, A. 2005. On mining cross-graph quasi-cliques. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (Chicago, IL). 228-238.
37. PENSA, R.G., ROBARDET, C., AND BOULICAUT, J.F. 2005. A bi-clustering framework for categorical data. In Proceedings of the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD) (Porto, Portugal). 643-650.
38. SELMAOUI, N., LESCHI, C., GAY, D., AND BOULICAUT, J.F. 2006. Feature construction and delta-free sets in 0/1 samples. In Proceedings of the 9th International Conference on Discovery Science (DS) (Barcelona, Spain). 363-367.
39. SILVERSTEIN, C., BRIN, S., MOTWANI, R., AND ULLMAN, J. 2000. Scalable techniques for mining causal structures. Data Mining Knowl. Discov. 4, 2-3, 163-192.
40. 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) (Maebashi City, Japan). 458-465.
41. WANG, C., WANG, W., PEI, J., ZHU, Y., AND SHI, B. 2004. Scalable mining of large disk-based graph databases. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (Seattle, WA). 316-325.
42. WANG, H., WANG, W., YANG, J., AND YU, P. S. 2002. Clustering by pattern similarity in large data sets. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). Madison, WI). 394-405.
43. WANG, J., HAN, J., AND PEI, J. 2006a. Closed constrained gradient mining in retail databases. IEEE Trans. Knowl. Data Eng. 18, 6, 764-769.
44. WANG, J., ZENG, Z., AND ZHOU, L. 2006b. Clan: An algorithm for mining closed cliques from large dense graph databases. In Proceedings of the 22nd International Conference on Data Engineering (ICDE) (Atlanta, GA). Article 73.
45. YAN, X. AND HAN, J. 2002. GSPAN: Graph-Based substructure pattern mining. In Proceedings of the IEEE International Conference on Data Mining (ICDM) (Maebashi City, Japan). 721-724.
46. YAN, X. AND HAN, J. 2003. Closegraph: Mining closed frequent graph patterns. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (Washington, DC). 286-295.
47. YAN, X., YU, P. S., AND HAN, J. 2004. Graph indexing: A frequent structure-based approach. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD) (Paris). 335-346
48. YAN, X., ZHOU, X. J., AND HAN, J. 2005. Mining closed relational graphs with connectivity constraints. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (Chicago, IL). 324-333.
49. YANG, L., LEE, M. L., AND HSU, W. 2003. Efficient mining of XML query patterns for caching. In Proceedings of 29th International Conference on Very Large Data Bases (VLDB) (Berlin). 69-80.
50. ZAKI, M. J. 2002. Efficiently mining frequent trees in a forest. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (Edmonton, Alberta, Canada). 71-80.
51. ZENG, Z., WANG, J., ZHOU, L., AND KARYPIS, G. 2006. Coherent closed quasi-clique discovery from large dense graph databases. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (Philadelphia, PA). 797-802.
52. ZHANG, J., HSU, W., AND LEE, M. 2005. Clustering in dynamic spatial databases. J. Intell. Inf. Syst. 24, 1, 5-27.
53. ZHANG, M., KAO, B., CHEUNG, D. W., AND YIP, K. Y. 2005. Mining periodic patterns with gap requirement from sequences. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD) (Chicago, IL). 623-633.