Scaling Fine-grained Modularity Clustering for Massive Graphs
-
- Hiroaki Shiokawa
- Center for Computational Sciences, University of Tsukuba, Japan
-
- Toshiyuki Amagasa
- Center for Computational Sciences, University of Tsukuba, Japan
-
- Hiroyuki Kitagawa
- Center for Computational Sciences, University of Tsukuba, Japan
Description
<jats:p>Modularity clustering is an essential tool to understand complicated graphs. However, existing methods are not applicable to massive graphs due to two serious weaknesses. (1) It is difficult to fully reproduce ground-truth clusters due to the resolution limit problem. (2) They are computationally expensive because all nodes and edges must be computed iteratively. This paper proposes gScarf, which outputs fine-grained clusters within a short running time. To overcome the aforementioned weaknesses, gScarf dynamically prunes unnecessary nodes and edges, ensuring that it captures fine-grained clusters. Experiments show that gScarf outperforms existing methods in terms of running time while finding clusters with high accuracy.</jats:p>
Journal
-
- Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
-
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence 4597-4604, 2019-08
International Joint Conferences on Artificial Intelligence Organization
- Tweet
Keywords
- Social and Information Networks (cs.SI)
- FOS: Computer and information sciences
- Physics - Physics and Society
- FOS: Physical sciences
- Computer Science - Social and Information Networks
- Physics and Society (physics.soc-ph)
- Computer Science - Data Structures and Algorithms
- Data Structures and Algorithms (cs.DS)
- 62H30
Details 詳細情報について
-
- CRID
- 1360294648113354368
-
- Data Source
-
- Crossref
- OpenAIRE