Skip to Main content Skip to Navigation
Conference papers

Spectral Clustering Based on k-Nearest Neighbor Graph

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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01551732
Contributor : Hal Ifip <>
Submitted on : Friday, June 30, 2017 - 2:43:22 PM
Last modification on : Wednesday, September 16, 2020 - 11:06:02 AM
Long-term archiving on: : Monday, January 22, 2018 - 9:34:48 PM

File

978-3-642-33260-9_22_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Małgorzata Lucińska, Sławomir 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⟩

Share

Metrics

Record views

230

Files downloads

3266