Global Solution of the Clustering Problem via Graph Theoretical Approach

In this article we consider clustering problems which we model as a non-convex continuous minimization problem with the maximum norm representing the distance measure. We then reformulate this continuous problem in light of graph theoretical instances which enables us to construct a bisection algorithm converging to the globally minimal value of the original clustering problem … Read more