Fast Algorithm for Modularity-Based Graph Clustering

In AI and Web communities, modularity-based graph clustering algorithms are being applied to various applications. However, existing algorithms are not applied to large graphs because they have to scan all vertices/edges iteratively. The goal of this paper is to efficiently compute clusters with high modularity from extremely large graphs with more than a few billion edges. The heart of our solution is to compute clusters by incrementally pruning unnecessary vertices/edges and optimizing the order of vertex selections. Our experiments show that our proposal outperforms all other modularity-based algorithms in terms of computation time, and it finds clusters with high modularity.

Authors

• Hiroaki Shiokawa
• Yasuhiro Fujiwara NTT Communication Science Laboratories
• Makoto Onizuka Osaka University

Keywords

No keywords are indexed for this paper.