Spectral Clustering Based on k-Nearest Neighbor Graph - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Spectral Clustering Based on k-Nearest Neighbor Graph

(1) , (2, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
978-3-642-33260-9_22_Chapter.pdf (355.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01551732 , version 1 (30-06-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Małgorzata Lucińska, Sławomir T. Wierzchoń. Spectral Clustering Based on k-Nearest Neighbor Graph. 11th International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2012, Venice, Italy. pp.254-265, ⟨10.1007/978-3-642-33260-9_22⟩. ⟨hal-01551732⟩
155 View
3675 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More