next up previous
Next: 3.3 -MEANS Up: 3 Algorithms Implemented Previous: 3.1.3 Cheat


3.2 Random

The random clustering algorithm randomly distributes the given points into \( k\) clusters of equal size.

The representatives are set to the mean points of the clusters. The value of \( k\) must be given on the command line.

This is useful for both testing and debugging, and is also utilized by the \( k\)-MEANS algorithm in finding an initial clustering.



Kevin Pulo
2000-08-23