Q-analysis clustering
DOI:
https://doi.org/10.18046/syt.v8i15.1022Keywords:
Clustering, Q-analysis, topology, networks, graphs.Abstract
This article presents a novel clustering algorithm, based upon topology concepts and Q-analysis. The algorithm allows to create a structural clustering, which does not depend on the knowledge of similarity measures, distances, etc. The clustering is directed in a natural fashion by the internal topology of the network/ graph. Such topology becomes evident by applying Q-analysis, by means of the structure vector, which shows the network’s internal Q-connectivity.
Downloads
Published
Issue
Section
License
This journal is licensed under the terms of the CC BY 4.0 licence (https://creativecommons.org/licenses/by/4.0/legalcode).