Active Community Detection in Massive Graphs

Understand

A canonical problem in graph mining is the detection of dense communities.

• This problem is exacerbated for a graph with a large order and size -- the number of vertices and edges -- as many community detection algorithms scale poorly.
• In this work we propose a novel framework for detecting active communities that consist of the most active vertices in massive graphs.
• The framework is applicable to graphs having billions of vertices and hundreds of billions of edges.