Optimal algorithms for complete linkage clustering in \(d\) dimensions
From MaRDI portal
Publication:1608896
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
hierarchical clusteringapproximation algorithmsoptimal algorithmsmultidimensionalcomplete linkage clustering
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