CSV: Visualizing and mining cohesive subgraphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 445-457

  Wangt, Nan ^a   Parthasarathy, Srinivasan ^b   Tan, Kian Lee ^a   Tung, Anthony K H ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Ohio State University   (United States)

Author keywords

Clique; Data mining; Graph density; Graph mining; Visualization

Indexed keywords

APPLICATION DOMAINS; APPROXIMATE ALGORITHMS; BIOLOGICAL NETWORKS; CLIQUE; COMPONENT DISTRIBUTIONS; DENSE REGIONS; EXHAUSTIVE ENUMERATIONS; EXPONENTIAL COMPLEXITIES; EXPONENTIAL TIME COMPLEXITIES; GRAPH DENSITY; GRAPH MINING; HIGHLY SENSITIVES; LARGE GRAPHS; MAPPING STRATEGIES; MULTI-DIMENSIONAL; NEW ALGORITHMS; PARAMETER MAPPINGS; PARAMETER SETTINGS; PATTERN MININGS; PROBLEM BASED; REAL DATA SETS; SCALE-UP; SOCIAL NETWORK ANALYSES; STOCK MARKET ANALYSES; SUB COMPONENTS; SUBGRAPH; SUBGRAPH MININGS; SUBGRAPHS; UNDERLYING DISTRIBUTIONS; VISUAL GRAPHS;

DATA MINING; DATA VISUALIZATION; DECISION SUPPORT SYSTEMS; ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; INFORMATION MANAGEMENT; INTERNET; MINING; VISUALIZATION; WORLD WIDE WEB;

CONFORMAL MAPPING;

EID: 57149125154     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376663     Document Type: Conference Paper

References (37)

1. J. Abello, M. G. C. Resende, and S. Sudarsky. Massive quasi-clique detection. In LATIN, pages 598-612. 2002.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages 487-99. Morgan Kaufmann, 12-15 1994.
3. M. Ankerst, M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering points to identify the clustering structure. In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'99), pages 49-60, Philadelphia, PA, June 1999.
4. A.P.Gasch and M.B.Eisen. Exploring the conditional coregulation of yeast gene expression through fuzzy k-mean clustering. Genome Biol., 3(RESEARCH0059), 2002.
5. S. Asur, D. Ucar, and S. Parthasarathy. An ensemble framework for clustering proteinlcprotein interaction networks. In ISMB '07: Proceedings of the 15th Annual International Conference on Intelligent Systems, 2007.
6. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In Proc. 2002 Int. Conf. Knowledge Discovery and Data Mining, 2002.
7. V. Boginski, S. Butenko, and P. M. Pardalos. Mining market data: a network approach. Comput. Open Res., 33(11):3171-3184, 2006.
8. B. Bollobas. Extremal Graph Theory. Dover Publications, Incorporated, 1978.
9. B. J. Breitkreutz, C. Stark, and M. Tyers. Osprey: a network visualization system. Genome Biol, 4, 2003.
10. B. Bustos, G. Navarro, and E. Chavez. Pivot selection techniques for proximity searching in metric spaces. Pattern Recogn. Lett., 24(14):2357-2366, 2003.
11. J. Cheriyan and R. Thurimella. Fast Algorithms for k -Shredders and k -Node Connectivity Augmentation (Extended Abstract). 1996.
12. G. Cong, K. Tan, A. Tung, and F. Pan. Mining Frequent Closed Patterns in Microarray Data. Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM '04)- Volume 00, pages 363-366, 2004.
13. G. Cong, K. Tan, A. Tung, and X. Xu. Mining top-K covering rule groups for gene expression data. Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pages 670-681, 2005.
14. G. Cong, A, Tung, X. Xu, F. Pan, and J. Yang. FARMER: finding interesting rule groups in microarray datasets. Proceedings of the 2004 ACM SIGMOD international conference on Management of data, pages 143-154, 2004.
15. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases. In Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD'96), pages 226-231, Portland, Oregon, Aug. 1996.
16. C. Faloutsos and K.-I. Lin. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proc. 1995 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'95), pages 163-174, San Jose, CA, May 1995.
17. H.Hu, X.Yan, Y.Huang, J.Han, and X.J.Zhou. Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics, 21(1):213-221, 2005.
18. V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-style keyword search over relational databases. In Proceedings of 29th International Conference on Very Large Data Bases ( VLDB), 2003.
19. V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB,2002.
20. H. Hu, X. Yan, Y. Huang, J. Han, and X. Zhou. Mining coherent dense subgraphs across massive biological networks for functional discovery. 2005.
21. A. Inokuchi, T. Washio, and H. Motoda. Complete mining of frequent patterns from graphs: Mining graph data. Mach. Learn., 50(3):321-354, 2003.
22. G. Karypis and V. Kumar. Parallel multilevel k-way partitioning scheme for irregular graphs. In Supercomputing '96: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM), page 35, Washington, DC, USA, 1996. IEEE Computer Society.
23. G. Kossinets and D. Watts. Empirical analysis of an evolving social network. Science Magazine, 311 (5757), 2006.
24. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
25. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems, volume 14, 2001.
26. F. Pan, G. Cong, A. Tung, J. Yang, and M. Zaki. Carpenter: finding closed patterns in long biological datasets. Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 637-642, 2003.
27. F. Pan, A. Tung, G. Cong, and X. Xu. COBBLER: combining column and row enumeration for closed pattern discovery. Scientific and Statistical Database Management, 2004. Proceedings. 16th International Conference on, pages 21-30, 2004.
28. C. T. J. R. S. Filho, A. Traina and C. Faloutsos. Similarity search without tears: The omni family of all-purpose access methods. In Proc. of the 17th IEEE Intl. Conf. on Data Engineering, 2001.
29. S. Seidman. Network structure and minimum degree. Social Networks, 5:269-287, 1983.
30. A. Srinivasan. The value of strong inapproximability results for clique. In STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 144-152, New York, NY, USA, 2000. ACM.
31. S. Tri and U. Leser. Gripp - indexing and querying graphs based on pre- and postorder numbering. Technical report, 2006.
32. P. Turan. On an extremal problem in graph theory. Mat. Fiz. Lapok, 48:436-452, 1941.
33. J. Wang, Z. Zeng, and L. Zhou. Clan: An algorithm for mining closed cliques from large dense graph databases. In Proceedings of the International Conference on Data Engineering, page 73, 2006.
34. X. Yan and J. Han. gspan: Graph-based substructure pattern mining, 2002.
35. X. Yan, X. J. Zhou, and J. Han. Mining closed relational graphs with connectivity constraints. In KDD, pages 324-333, 2005.
36. J. W. J. Z., Mellor and C. DeLisi. Visant: an online visualization and analysis tool for biological interaction data. In BMC Bioinformatics, 5:17-24, 2004.
37. Z. Zeng, J. Wang, L. Zhou, and G. Karypis. Coherent closed quasi-clique discovery from large dense graph databases. In Proceedings of the International Conf. Knowledge Discovery and Data Mining, pages 797-802, 2006.