Analysis of agglomerative clustering

DOI10.1007/s00453-012-9717-4zbMath1307.68082OpenAlexW2171180835MaRDI QIDQ472480

Christian Sohler, Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze

Publication date: 19 November 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2011/2994/

zbMATH Keywords

hierarchical clusteringagglomerative clusteringapproximation guaranteescomplete linkage

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (6)

Improved Analysis of Complete-Linkage Clustering ⋮ Hierarchy cost of hierarchical clusterings ⋮ Improved analysis of complete-linkage clustering ⋮ Adaptive spatiotemporal dimension reduction in concurrent multiscale damage analysis ⋮ Unnamed Item ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering a set with homothets of a convex body
• Clustering to minimize the maximum intercluster distance
• Performance guarantees for hierarchical clustering
• Extensions of Lipschitz mappings into a Hilbert space
• Approximate clustering via core-sets
• Sur la liaison et la division des points d'un ensemble fini

This page was built for publication: Analysis of agglomerative clustering