%0 Conference Proceedings
%T Spectral Clustering Based on k-Nearest Neighbor Graph
%+ Kielce University of Technology
%+ Institute of Computer Science [Warsaw]
%+ University of Gdańsk (UG)
%A Lucińska, Małgorzata
%A Wierzchoń, Sławomir, T.
%Z Part 5: Algorithms and Data Management
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th International Conference on Computer Information Systems and Industrial Management (CISIM)
%C Venice, Italy
%Y Agostino Cortesi
%Y Nabendu Chaki
%Y Khalid Saeed
%Y Sławomir Wierzchoń
%I Springer
%3 Computer Information Systems and Industrial Management
%V LNCS-7564
%P 254-265
%8 2012-09-26
%D 2012
%R 10.1007/978-3-642-33260-9_22
%K Spectral clustering
%K nearest neighbor graph
%K signless Laplacian
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 8
%2 https://inria.hal.science/hal-01551732/document
%2 https://inria.hal.science/hal-01551732/file/978-3-642-33260-9_22_Chapter.pdf
%L hal-01551732
%U https://inria.hal.science/hal-01551732
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC8
%~ IFIP-CISIM
%~ IFIP-LNCS-7564