Comparison and Benchmark of Graph Clustering Algorithms

05/10/2020
by   Lizhen Shi, et al.
0

Graph clustering is widely used in analysis of biological networks, social networks and etc. For over a decade many graph clustering algorithms have been published, however a comprehensive and consistent performance comparison is not available. In this paper we benchmarked more than 70 graph clustering programs to evaluate their runtime and quality performance for both weighted and unweighted graphs. We also analyzed the characteristics of ground truth that affects the performance. Our work is capable to not only supply a start point for engineers to select clustering algorithms but also could provide a viewpoint for researchers to design new algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2021

Weighted Graph Nodes Clustering via Gumbel Softmax

Graph is a ubiquitous data structure in data science that is widely appl...
research
06/10/2021

Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time

We study the widely used hierarchical agglomerative clustering (HAC) alg...
research
05/05/2020

Clustering for Graph Datasets via Gumbel Softmax

Recently, in many systems such as speech recognition and visual processi...
research
09/14/2018

Ensemble Clustering for Graphs

We propose an ensemble clustering algorithm for graphs (ECG), which is b...
research
05/12/2020

Automatic clustering of Celtic coins based on 3D point cloud pattern analysis

The recognition and clustering of coins which have been struck by the sa...
research
02/25/2021

Performance Comparison for Scientific Computations on the Edge via Relative Performance

In a typical Internet-of-Things setting that involves scientific applica...
research
11/24/2014

Consistency of Cheeger and Ratio Graph Cuts

This paper establishes the consistency of a family of graph-cut-based al...

Please sign up or login with your details

Forgot password? Click here to reset