An Improved Spectral Clustering Algorithm Using Minimum Maximum Principle
In this paper a novel document clustering spectral algorithm is proposed,which uses a minimum maximum principle.Firstly the low dimensional embedding of documents is attained by eigenvalue decomposition,and then a minimum maximum principle is used to get the initial seeds for k-means algorithm.Finally,K-means algorithm is performed to get the clustering results.Experimental results show that the clustering results found by this method is better than traditional clustering algorithm.
spectral clustering minimum maximum principle normalized mutual information
Xu Xiu-fang Xu Sen Zhou Tian
Yancheng Institute of Technology,College of Information Engineering,Yancheng 224051,China Science and technology on Underwater Acoustic Laboratory,Harbin Engineering University,Harbin 150001
国际会议
沈阳
英文
1881-1884
2012-09-07(万方平台首次上网日期,不代表论文的发表时间)