A Genetic Approach to Hierarchical Clustering of Euclidean Graphs

Authors:
Affiliations:
Venue:
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 2 - Volume 2
Year:
1998

Citing 6
Cited 0

Algorithms for clustering data

Algorithms for clustering data
A non-greedy approach to tree-structured clustering

Pattern Recognition Letters
Topological clustering of maps using a genetic algorithm

Pattern Recognition Letters
Dynamic Clustering of Maps in Autonomous Agents

IEEE Transactions on Pattern Analysis and Machine Intelligence
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms
Iterative optimization and simplification of hierarchical clusterings

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to graph clustering. Given a connected graph whose vertices correspond to points within a Euclidean space and a fitness junction, 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 subject to optimization.