Linear KernelPCA and K-Means Clustering Using New Estimated Eigenvectors of the Sample Covariance Matrix
2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA)(2015)
摘要
In this article, random matrix theory is used to propose a new K-means clustering algorithm via linear PCA. Our approach is devoted to linear PCA estimation when the number of the features d and the number of samples n go to infinity at the same rate. More precisely, we deal with the problem of building a consistent estimator of the eigenvectors of the covariance data matrix. Numerical results, based on the normalized mutual information (NMI) and the final error rate (ER), are provided and support our algorithm, even for a small number of features/samples. We also compare our approach to spectral clustering, K-means and traditional PCA methods.
更多查看译文
关键词
High dimensional data,Clustering,kernel PCA,K-means,random matrix
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要