Distributed Graph Clustering and Sparsification

11/03/2017
by   He Sun, et al.
0

Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of algorithmic design methods for graph clustering. Most of these methods, however, are based on complicated spectral techniques or convex optimisation, and cannot be directly applied for clustering many networks that occur in practice, whose information is often collected on different sites. Designing a simple and distributed clustering algorithm is of great interest, and has wide applications for processing big datasets. In this paper we present a simple and distributed algorithm for graph clustering: for a wide class of graphs that are characterised by a strong cluster-structure, our algorithm finishes in a poly-logarithmic number of rounds, and recovers a partition of the graph close to optimal. One of the main components behind our algorithm is a sampling scheme that, given a dense graph as input, produces a sparse subgraph that provably preserves the cluster-structure of the input. Compared with previous sparsification algorithms that require Laplacian solvers or involve combinatorial constructions, this component is easy to implement in a distributed way and runs fast in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2020

A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering

Spectral sparsification is a technique that is used to reduce the number...
research
10/26/2017

Simple Distributed Graph Clustering using Modularity and Map Equation

We study large-scale, distributed graph clustering. Given an undirected,...
research
06/15/2021

Correlation Clustering in Constant Many Parallel Rounds

Correlation clustering is a central topic in unsupervised learning, with...
research
05/05/2020

Clustering for Graph Datasets via Gumbel Softmax

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

Expander Decomposition and Pruning: Faster, Stronger, and Simpler

We study the problem of graph clustering where the goal is to partition ...
research
01/06/2008

Batch kernel SOM and related Laplacian methods for social network analysis

Large graphs are natural mathematical models for describing the structur...
research
03/11/2023

Distributed Solution of the Inverse Rig Problem in Blendshape Facial Animation

The problem of rig inversion is central in facial animation as it allows...

Please sign up or login with your details

Forgot password? Click here to reset