Finds K center objects from a distance matrix
[LAB,J,DM] = KCENTRES(D,K,N)
Finds K center objects from a symmetric distance matrix D. The center objects are chosen from all M objects such that the maximum of the distances over all objects to the nearest center is minimised. For K > 1, the results depend on a random initialisation. The procedure is repeated N times and the best result is returned.
If N = 0, initialisation is not random, but done by a systematic selection based on a greedy approach.
Faster and more advanced tools for cluster analysis may be found in the ClusterTools toolbox.