Topologically Ordered Graph Clustering via Deterministic Annealing - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Topologically Ordered Graph Clustering via Deterministic Annealing

Abstract

This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph partitions that lead to faithful and readable graph representations on a 2 dimensional SOM like planar grid.
Fichier principal
Vignette du fichier
som-like-graph.pdf (109.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00666602 , version 1 (05-02-2012)

Identifiers

  • HAL Id : hal-00666602 , version 1

Cite

Fabrice Rossi, Nathalie Villa-Vialaneix. Topologically Ordered Graph Clustering via Deterministic Annealing. European Symposium on Artificial Neural Networks, Apr 2009, Bruges, Belgium. pp.529-534. ⟨hal-00666602⟩
124 View
141 Download

Share

Gmail Facebook Twitter LinkedIn More