Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A Distributed and Incremental Algorithm for Large-Scale Graph Clustering

Abstract : Graph clustering is one of the key techniques to understand the structures present in the graph data. In addition to cluster detection, the identification of hubs and outliers is also a critical task as it plays an important role in the analysis of graph data. Recently, several graph clustering algorithms have been proposed and used in many application domains such as biological network analysis, recommendation systems and community detection. Most of these algorithms are based on the structural clustering algorithm SCAN. Yet, SCAN algorithm has been designed for small graphs, without significant support to deal with big and dynamic graphs. In this paper, we propose DISCAN, a novel distributed and incremental graph clustering algorithm based on SCAN. We present an implementation of DISCAN on top of BLADYG framework, and experimentally show the efficiency of DISCAN in both large and dynamic networks.
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-02190913
Contributor : Wissem Inoubli <>
Submitted on : Wednesday, June 10, 2020 - 1:02:06 PM
Last modification on : Thursday, June 11, 2020 - 12:52:35 PM

File

Inoubli-et-all-DMKD.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02190913, version 3

Citation

Wissem Inoubli, Sabeur Aridhi, Haithem Mezni, Mondher Maddouri, Engelbert Mephu Nguifo. A Distributed and Incremental Algorithm for Large-Scale Graph Clustering. 2020. ⟨hal-02190913v3⟩

Share

Metrics

Record views

50

Files downloads

180