Abstract
This paper describes a new method of classification based on spectral analysis. The motivations behind developing the new model were the failures of the classical spectral cluster analysis based on combinatorial and normalized Laplacian for a set of real-world datasets of textual documents. Reasons of the failures are analysed. While the known methods are all based on usage of eigenvectors of graph Laplacians, a new classification method based on eigenvalues of graph Laplacians is proposed and studied.
Publisher
Public Library of Science (PLoS)
Reference46 articles.
1. An improved Nyström spectral graph clustering using k-core decomposition as a sampling strategy for large networks;J Tu;Journal of King Saud University—Computer and Information Sciences,2022
2. Sevi H, Jonckheere M, Kalogeratos A. Generalized Spectral Clustering for Directed and Undirected Graphs; 2022.
3. Text document clustering using Spectral Clustering algorithm with Particle Swarm Optimization;R Janani;Expert Systems with Applications,2019
4. Spectral Embedded Clustering: A Framework for In-Sample and Out-of-Sample Spectral Clustering;F Nie;IEEE Trans Neur Netw,2011
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献