Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00666602
Contributor : Nathalie Vialaneix <>
Submitted on : Sunday, February 5, 2012 - 7:20:42 PM
Last modification on : Friday, July 31, 2020 - 10:44:07 AM
Long-term archiving on: : Sunday, May 6, 2012 - 2:21:52 AM

Files

som-like-graph.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00666602, version 1

Citation

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⟩

Share

Metrics

Record views

286

Files downloads

209