An adaptive spectral clustering algorithm based on the importance of shared nearest neighbors
type: Item
instance of: scholarly article
title: An adaptive spectral clustering algorithm based on the importance of shared nearest neighbors
zbMATH Open document ID: 1461.62097
author: Xiaoqi He
author: Sheng Zhang
author: Yangguang Liu
published in: Algorithms
publication date: 2019-03-26T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 62H30
zbMATH DE Number: 7042244
zbMATH Keywords: spectral clustering
zbMATH Keywords: similarity measures
zbMATH Keywords: Gaussian kernel function
zbMATH Keywords: importance of nearest neighbors
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a8020177
OpenAlex ID: W1577476228
cites work: Robust path-based spectral clustering
cites work: A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
cites work: Authoritative sources in a hyperlinked environment
DOI: 10.3390/A8020177
description: scientific article; zbMATH DE number 7042244