Fast algorithms for complete linkage clustering

DOI10.1007/PL00009332zbMath0892.68103OpenAlexW2056790812MaRDI QIDQ1380795

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)

Related Items (2)

An advancement in clustering via nonparametric density estimation ⋮ Optimal algorithms for complete linkage clustering in \(d\) dimensions

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