One-Step Spectral Clustering via Dynamically Learning Affinity Matrix and Subspace


  • Xiaofeng Zhu Guangxi Normal University
  • Wei He Guangxi Normal University
  • Yonggang Li Guangxi Normal University
  • Yang Yang University of Electronic Science and Technology of China
  • Shichao Zhang Guangxi Normal University
  • Rongyao Hu Guangxi Normal University
  • Yonghua Zhu Guangxi University



This paper proposes a one-step spectral clustering method by learning an intrinsic affinity matrix (i.e., the clustering result) from the low-dimensional space (i.e., intrinsic subspace) of original data. Specifically, the intrinsic affinitymatrix is learnt by: 1) the alignment of the initial affinity matrix learnt from original data; 2) the adjustment of the transformation matrix, which transfers the original feature space into its intrinsic subspace by simultaneously conducting feature selection and subspace learning; and 3) the clustering result constraint, i.e., the graph constructed by the intrinsic affinity matrix has exact c connected components where c is the number of clusters. In this way, two affinity matrices and a transformation matrix are iteratively updated until achieving their individual optimum, so that these two affinity matrices are consistent and the intrinsic subspace is learnt via the transformation matrix. Experimental results on both synthetic and benchmark datasets verified that our proposed method outputted more effective clustering result than the previous clustering methods.




How to Cite

Zhu, X., He, W., Li, Y., Yang, Y., Zhang, S., Hu, R., & Zhu, Y. (2017). One-Step Spectral Clustering via Dynamically Learning Affinity Matrix and Subspace. Proceedings of the AAAI Conference on Artificial Intelligence, 31(1).