A Streaming Algorithm for Graph Clustering - Archive ouverte HAL
Conference Papers Year : 2017

A Streaming Algorithm for Graph Clustering

Abstract

We introduce a novel algorithm to perform graph clustering in the edge streaming setting. In this model, the graph is presented as a sequence of edges that can be processed strictly once. Our streaming algorithm has an extremely low memory footprint as it stores only three integers per node and does not keep any edge in memory. We provide a theoretical justification of the design of the algorithm based on the modularity function, which is a usual metric to evaluate the quality of a graph partition. We perform experiments on massive real-life graphs ranging from one million to more than one billion edges and we show that this new algorithm runs more than ten times faster than existing algorithms and leads to similar or better detection scores on the largest graphs.
Fichier principal
Vignette du fichier
final_paper.pdf (230.26 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01639506 , version 1 (20-11-2017)
hal-01639506 , version 2 (08-12-2017)

Identifiers

  • HAL Id : hal-01639506 , version 2

Cite

Alexandre Hollocou, Julien Maudet, Thomas Bonald, Marc Lelarge. A Streaming Algorithm for Graph Clustering. NIPS 2017 - Wokshop on Advances in Modeling and Learning Interactions from Complex Data, Dec 2017, Long Beach, United States. pp.1-12. ⟨hal-01639506v2⟩
883 View
1349 Download

Share

More