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.
Origin : Files produced by the author(s)
Loading...