Optimal algorithms for complete linkage clustering in d dimensions
DOI10.1016/S0304-3975(01)00239-0zbMATH Open1016.68084OpenAlexW2091146986MaRDI QIDQ1608896FDOQ1608896
Authors: Drago Krznaric, Christos Levcopoulos 
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
Recommendations
hierarchical clusteringapproximation algorithmsoptimal algorithmsmultidimensionalcomplete linkage clustering
Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient algorithms for agglomerative hierarchical clustering methods
- Title not available (Why is that?)
- An efficient algorithm for a complete link method
- Fast algorithms for complete linkage clustering
Cited In (11)
- Improved analysis of complete-linkage clustering
- Improved analysis of complete-linkage clustering
- Monotone linkage clustering and quasi-concave set functions
- Approximate distance oracles for graphs with dense clusters
- Fast algorithms for complete linkage clustering
- Perturbation theory for Hermitian quadratic eigenvalue problem -- damped and simultaneously diagonalizable systems
- Analysis of agglomerative clustering
- A note on an upper and a lower bound on sines between eigenspaces for regular Hermitian matrix pairs
- Dynamical linked cluster expansions: algorithmic aspects and applications
- Approximate single linkage cluster analysis of large data sets in high-dimensional spaces
- The Complete Gradient Clustering Algorithm: properties in practical applications
This page was built for publication: Optimal algorithms for complete linkage clustering in \(d\) dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608896)
