tlooto
Sign up
Computer ScienceMathematics

Efficient algorithms for agglomerative hierarchical clustering methods

W. H. Day, H. Edelsbrunner

1984.12.1JOURNAL OF CLASSIFICATION

DOI: 10.1007/bf01890115

tlooto Summary

A centroid SAHN clustering algorithm that requires 0(n2) time, in the worst case, for fixedk and for a family of dissimilarity measures including the Manhattan, Euclidean, Chebychev and all other Minkowski metrics is described.

Abstract

Abstract is not available.

Citation format

DAY, W. H.; EDELSBRUNNER, H. Efficient algorithms for agglomerative hierarchical clustering methods. JOURNAL OF CLASSIFICATION, 1984, 1: 7–24.