By Topic

Cluster validity indices for graph partitioning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
F. Boutin ; Univ. Montpellier II, France ; M. Hascoet

The aim of graph clustering is to define compact and well-separated clusters from a given graph. Cluster's compactness depends on datasets and clustering methods. In order to provide evaluation of graph clustering quality, many different indices have been proposed in previous work. Indices are used to compare different graph partitions but also different clustering techniques. Moreover, some clustering techniques are based on index optimization. Indices can also be added as visual tips in graph layouts. Despite the importance of the subject, little has been done to unify the field. It results that many indices can not be easily compared or interpreted. In this paper, we provide a unified and synthetic view of indices used in graph clustering area and discuss them. We also propose several enhanced measures.

Published in:

Information Visualisation, 2004. IV 2004. Proceedings. Eighth International Conference on

Date of Conference:

14-16 July 2004