Name
Abstract | ||
|---|---|---|
Community detection has become an extremely active area of research in recent years, with researchers proposing various new metrics and algorithms to address the problem. Recently, the Weighted Community Clustering (WCC) metric was proposed as a novel way to judge the quality of a community partitioning based on the distribution of triangles in the graph, and was demonstrated to yield superior results over other commonly used metrics like modularity. The same authors later presented a parallel algorithm for optimizing WCC on large graphs. In this paper, we propose a new distributed, vertex-centric algorithm for community detection using the WCC metric. Results are presented that demonstrate the algorithmu0027s performance and scalability on up to 32 worker machines and real graphs of up to 1.8 billion edges. The algorithm scales best with the largest graphs, finishing in just over an hour for the largest graph, and to our knowledge, it is the first distributed algorithm for optimizing the WCC metric. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2740908.2744715 | Proceedings of the 24th International Conference on World Wide Web Companion |
Keywords | Field | DocType |
Community detection, Distributed graph algorithms | Graph,Data mining,Computer science,Parallel algorithm,Theoretical computer science,Distributed algorithm,Cluster analysis,Modularity,Scalability | Journal |
Citations | PageRank | References |
1 | 0.35 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthew Saltz | 1 | 1 | 0.35 |
| Arnau Prat-Pérez | 2 | 227 | 13.44 |
| David Dominguez-Sal | 3 | 189 | 16.35 |