Optimal algorithms for complete linkage clustering in d dimensions
Författare
Summary, in English
It is shown that the complete linkage clustering of n points in R-d, where d greater than or equal to 1 is a constant, can be computed in optimal O(nlogn) time and linear space, under the L-1 and L-infinity-metrics. Furthermore, for every other fixed L-t-metric, it is shown that it can be approximated within an arbitrarily small constant factor in O(nlogn) time and linear space.
Avdelning/ar
- Computer Science
Publiceringsår
2002
Språk
Engelska
Sidor
139-149
Publikation/Tidskrift/Serie
Theoretical Computer Science
Volym
286
Issue
1
Dokumenttyp
Konferensbidrag
Förlag
Elsevier
Ämne
- Computer Science
Nyckelord
- multidimensional
- optimal algorithms
- complete linkage clustering
- approximation algorithms
- hierarchical clustering
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 0304-3975