Analysis of agglomerative clustering

DOI10.1007/S00453-012-9717-4MaRDI QIDQ472480zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Analysis of agglomerative clustering
• Geometric algorithms for agglomerative hierarchical clustering
• Improved analysis of complete-linkage clustering
• Improved analysis of complete-linkage clustering
• Fast algorithms for complete linkage clustering

Cites work

• scientific article; zbMATH DE number 705150 (Why is no real title available?)
• scientific article; zbMATH DE number 1559578 (Why is no real title available?)
• scientific article; zbMATH DE number 3448387 (Why is no real title available?)
• Approximate clustering via core-sets
• Clustering to minimize the maximum intercluster distance
• Covering a set with homothets of a convex body
• Extensions of Lipschitz mappings into a Hilbert space
• Performance guarantees for hierarchical clustering
• Sur la liaison et la division des points d'un ensemble fini

Cited in

(14)

• Frequency based analysis of collective aggregation rules
• Improved analysis of complete-linkage clustering
• Improved analysis of complete-linkage clustering
• Adaptive spatiotemporal dimension reduction in concurrent multiscale damage analysis
• A Clustering Analysis for Target Group Identification by Locality in Motor Insurance Industry
• A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
• Agglomerative clustering of growing squares
• scientific article; zbMATH DE number 7559112 (Why is no real title available?)
• Hierarchy cost of hierarchical clusterings
• Analysis of agglomerative clustering
• Agglomerative clustering of growing squares
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
• scientific article; zbMATH DE number 7168254 (Why is no real title available?)
• Analysis of Ward's method

This page was built for publication: Analysis of agglomerative clustering

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