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 fitness 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 fixed a priori and are subject to optimization. © 1998 Elsevier Science B.V. All rights reserved.
Genetic operators for hierarchical graph clustering / Rizzi S.. - In: PATTERN RECOGNITION LETTERS. - ISSN 0167-8655. - STAMPA. - 19:14(1998), pp. 1293-1300. [10.1016/S0167-8655(98)00110-X]
Genetic operators for hierarchical graph clustering
Rizzi S.
1998
Abstract
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 fitness 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 fixed a priori and are subject to optimization. © 1998 Elsevier Science B.V. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
