A clustering algorithm based on graph connectivity
We have developed a novel algorithm for cluster analysis that is based on graph theoretic techniques. A similarity graph is defined and clusters in that graph correspond to highly connected subgraphs. A polynomial algorithm to compute them efficiently is presented. Our algorithm produces a solution with some provably good properties and performs well on simulated and real data. (C) 2000 Elsevier Science B.V. All rights reserved.
clustering algorithms graph connectivity minimum cut diameter