Proceedings

Spectral Embedded Clustering

Download BibTeX Cite

Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1181-1185.

© 2009 International Joint Conferences on Artificial Intelligence

Abstract

In this paper, we propose a new spectral clustering method, referred to as Spectral Embedded Clustering (SEC), to minimize the normalized cut criterion in spectral clustering as well as control the mismatch between the cluster assignment matrix and the low dimensional embedded representation of the data. SEC is based on the observation that the cluster assignment matrix of high dimensional data can be represented by a low dimensional linear mapping of data. We also discover the connection between SEC and other clustering methods, such as spectral clustering, Clustering with local and global regularization, K-means and Discriminative K-means. The experiments on many real-world data sets show that SEC significantly outperforms the existing spectral clustering methods as well as K-means clustering related methods.Feiping Nie, Dong Xu, Ivor Wai-Hung Tsang, Changshui Zhang

  1. [Ben-Hur et al., 2001] A. Ben-Hur, D. Horn, H.T. Siegelmann, and V. Vapnik. Support vector clustering. 2:125-137, 2001.
  2. [Cai et al., 2005] Deng Cai, Xiaofei He, and Jiawei Han. Docu- ment clustering using locality preserving indexing. IEEE Trans. Knowl. Data Eng., 17(12):1624-1637, 2005.
  3. [Ding and Li, 2007] Chris H. Q. Ding and Tao Li. Adaptive dimen- sion reduction using discriminant analysis and -means clustering. In ICML, pages 521-528, 2007.
  4. [Ding et al., 2002] Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, and Horst D. Simon. Adaptive dimension reduction for clustering high dimensional data. In ICDM, pages 147-154, 2002.
  5. [Jain and Dubes, 1988] A.K. Jain and R.C. Dubes. Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, NJ, 1988.
  6. [la Torre and Kanade, 2006] Fernando De la Torre and Takeo Kanade. Discriminative cluster analysis. In ICML, pages 241- 248, 2006.
  7. [Li et al., 2004] Tao Li, Sheng Ma, and Mitsunori Ogihara. Docu- ment clustering via adaptive subspace iteration. In SIGIR, pages 218-225, 2004.
  8. [Li et al., 2009] Y. Li, I.W. Tsang, J. T. Kwok, and Z. Zhou. Tighter and convex maximum margin clustering. In AISTATS, 2009.
  9. [McLachlan and Peel, 2000] G. McLachlan and D. Peel. Finite Mixture Models. John Wiley & Sons, New York, 2000.
  10. [Ng et al., 2001] Andrew Y. Ng, Michael I. Jordan, and Yair Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849-856, 2001.
  11. [Shi and Malik, 2000] Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 22(8):888-905, 2000.
  12. [Wang et al., 2007] Fei Wang, Changshui Zhang, and Tao Li. Clus- tering with local and global regularization. In AAAI, pages 657- 662, 2007.
  13. [Wu and Schölkopf, 2007] M. Wu and B. Schölkopf. Transductive classification via local learning regularization. In AISTATS, pages 628-635, 03 2007.
  14. [Xu et al., 2005] L. Xu, J. Neufeld, B. Larson, and D. Schuurmans. Maximum margin clustering. Cambridge, MA, 2005. MIT Press.
  15. [Ye et al., 2007] Jieping Ye, Zheng Zhao, and Huan Liu. Adaptive distance metric learning for clustering. In CVPR, 2007.
  16. [Ye et al., 2008] Jieping Ye, Zheng Zhao, and Mingrui Wu. Dis- criminative k-means for clustering. In Advances in Neural Infor- mation Processing Systems 20, pages 1649-1656. 2008.
  17. [Ye, 2005] Jieping Ye. Characterization of a family of algorithms for generalized discriminant analysis on undersampled problems. Journal of Machine Learning Research, 6:483-502, 2005.
  18. [Ye, 2007] Jieping Ye. Least squares linear discriminant analysis. In ICML, pages 1087-1093, 2007.
  19. [Yu and Shi, 2003] Stella X. Yu and Jianbo Shi. Multiclass spectral clustering. In ICCV, pages 313-319, 2003.
  20. [Zelnik-Manor and Perona, 2004] Lihi Zelnik-Manor and Pietro Perona. Self-tuning spectral clustering. In NIPS, 2004.
  21. [Zha et al., 2001] Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming Gu, and Horst D. Simon. Spectral relaxation for k-means clustering. In NIPS, pages 1057-1064, 2001.
  22. [Zhang et al., 2007] K. Zhang, I.W. Tsang, and J.T. Kwok. Maxi- mum margin clustering made practical. In ICML, Corvallis, Ore- gon, USA, June 2007.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards