光谱聚类
聚类分析
计算机科学
嵌入
水准点(测量)
可扩展性
算法
矩阵分解
人工智能
特征向量
大地测量学
量子力学
数据库
物理
地理
作者
Zhen Wang,Xiangfeng Dai,Peican Zhu,Rong Wang,Xuelong Li,Feiping Nie
出处
期刊:IEEE Transactions on Knowledge and Data Engineering
[Institute of Electrical and Electronics Engineers]
日期:2021-01-01
卷期号:: 1-1
被引量:6
标识
DOI:10.1109/tkde.2021.3098806
摘要
Spectral clustering is a vital clustering method and has been widely applied for data analysis and pattern reorganization. A routine of solving spectral clustering problem consists of two successive stages: (1) solving a relaxed continuous optimization problem to obtain a real-valued indicator solution (2) transform the real-valued indicator into a 0-1 discrete one as the final clustering result. However, we may lose the optimal solution with such a two-stage process. Besides, the spectral clustering has a high time complexity which limits the analysis of large-scale data. To alleviate these problems, this paper proposes an efficient spectral clustering framework that computes spectral embedding and improved spectral rotation simultaneously (SE-ISR). In addition, we also provide a parameter-free method (SE-ISR-PF) to automatically choose the trade-off parameter. Furthermore, with an anchor-based similarity matrix construction, it is scalable to large-scale data. An effective algorithm with a strict convergence proof is provided to solve the corresponding optimization problem. Experimental results on several benchmark datasets demonstrate that the proposed algorithm outperforms the state-of-art methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI