Name
Abstract | ||
|---|---|---|
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. Our framework utilizes a parallelizable trimming algorithm based on a locality statistic to filter out inactive vertices, and then clusters the remaining active vertices via spectral decomposition on their similarity matrix. We demonstrate the validity of our method with synthetic Stochastic Block Model graphs, using Adjusted Rand Index as the performance metric. We further demonstrate its practicality and efficiency on a most recent real-world Hyperlink Web graph consisting of over 3.5 billion vertices and 128 billion edges. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Discrete mathematics,Combinatorics,Path (graph theory),Hypercube graph,Computer science,Distance,Cycle graph,Matching (graph theory),Independent set,Multiple edges,Path graph |
DocType | Volume | Citations |
Journal | abs/1412.8576 | 4 |
PageRank | References | Authors |
0.43 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heng Wang | 1 | 14 | 6.46 |
| Da Zheng | 2 | 6 | 2.49 |
| Randal C. Burns | 3 | 8 | 4.19 |
| Carey E. Priebe | 4 | 505 | 108.56 |