Topology-Guided Sampling for Fast and Accurate Community Detection

08/15/2021
by   Frank Wanye, et al.
0

Community detection is a well-studied problem with applications in domains ranging from computer networking to bioinformatics. While there are many algorithms that perform community detection, the more accurate and statistically robust algorithms tend to be slow and hard to parallelize. One way to speed up such algorithms is through data reduction. However, this approach has not been thoroughly studied, and the quality of results obtained with this approach varies with the graph it is applied to. In this manuscript, we present an approach based on topology-guided sampling for accelerating stochastic block partitioning - a community detection algorithm that works well on graphs with complex and heterogeneous community structure. We also introduce a degree-based thresholding scheme that improves the efficacy of our approach at the expense of speedup. Finally, we perform a series of experiments on synthetically generated graphs to determine how various graph parameters affect the quality of results and speedup obtained with our approach, and we validate our approach on real-world data. Our results show that our approach can lead to a speedup of up to 15X over stochastic block partitioning without sampling while maintaining result quality and can even lead to improvements of over 150 in result quality in terms of F1 score on certain kinds of graphs.

READ FULL TEXT

page 16

page 18

page 19

page 20

page 21

page 25

research
04/16/2019

Efficient Distributed Community Detection in the Stochastic Block Model

Designing effective algorithms for community detection is an important a...
research
05/30/2023

Exact Distributed Stochastic Block Partitioning

Stochastic block partitioning (SBP) is a community detection algorithm t...
research
10/12/2021

Incremental Community Detection in Distributed Dynamic Graph

Community detection is an important research topic in graph analytics th...
research
01/22/2020

Adversarial Attack on Community Detection by Hiding Individuals

It has been demonstrated that adversarial graphs, i.e., graphs with impe...
research
09/06/2020

Detecting User Community in Sparse Domain via Cross-Graph Pairwise Learning

Cyberspace hosts abundant interactions between users and different kinds...
research
08/29/2022

Dynamic Network Sampling for Community Detection

We propose a dynamic network sampling scheme to optimize block recovery ...
research
03/30/2022

Ordered community detection in directed networks

We develop a method to infer community structure in directed networks wh...

Please sign up or login with your details

Forgot password? Click here to reset