A Distributed and Incremental Algorithm for Large-Scale Graph Clustering - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

A Distributed and Incremental Algorithm for Large-Scale Graph Clustering

(1, 2) , (2) , (3) , (4) , (5)
1
2
3
4
5

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.
Fichier principal
Vignette du fichier
Inoubli-et-all-DMKD.pdf (677.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02190913 , version 1 (23-07-2019)
hal-02190913 , version 2 (18-08-2019)
hal-02190913 , version 3 (10-06-2020)

Identifiers

  • HAL Id : hal-02190913 , version 3

Cite

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

Share

Gmail Facebook Twitter LinkedIn More