Noise robust spectral clustering

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2007, Pages

  Li, Zhenguo ^a   Liu, Jianzhuang ^a   Chen, Shifeng ^a   Tang, Xiaoou ^a,b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; PHOTOMAPPING;

DATA REPRESENTATIONS; NUMBER OF CLUSTERS; ROBUSTNESS AGAINST NOISE; SPATIAL INFORMATIONS; SPECTRAL CLUSTERING; SPECTRAL CLUSTERING ALGORITHMS; SPECTRAL CLUSTERING METHODS; SYNTHETIC AND REAL DATA;

CLUSTERING ALGORITHMS;

EID: 50649124911     PISSN: 15505499     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2007.4409061     Document Type: Conference Paper

References (21)

1. M. Brand and K. Huang. A unifying theorem for spectral embedding and clustering. In AISTATS, 2003.
2. O. Chapelle, J. Weston, and B. Scholkopf. Cluster kernels for semi-supervised learning. In NIPS, 2003.
3. A. Fred and A. Jain. Robust data clustering. In CVPR, pages 128-133, 2003.
4. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. J. ACM, 51(3):497-515, 2004.
5. R. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete input spaces. In ICML, 2002.
6. M. Meila and J. Shi. Learning segmentation by random walks. In NIPS, pages 873-879, 2000.
7. B. Nadler, S. Lafon, R. Coifman, and I. Kevrekidis. Diffusion maps, spectral clustering and eigenfunctions of fokkerplanck operators. In NIPS, pages 955-962, 2006.
8. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849-856, 2001.
9. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. PAMI, 22(8):888-905, 2000.
10. A. Smola and R. Kondor. Kernels and regularization on graphs. In COLT, 2003.
11. G. W. Stewart and J.-G. Sun. Matrix Perturbation Theory. Academic Press, San Diego, 1990.
12. A. Strehl and J. Ghosh. Cluster ensembles- A knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3(3):583-617, 2003.
13. H. Valizadegan and R. Jin. Generalized maximum margin clustering and unsupervised kernel learning. In NIPS, 2007.
14. D. Verma and M. Meila. A comparison of spectral clustering algorithms. Technical Report 03-05-01, University of Washington Department of Computer Science, 2003.
15. Y.Weiss. Segmentation using eigenvectors: A unifying view. In ICCV, pages 975-982, 1999.
16. S. X. Yu and J. Shi. Multiclass spectral clustering. In ICCV, pages 313-319, 2003.
17. L. Zelnik-Manor and P. Perona. Self-tuning spectral clustering. In NIPS, pages 1601-1608, 2005.
18. T. Zhang and R. Ando. Analysis of spectral kernel design based semi-supervised learning. In NIPS, volume 18, pages 1601-1608.
19. D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf. Learning with local and global consistency. In NIPS, 2004.
20. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, 2003.
21. X. Zhu, J. Kandola, Z. Ghahramani, and J. Lafferty. Nonparametric transforms of graph kernels for semi-supervised learning. In NIPS, pages 1641-1648, 2005.