Skip to Main content Skip to Navigation
Conference papers

Spectral Clustering Based on Analysis of Eigenvector Properties

Abstract : In this paper we propose a new method for choosing the number of clusters and the most appropriate eigenvectors, that allow to obtain the optimal clustering. To accomplish the task we suggest to examine carefully properties of adjacency matrix eigenvectors: their weak localization as well as the sign of their values. The algorithm has only one parameter — the number of mutual neighbors. We compare our method to several clustering solutions using different types of datasets. The experiments demonstrate that our method outperforms in most cases many other clustering algorithms.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, November 30, 2016 - 10:46:20 AM
Last modification on : Monday, January 22, 2018 - 11:08:07 AM
Long-term archiving on: : Monday, March 27, 2017 - 7:48:21 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Małgorzata Lucińska, Sławomir T. Wierzchoń. Spectral Clustering Based on Analysis of Eigenvector Properties. 13th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Nov 2014, Ho Chi Minh City, Vietnam. pp.43-54, ⟨10.1007/978-3-662-45237-0_6⟩. ⟨hal-01405553⟩



Record views


Files downloads