A stable decomposition algorithm for dynamical social network analysis - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2010

A stable decomposition algorithm for dynamical social network analysis

Résumé

Dynamic networks raise new knowledge discovery challenges. To handle efficiently this kind of data, an analysis method has to both decompose the network (modelled by a graph) into similar set of nodes and let the user detect structural changes in the graph. In this article we present a graph decomposition algorithm generating overlapping clusters. The complexity of this algorithmis O(|E|·deg_max^2+|V| · log(|V|))). This algorithm is particularly efficient due to its ability to detect major modifications along dynamic processes such as time related ones.
Fichier principal
Vignette du fichier
author.DMKM.pdf (940.97 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00543175 , version 1 (06-12-2010)

Identifiants

Citer

Romain Bourqui, Paolo Simonetto, Fabien Jourdan. A stable decomposition algorithm for dynamical social network analysis. Fabrice Guillet; Gilbert Ritschard; Djamel Abdelkader Zighed and Henri Briand. Advances in Knowledge Discovery and Management, Springer, pp.167-178, 2010, Studies in Computational Intelligence, ⟨10.1007/978-3-642-00580-0_10⟩. ⟨hal-00543175⟩
152 Consultations
188 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More