Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach

Details Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach

2010-09-07

arxiv.org/abs/1009.1318v1

Neurocomputing, 73(7--9):1142--1163, March 2010

Statistics

Machine Learning

Scientific paper

10.1016/j.neucom.2009.11.023

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 clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topographic graph clustering provides an alternative to more classical solutions in which a standard graph clustering method is applied to build a simpler graph that is then represented with a graph layout algorithm. A comparative study on four real world graphs ranging from 34 to 1 133 vertices shows the interest of the proposed approach with respect to classical solutions and to self-organizing maps for graphs.

Affiliated with

Also associated with

No associations

Rating

Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704837