An Adaptive Spectral Clustering Algorithm Based on the Importance of Shared Nearest Neighbors

Algorithms

Xiaoqi He¹  Sheng Zhang¹  Yangguang Liu¹ 

[1] School of Information Science and Engineering, Ningbo Institute of Technology, Zhejiang University, Ningbo 315100, China; E-Mails:

关键词: spectral clustering;    similarity measures;    Gaussian kernel function;    importance of nearest neighbors;   

DOI  :  10.3390/a8020177

来源: mdpi

【 摘 要 】

The construction of a similarity matrix is one significant step for the spectral clustering algorithm; while the Gaussian kernel function is one of the most common measures for constructing the similarity matrix. However, with a fixed scaling parameter, the similarity between two data points is not adaptive and appropriate for multi-scale datasets. In this paper, through quantitating the value of the importance for each vertex of the similarity graph, the Gaussian kernel function is scaled, and an adaptive Gaussian kernel similarity measure is proposed. Then, an adaptive spectral clustering algorithm is gotten based on the importance of shared nearest neighbors. The idea is that the greater the importance of the shared neighbors between two vertexes, the more possible it is that these two vertexes belong to the same cluster; and the importance value of the shared neighbors is obtained with an iterative method, which considers both the local structural information and the distance similarity information, so as to improve the algorithm’s performance. Experimental results on different datasets show that our spectral clustering algorithm outperforms the other spectral clustering algorithms, such as the self-tuning spectral clustering and the adaptive spectral clustering based on shared nearest neighbors in clustering accuracy on most datasets.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland.