Local density adaptive similarity measurement for spectral clustering

Pattern Recognition Letters

Volumn 32, Issue 2, 2011, Pages 352-358

  Zhang, Xianchao ^a   Li, Jingwei ^a   Yu, Hong ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Clustering; Similarity measure; Spectral clustering

Indexed keywords

AFFINITY MATRIX; BLOCK DIAGONAL; CLUSTERING; DATA POINTS; EUCLIDEAN DISTANCE; GAUSSIAN KERNEL FUNCTIONS; INTRA-CLUSTER; KERNEL PARAMETER; LOCAL DENSITY; PATH-BASED; REAL WORLD DATA; SELFTUNING; SIMILARITY MEASURE; SIMILARITY MEASUREMENTS; SPECTRAL CLUSTERING;

FACE RECOGNITION;

CLUSTERING ALGORITHMS;

EID: 78649332752     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2010.09.014     Document Type: Article

References (20)

1. Asuncion, A; Newman, D; 2007. UCI Machine Learning Repository. .
2. Bach, F; Jordan, M; 2003. Learning spectral clustering. In: Proceedings of NIPS'03, pp. 305-312.
3. H. Chang, and D-Y. Yeung Robust path-based spectral clustering Pattern Recognit. 41 1 2008 191 203
4. Ding, C; 2004. A tutorial on spectral clustering. Tutorial given at ICML'04, .
5. Ding C; He X; Zha H; et al; 2001. A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings of ICDM'01, pp.107-114.
6. B. Fischer, and J.M. Buhmann Path-based clustering for grouping of smooth curves and texture segmentation IEEE Trans. Pattern Anal. Machine Intell. 25 4 2003 513 518
7. Fischer, I; Poland, J; 2005. Amplifying the block matrix structure for spectral clustering. In Proceedings of 14th Annual Machine Learning Conference of Belgium and The Netherlands, pp. 21-28.
8. Hagen, L; Kahng, A; 1992. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Computer-Aided Design, 11(9), pp. 1074-1085.
9. Jin, R; Ding, C; Kang, F; 2006. A probabilistic approach for optimizing spectral clustering. In: Proceedings of NIPS'06, pp. 571-578.
10. Y. LeCun, B. Boser, J.S. Denker, D. Henderson, R.E. Howard, W. Hubbard, and L.J. Jackel Backpropagation applied to handwritten zip code recognition Neural Comput. 1 4 1989 541 551
11. H. Lütkepohl Handbook of Matrices 1997 Wiley Chichester
12. U. Luxburg A tutorial on spectral clustering Statistics and Computing 17 4 2007 395 416
13. MacQueen, J.B; 1967. Some Methods for classification and Analysis of Multivariate Observations. In: Proceedings of Berkeley Symposium on Mathematical Statistics and Probability, pp. 281-297.
14. Ng, A; Jordan, M; Weiss, Y; 2001. On spectral clustering: Analysis and an algorithm. In: Proceedings of NIPS'01, pp. 849-856.
15. J. Shi, and J. Malik Normalized cuts and image segmentation IEEE Trans. Pattern Anal. Machine Intell. 22 8 2000 888 905
16. A. Strehl, and J. Ghosh Cluster ensembles-a knowledge reuse framework for combining multiple partitions J. Mach. Learn. Res. 3 3 2003 583 617
17. Wagner, D; Wagner, F; 1993. Between min cut and graph bisection. In Proceedings of MFCS'93, pp.744-750.
18. T. Xia, J. Cao, Y. Zhang, and J. Li On defining affinity graph for spectral clustering through ranking on manifolds Neurocomputing 72 13-15 2008 3203 3211
19. Zelnik-Manor, L; Perona, P;2004. Self-tuning spectral clustering. In Proceedings of NIPS'04, pp. 1601-1608.
20. Zhou, D; Bousquet, O; Lal, T; Weston, J; Schölkopf, B; 2004. Learning with local and global consistency. In Proceedings of NIPS'04, pp. 321-328.