Optimal algorithms for complete linkage clustering in \(d\) dimensions

DOI10.1016/S0304-3975(01)00239-0zbMath1016.68084OpenAlexW2091146986MaRDI QIDQ1608896

Christos Levcopoulos, Drago Krznaric

Publication date: 13 August 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00239-0

zbMATH Keywords

hierarchical clusteringapproximation algorithmsoptimal algorithmsmultidimensionalcomplete linkage clustering

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)

Related Items

Approximate distance oracles for graphs with dense clusters ⋮ A note on an upper and a lower bound on sines between eigenspaces for regular Hermitian matrix pairs ⋮ Perturbation theory for Hermitian quadratic eigenvalue problem -- damped and simultaneously diagonalizable systems

Cites Work

• Efficient algorithms for agglomerative hierarchical clustering methods
• Fast algorithms for complete linkage clustering
• An efficient algorithm for a complete link method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item