Fast algorithms for complete linkage clustering

DOI10.1007/PL00009332MaRDI QIDQ1380795zbMATH OpenOpenAlexFDO

Authors Drago Krznaric, Christos Levcopoulos

Publication date 11 March 1998

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00009332

zbMATH Keywords

complete linkage clustering

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Optimal algorithms for complete linkage clustering in d dimensions
• Improved analysis of complete-linkage clustering
• Improved analysis of complete-linkage clustering
• Fast Clustering Algorithms
• Approximate single linkage cluster analysis of large data sets in high-dimensional spaces
• scientific article; zbMATH DE number 1303605
• Fast hierarchical clustering and other applications of dynamic closest pairs

Cited in

(8)

• Approximate single linkage cluster analysis of large data sets in high-dimensional spaces
• Optimal algorithms for complete linkage clustering in d dimensions
• A novel specialized single-linkage clustering algorithm for taxonomically ordered data
• Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time
• Analysis of agglomerative clustering
• scientific article; zbMATH DE number 850165 (Why is no real title available?)
• scientific article; zbMATH DE number 907945 (Why is no real title available?)
• An advancement in clustering via nonparametric density estimation

This page was built for publication: Fast algorithms for complete linkage clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380795)