Research Area:  Machine Learning

Abstract:

We present a graph-theoretical approach to data clustering, which combines the creation of a graph from the data with Markov Stability, a multiscale community detection framework. We show how the multiscale capabilities of the method allow the estimation of the number of clusters, as well as alleviating the sensitivity to the parameters in graph construction. We use both synthetic and benchmark real datasets to compare and evaluate several graph construction methods and clustering algorithms, and show that multiscale graph-based clustering achieves improved performance compared to popular clustering methods without the need to set externally the number of clusters.

Keywords:  
Multiscale community detection
Clustering
Graph partitioning
Data mining

Author(s) Name:  Zijing Liu, Mauricio Barahona

Publisher name:  Springer

DOI:  10.1007/s41109-019-0248-7

Volume Information:  Volume 5

Paper Link:   https://link.springer.com/article/10.1007/s41109-019-0248-7