After a brief review of the main clustering algorithms, a new algorithm for optimal clustering is presented and proved. If k is given as the number of clusters to obtain, the algorithm gives the optimal clustering into one, two, …, k clusters. An example of its use is provided.
AKOKA, J. et COMYN-WATTIAU, I. (1991). A New Algorithm for Optimal Generation of Clusters. ESSEC Business School.