Subspace clustering meets dense subgraph mining: A synthesis of two paradigms

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 845-850

  Günnemann, Stephan ^a   Färber, Ines ^a   Boden, Brigitte ^a   Seidl, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE DATA; ATTRIBUTE VALUES; CLUSTERING APPROACH; CLUSTERING QUALITY; CLUSTERING RESULTS; DATA SOURCE; GRAPH DATA; HOMOGENEOUS GROUP; LARGE GRAPHS; MINING METHODS; NODE SETS; REAL WORLD DATA; REDUNDANCY MODELS; RUNTIMES; SINGLE OBJECT; SPACE CLUSTERING; SUBGRAPH MINING; SUBSPACE CLUSTERING;

CLUSTERING ALGORITHMS; DATA MINING; GRAPH THEORY; MEASUREMENT THEORY;

CLUSTER ANALYSIS;

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

References (15)

1. K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is "nearest neighbor" meaningful?" in ICDT, 1999, pp. 217-235.
2. H.-P. Kriegel, P. Kröger, and A. Zimek, "Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering," TKDD, vol. 3, no. 1, pp. 1-58, 2009.
3. C. Aggarwal and H. Wang, Managing and Mining Graph Data. Springer, New York, 2010.
4. G. Liu and L. Wong, "Effective pruning techniques for mining quasi-cliques," in ECML/PKDD (2), 2008, pp. 33-49.
5. Z. Zeng, J. Wang, L. Zhou, and G. Karypis, "Coherent closed quasi-clique discovery from large dense graph databases," in KDD, 2006, pp. 797-802. (Pubitemid 44535593)
6. N. Du, B. Wu, X. Pei, B. Wang, and L. Xu, "Community detection in large-scale social networks," in WebKDD/SNA-KDD, 2007, pp. 16-25. (Pubitemid 351688357)
7. J. Kubica, A. W. Moore, and J. G. Schneider, "Tractable group detection on large link data sets," in ICDM, 2003, pp. 573-576.
8. D. Hanisch, A. Zien, R. Zimmer, and T. Lengauer, "Co-clustering of biological networks and gene expression data," Bioinformatics, vol. 18, pp. 145-154, 2002.
9. I. Ulitsky and R. Shamir, "Identification of functional modules using network topology and high-throughput data," BMC Systems Biology, vol. 1, no. 1, 2007.
10. Y. Zhou, H. Cheng, and J. X. Yu, "Graph clustering based on structural/attribute similarities," in VLDB, 2009, pp. 718-729.
11. F. Moser, R. Colak, A. Rafiey, and M. Ester, "Mining cohesive patterns from graphs with feature vectors," in SDM, 2009, pp. 593-604.
12. E. Müller, S. Günnemann, I. Assent, and T. Seidl, "Evaluating clustering in subspace projections of high dimensional data," in VLDB, 2009, pp. 1270-1281.
13. R. Rymon, "Search through systematic set enumeration," in KR, 1992, pp. 539-550.
14. B. Zeeberg et al., "GoMiner: a resource for biological interpretation of genomic and proteomic data," Genome Biology, vol. 4, no. 4, 2003.
15. C. Aggarwal, J. Wolf, P. Yu, C. Procopiuc, and J. Park, "Fast algorithms for projected clustering," in SIGMOD, 1999, pp. 61-72. (Pubitemid 129597324)