Sciweavers

PRL
1998

Genetic operators for hierarchical graph clustering

13 years 4 months ago
Genetic operators for hierarchical graph clustering
In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to hierarchical graph clustering. Given a connected graph whose vertices correspond to points within a Euclidean space and a ®tness function, a hierarchy of graphs in which each vertex corresponds to a connected subgraph of the graph below is generated. Both the number of clustering levels and the number of clusters on each level are not ®xed a priori and are subject to optimization. Ó 1998 Elsevier Science B.V. All rights reserved.
Stefano Rizzi
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 1998
Where PRL
Authors Stefano Rizzi
Comments (0)