Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances.
Martin GruberGünther R. RaidlPublished in: GECCO (2009)
Keyphrases
- hierarchical clustering
- minimum spanning trees
- clustering method
- clustering algorithm
- hierarchical clustering algorithm
- spanning tree
- data sets
- feature extraction
- k means
- euclidean distance
- hierarchical clustering methods
- similarity measure
- minimum spanning tree
- partitional clustering
- hierarchical clustering algorithms