greedy-clustering

This is code implementing an extremely simple greedy clustering algorthm. It will work on arbitrary metric spaces. Used in various work of mine in the following cases:

Large datasets where a suboptimal clustering is acceptable, and techniques like k-means that are typically included in statistics packages are too slow.
Baseline against which to perform sanity checks on other clustering codes.
Initialization of iterative clustering algorithms.

Includes a Matlab interface (only for Euclidean distance).

Distributed under the MIT License.