Spectral subspace clustering for graphs with feature vectors

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2013, Pages 231-240

  Günnemann, Stephan ^a   Färber, Ines ^b   Raubach, Sebastian ^b   Seidl, Thomas ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

attributed graphs; graphs; networks; spectral clustering; subspace clustering

Indexed keywords

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

References (22)

1. R. Ge, M. Ester, B. Gao, Z. Hu, B. Bhattacharya, and B. Ben-Moshe, "Joint cluster analysis of attribute data and relationship data," TKDD, vol. 2, no. 2, pp. 1-35, 2008.
2. H.-p. Kriegel, p. Kröger, and A. Zimek, "Clustering highdimensional data: A survey on subspace clustering, patternbased clustering, and correlation clustering," TKDD, vol. 3, no. 1, pp. 1-58, 2009.
3. Y. Zhou, H. Cheng, and J. X. Yu, "Graph clustering based on structural/attribute similarities," PVLDB, vol. 2, no. 1, pp. 718-729, 2009.
4. F. Moser, R. Colak, A. Rafiey, and M. Ester, "Mining cohesive patterns from graphs with feature vectors," in SDM, 2009, pp. 593-604.
5. S. Günnemann, I. Färber, B. Boden, and T. Seidl, "Subspace clustering meets dense subgraph mining: A synthesis of two paradigms," in ICDM, 2010, pp. 845-850.
6. S. Günnemann, B. Boden, and T. Seidl, "Finding densitybased subspace clusters in graphs with feature vectors," DMKD, vol. 25, pp. 243-269, 2012.
7. U. Von Luxburg, "A tutorial on spectral clustering," Statistics and computing, vol. 17, no. 4, pp. 395-416, 2007.
8. F. R. Bach and M. I. Jordan, "Learning spectral clustering, with application to speech separation," JMLR, vol. 7, pp. 1963-2001, 2006.
9. S. E. Schaeffer, "Graph clustering," Computer Science Review, vol. 1, no. 1, pp. 27-64, 2007.
10. D. Hanisch, A. Zien, R. Zimmer, and T. Lengauer, "Coclustering of biological networks and gene expression data," Bioinformatics, vol. 18, pp. 145-154, 2002.
11. M. Shiga, I. Takigawa, and H. Mamitsuka, "A spectral clustering approach to optimally combining numerical vectors with a modular network," in SIGKDD, 2007, pp. 647-656.
12. L. Akoglu, H. Tong, B. Meeder, and C. Faloutsos, "Pics: Parameter-free identification of cohesive subgroups in large attributed graphs," SDM, pp. 439-450, 2012.
13. C. C. Aggarwal, J. L. Wolf, p. S. Yu, C. Procopiuc, and J. S. Park, "Fast algorithms for projected clustering," in SIGMOD, 1999, pp. 61-72.
14. D. Yan, L. Huang, and M. I. Jordan, "Fast approximate spectral clustering," in SIGKDD, 2009, pp. 907-916.
15. J. Shi and J. Malik, "Normalized cuts and image segmentation," TPAMI, vol. 22, no. 8, pp. 888-905, 2000.
16. M. Genton, "Classes of kernels for machine learning: a statistics perspective," JMLR, vol. 2, pp. 299-312, 2002.
17. M. Maila and J. Shi, "A random walks view of spectral segmentation," AI and STATISTICS (AISTATS), 2001.
18. I. Assent, R. Krieger, E. Müller, and T. Seidl, "DUSC: Dimensionality unbiased subspace clustering," in ICDM, 2007.
19. V. Kann, "On the approximability of NP-complete optimization problems, Royal Inst. of Tech." 1992.
20. A. Condon and R. M. Karp, "Algorithms for graph partitioning on the planted partition model," Random Struct. Algorithms, vol. 18, no. 2, pp. 116-140, 2001.
21. S. Günnemann, I. Färber, E. Müller, I. Assent, and T. Seidl, "External evaluation measures for subspace clustering," in CIKM, 2011, pp. 1363-1372.
22. N. X. Vinh, J. Epps, and J. Bailey, "Information theoretic measures for clusterings comparison," Journal of Machine Learning Research, vol. 11, pp. 2837-2854, 2010.