[1909.04491] Graph-based data clustering via multiscale community detection

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.

2 mentions: @alexvespi@net_science
Date: 2019/09/11 14:18

Referring Tweets

@alexvespi Graph-based data clustering via multiscale community detection “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” t.co/hEKezS363D t.co/68ii0c2Z6H
@net_science Graph-based data clustering via multiscale community detection. (arXiv:1909.04491v1 [t.co/g6FKCMeJQg]) t.co/iMrcR7WabV

Related Entries

Read more GitHub - CHLWR/KDD2019_K-Multiple-Means: Implementation for the paper "K-Multiple-Means: A Multiple-...
0 users, 1 mentions 2019/08/07 20:17
Read more [論文メモ] SCDV : Sparse Composite Document Vectors using soft clustering over distributional representa...
4 users, 1 mentions 2019/03/16 06:47
Read more GitHub - DwangoMediaVillage/pqkmeans: Fast and memory-efficient clustering
6 users, 2 mentions 2019/11/13 14:20
Read more Masa.I on Twitter: "Deep Clustering for Unsupervised Learning of Visual Features 教師なし事前学習の手法DeepClus...
0 users, 0 mentions 2018/07/22 09:23
Read more GitHub - IBM/WordMoversEmbeddings: WordMoversEmbeddings(WME) is a simple code for generating the vec...
2 users, 0 mentions 2019/05/15 15:48