AMOS: An Automated Model Order Selection Algorithm for Spectral Graph Clustering

09/21/2016
by   Pin-Yu Chen, et al.
0

One of the longstanding problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. In this paper, we propose AMOS, an automated model order selection algorithm for SGC. Based on a recent analysis of clustering reliability for SGC under the random interconnection model, AMOS works by incrementally increasing the number of clusters, estimating the quality of identified clusters, and providing a series of clustering reliability tests. Consequently, AMOS outputs clusters of minimal model order with statistical clustering reliability guarantees. Comparing to three other automated graph clustering methods on real-world datasets, AMOS shows superior performance in terms of multiple external and internal clustering metrics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2016

Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering

One of the longstanding open problems in spectral graph clustering (SGC)...
research
01/23/2020

Towards Automatic Clustering Analysis using Traces of Information Gain: The InfoGuide Method

Clustering analysis has become a ubiquitous information retrieval tool i...
research
08/08/2017

Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms

Multilayer graphs are commonly used for representing different relations...
research
10/11/2018

FeatureLego: Volume Exploration Using Exhaustive Clustering of Super-Voxels

We present a volume exploration framework, FeatureLego, that uses a nove...
research
06/08/2015

A Topological Approach to Spectral Clustering

We propose a clustering algorithm which, for input, takes data assumed t...
research
06/09/2021

Local Algorithms for Finding Densely Connected Clusters

Local graph clustering is an important algorithmic technique for analysi...
research
09/26/2019

An agglomerative hierarchical clustering method by optimizing the average silhouette width

An agglomerative hierarchical clustering (AHC) framework and algorithm n...

Please sign up or login with your details

Forgot password? Click here to reset