DeepAI AI Chat
Log In Sign Up

Speeding Up BigClam Implementation on SNAP

by   C. H. Bryan Liu, et al.

We perform a detailed analysis of the C++ implementation of the Cluster Affiliation Model for Big Networks (BigClam) on the Stanford Network Analysis Project (SNAP). BigClam is a popular graph mining algorithm that is capable of finding overlapping communities in networks containing millions of nodes. Our analysis shows a key stage of the algorithm - determining if a node belongs to a community - dominates the runtime of the implementation, yet the computation is not parallelized. We show that by parallelizing computations across multiple threads using OpenMP we can speed up the algorithm by 5.3 times when solving large networks for communities, while preserving the integrity of the program and the result.


LazyFox: Fast and parallelized overlapping community detection in large graphs

The detection of communities in graph datasets provides insight about a ...

Using Model-based Overlapping Seed Expansion to detect highly overlapping community structure

As research into community finding in social networks progresses, there ...

A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks

This paper presents a novel spectral algorithm with additive clustering ...

Overlapping and nonoverlapping models

Consider a directed network with K_r row communities and K_c column comm...

GI-OHMS: Graphical Inference to Detect Overlapping Communities

Discovery of communities in complex networks is a topic of considerable ...

Efficient Methods for Approximating the Shapley Value for Asset Sharing in Energy Communities

With the emergence of energy communities, where a number of prosumers in...