Scalable Normalized Cut with Improved Spectral Rotation

  title={Scalable Normalized Cut with Improved Spectral Rotation},
  author={Xiaojun Chen and Feiping Nie and Joshua Zhexue Huang and Min Yang},
Many spectral clustering algorithms have been proposed and successfully applied to many highdimensional applications. However, there are still two problems that need to be solved: 1) existing methods for obtaining the final clustering assignments may deviate from the true discrete solution, and 2) most of these methods usually have very high computational complexity. In this paper, we propose a Scalable Normalized Cut method for clustering of large scale data. In the new method, an efficient… CONTINUE READING


Publications referenced by this paper.

In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence

  • Feiping Nie, Xiaoqian Wang, Michael Jordan, Heng Huang. The constrained laplacian rank algorithm fo clustering
  • pages –1976,
  • 2016
Highly Influential
6 Excerpts

In International Conference on Machine Learning

  • Wei Liu, Junfeng He, Shih Fu Chang. Large graph construction for scalable se learning
  • pages 679–686,
  • 2010
Highly Influential
7 Excerpts

In Proceedings of IEEE International Conference on Computer Vision

  • Stella X. Yu, Jianbo Shi. Multiclass spectral clustering
  • pages 313–319 vol.1,
  • 2003
Highly Influential
10 Excerpts

et al

  • Andrew Y Ng, Michael I Jordan, Yair Weiss
  • On spectral clustering: Analysis and an algorithm…
  • 2002
Highly Influential
10 Excerpts

In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

  • Donghui Yan, Ling Huang, Michael I Jordan. Fast approximate spectral clustering
  • pages 907–916,
  • 2009
Highly Influential
7 Excerpts

Lrec 2008

  • Hiroyuki Shinnou, Minoru Sasaki. Spectral clustering for a large data set b Resources, Evaluation
  • 26 May 1 June , Marrakech, Morocco, pages 201–204…
  • 2008
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…