The complete linkage clustering algorithm revisited

A new algorithm for generating a symmetric min-transitive opening of a similarity relation is proposed. Since min-transitive similarity relations are in one-to-one correspondence to hierarchical partition trees, our algorithm can be compared to certain classical clustering algorithms. The new algorithm is efficient and the generated opening is in practical situations usually closer to the original relation than are the openings generated by other algorithms. Various tests illustrate the obtained results.