A Dynamic Programming Algorithm for Cluster Analysis

This paper considers the problem of partitioning N entities into M disjoint and nonempty subsets (clusters). Except when both N and N − M are very small, a search for the optimal solution by total enumeration of all clustering alternatives is quite impractical. The paper presents a dynamic programmi... View More