Optimal algorithms for complete linkage clustering in d dimensions

DOI10.1016/S0304-3975(01)00239-0MaRDI QIDQ1608896zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

hierarchical clusteringapproximation algorithmsoptimal algorithmsmultidimensionalcomplete linkage clustering

Mathematics Subject Classification ID

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

Recommendations

• Fast algorithms for complete linkage clustering
• Improved analysis of complete-linkage clustering
• Improved analysis of complete-linkage clustering
• Analysis of agglomerative clustering
• Automata, Languages and Programming

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3994794 (Why is no real title available?)
• scientific article; zbMATH DE number 848149 (Why is no real title available?)
• scientific article; zbMATH DE number 1424293 (Why is no real title available?)
• An efficient algorithm for a complete link method
• Efficient algorithms for agglomerative hierarchical clustering methods
• 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)