Consensus spectral clustering in near-linear time

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 1079-1090

  Luo, Dijun ^a   Ding, Chris ^a   Huang, Heng ^a   Nie, Feiping ^a  

^a University of Texas at Arlington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING METHODS; CLUSTERING QUALITY; COMPUTATIONAL COSTS; COMPUTATIONAL TIME; DATA ANALYSIS; DATA CLUSTERING; DATA MANAGEMENT; DATA POINTS; DATA SETS; HIGH QUALITY; K-MEANS; MATRIX; NEAR-LINEAR TIME; NEW DIRECTIONS; NONNEGATIVE MATRIX FACTORIZATION; PAIRWISE SIMILARITY MATRIX; REAL-WORLD DATASETS; SCALABILITY ISSUE; SIMILARITY MATRIX; SINGLE MACHINES; SPECTRAL ANALYSIS; SPECTRAL ANALYSIS TECHNIQUES; SPECTRAL CLUSTERING;

BLIND SOURCE SEPARATION; CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST BENEFIT ANALYSIS; FACE RECOGNITION; FACTORIZATION; INFORMATION MANAGEMENT; MATRIX ALGEBRA; QUALITY CONTROL; SPECTRUM ANALYSIS;

CLUSTER ANALYSIS;

EID: 79957818756     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767925     Document Type: Conference Paper

References (31)

1. M. Halkidi, D. Gunopulos, M. Vazirgiannis, N. Kumar, and C. Domeniconi, "A clustering framework based on subjective and objective validity criteria," TKDD, vol. 1, no. 4, 2008.
2. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, 2000.
3. L. Hagen and A. Kahng, "New spectral methods for ratio cut partitioning and clustering," IEEE. Trans. on Computed Aided Desgin, vol. 11, pp. 1074-1085, 1992. (Pubitemid 23555831)
4. C. Ding, X. He, H. Zha, M. Gu, and H. Simon, "A min-max cut algorithm for graph partitioning and data clustering," ICDM, pp. 107-114, 2001.
5. C. Fowlkes, S. Belongie, F. R. K. Chung, and J. Malik, "Spectral grouping using the nystr̈om method," IEEE Trans. Pattern Anal. Mach. Intell, vol. 26, no. 2, pp. 214-225, 2004.
6. D. Luo, C. Ding, H. Huang, and T. Li, "Non-negative Laplacian Embedding," in Data Mining, 2009. ICDM'09. Ninth IEEE International Conference on. IEEE, 2009, pp. 337-346.
7. D. Luo, H. Huang, C. Ding, and F. Nie, "On the eigenvectors of p-Laplacian," Machine Learning, pp. 1-15, 2010.
8. F. Nie, D. Xu, I. Tsang, and C. Zhang, "Spectral embedded clustering," in Proceedings of the 21st international jont conference on Artifical intelligence, 2009, pp. 1181-1186.
9. W. Xu and Y. Gong, "Document clustering by concept factorization," SIGIR, pp. 202-209, 2004.
10. S. X. Yu and J. Shi, "Multiclass spectral clustering," Int'l Conf. on Computer Vision, 2003.
11. R. Liu and H. Zhang, "Segmentation of 3D meshes through spectral clustering," in Pacific Conference on Computer Graphics and Applications, 2004, pp. 298-305. (Pubitemid 40540327)
12. F. Chung, Spectral Graph Theory. Amer. Math. Society, 1997.
13. W. Gao, X. S. Li, C. Yang, and Z. Bai, "An implementation and evaluation of the AMLS method for sparse eigenvalue problems," ACM Transactions on Mathematical Software, vol. 34, no. 4, pp. 1-27, Jul. 2008.
14. A. J. Enright, S. V. Dongen, and C. A. Ouzounis, "An efficient algorithm for large-scale detection of protein families," Nucleic Acids Research, vol. 30, pp. 1575-1584, 2002. (Pubitemid 34679732)
15. C. Wang, M. Zhang, L. Ru, and S. Ma, "Automatic online news topic ranking using media focus and user attention based on aging theory," in CIKM, 2008, pp. 1033-1042.
16. W. Xu, X. Liu, and Y. Gong, "Document clustering based on nonnegative matrix factorization," in SIGIR, 2003, pp. 267-273.
17. W. E. Donath and A. J. Hoffman, "Lower bounds for the partitioning of graphs," IBM Journal of Research and Development, vol. 17, pp. 420-425, 1973.
18. I. S. Dhillon, Y. Guan, and B. Kulis, "A random walks view of spectral segmentation," in International Workshop on Artificial Intelligence and Statistics, 2001.
19. U. Von Luxburg, "A tutorial on spectral clustering," Statistics and Computing, vol. 17, no. 4, pp. 395-416, 2007.
20. C. Ding, "A tutorial on spectral clustering," ICML, 2004.
21. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE. Trans. on Pattern Analysis and Machine Intelligence, vol. 22, pp. 888-905, 2000.
22. L. Zelnik-Manor and P. Perona, "Self-tuning spectral clustering," in NIPS, 2004.
23. V. Kolmogorov and Y. Y. Boykov, "An experimental comparison of mincut/max-flow algorithms for energy minimization in vision," in CVPR, 2001, pp. 359-374. (Pubitemid 33331827)
24. D. Lee and H. Seung, "Algorithms for non-negative matrix factorization," in Advances in Neural Information Processing Systems 13. Cambridge, MA: MIT Press, 2001.
25. F. R. Bach and M. I. Jordan, "Learning spectral clustering," Neural Info. Processing Systems 16 (NIPS 2003), 2003.
26. J. L. Bentley, "Multidimensional binary search trees used for associative searching," Communications of the ACM, vol. 18, no. 9, pp. 509-517, Sep. 1975.
27. J. K. Uhlmann, "Satisfying general proximity/similarity queries with metric trees," Inf. Process. Lett, vol. 40, no. 4, pp. 175-179, 1991.
28. T. Liu, A. W. Moore, A. G. Gray, and K. Yang, "An investigation of practical approximate nearest neighbor algorithms," in NIPS, 2004.
29. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in VLDB. Morgan Kaufmann Publishers, 1999.
30. V. Herńandez, J. E. Roḿan, and V. Vidal, "SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems," ACM Trans. Math. Softw, vol. 31, no. 3, pp. 351-362, 2005.
31. K. J. Maschhoff and D. C. Sorensen, "A portable implementation of ARPACK for distributed memory parallel computers," in Proc. Copper Mountain Conf. on Iterative Methods, 1996.