Next Article in Journal
From Enumerating to Generating: A Linear Time Algorithm for Generating 2D Lattice Paths with a Given Number of Turns
Previous Article in Journal
Multiobjective Cloud Particle Optimization Algorithm Based on Decomposition
Open AccessArticle

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

by Xiaoqi He 1,*, Sheng Zhang 1,2 and Yangguang Liu 1
1
School of Information Science and Engineering, Ningbo Institute of Technology, Zhejiang University, Ningbo 315100, China
2
School of Electronics and Information Engineering, Taiyuan University of Science and Technology, Taiyuan 030024, China
*
Author to whom correspondence should be addressed.
Academic Editor: Javier Del Ser Lorente
Algorithms 2015, 8(2), 177-189; https://doi.org/10.3390/a8020177
Received: 19 March 2015 / Revised: 27 April 2015 / Accepted: 28 April 2015 / Published: 7 May 2015
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. View Full-Text
Keywords: spectral clustering; similarity measures; Gaussian kernel function; importance of nearest neighbors spectral clustering; similarity measures; Gaussian kernel function; importance of nearest neighbors
Show Figures

Figure 1

MDPI and ACS Style

He, X.; Zhang, S.; Liu, Y. An Adaptive Spectral Clustering Algorithm Based on the Importance of Shared Nearest Neighbors. Algorithms 2015, 8, 177-189.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop