Spectral clustering based on k-nearest neighbor graph

Authors:
Małgorzata Lucińska;Sławomir T. Wierzchoń
Affiliations:
Kielce University of Technology, Kielce, Poland;Institute of Computer Science Polish Academy of Sciences, Warsaw, Poland,University of Gdańsk, Gdańsk, Poland
Venue:
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
Year:
2012

Citing 6
Cited 0

Data clustering: a review

ACM Computing Surveys (CSUR)
A tutorial on spectral clustering

Statistics and Computing
Cluster Identification in Nearest-Neighbor Graphs

ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
On defining affinity graph for spectral clustering through ranking on manifolds

Neurocomputing
Data clustering: 50 years beyond K-means

Pattern Recognition Letters
Survey of clustering algorithms

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding clusters in data is a challenging task when the clusters differ widely in shapes, sizes, and densities. We present a novel spectral algorithm Speclus with a similarity measure based on modified mutual nearest neighbor graph. The resulting affinity matrix reflex the true structure of data. Its eigenvectors, that do not change their sign, are used for clustering data. The algorithm requires only one parameter --- a number of nearest neighbors, which can be quite easily established. Its performance on both artificial and real data sets is competitive to other solutions.