public class HierarchicalKMeansExample
extends Object
Example showing how to use the Hierarchical KMeans clustering algorithm with
in-memory data. The example sets up the clustering algorithm, generates some
uniform random data to cluster, and runs the clustering algorithm. The
resultant clusters are printed, and the example also shows how to perform
cluster assignment (i.e. vector quantisation) in which vectors are assigned
to their closest cluster.
- Author:
- Jonathon Hare (jsh2@ecs.soton.ac.uk)