Clustering Based on Eigenvectors of the Adjacency Matrix Cover

.blurhash-client-img { display: none !important; }

Clustering Based on Eigenvectors of the Adjacency Matrix

International Journal of Applied Mathematics and Computer Science

Volume 28 (2018): Issue 4 (December 2018)

By: Małgorzata Lucińska and Sławomir T. Wierzchoń

Open Access

|Jan 2019

Authors

Małgorzata Lucińska

lucinska@tu.kielce.pl

Department of Management and Computer Modelling Kielce University of Technology, Al. 1000-lecia PP 7, 25-314, Kielce, Poland

Sławomir T. Wierzchoń

Institute of Computer Science Polish Academy of Sciences, ul. Jana Kazimierza 5, 01-248, Warsaw, Poland

DOI: https://doi.org/10.2478/amcs-2018-0059 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X

Journal RSS Feed

Language: English

Page range: 771 - 786

Submitted on: Oct 2, 2017

|

Accepted on: Jun 10, 2018

|

Published on: Jan 11, 2019

Published by: University of Zielona Góra

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

spectral clustering,

adjacency matrix eigenvalues/eigenvectors,

graph perturbation theory,

eigengap heuristics

Related subjects:

Applied mathematics

© 2019 Małgorzata Lucińska, Sławomir T. Wierzchoń, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous article Volume 28 (2018): Issue 4 (December 2018)Next article