Improved analysis of complete-linkage clustering

DOI10.1007/978-3-662-48350-3_55MaRDI QIDQ3452828zbMATH OpenOpenAlexFDO

Authors Anna Großwendt, Heiko Röglin

Publication date 19 November 2015

Published in Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48350-3_55

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Improved analysis of complete-linkage clustering
• Analysis of agglomerative clustering
• Analysis of agglomerative clustering
• Optimal algorithms for complete linkage clustering in d dimensions
• Clustering to minimize the sum of cluster diameters

Cites work

• An efficient algorithm for a complete link method
• Analysis of agglomerative clustering
• Performance guarantees for hierarchical clustering

Cited in

(7)

• Approximate single linkage cluster analysis of large data sets in high-dimensional spaces
• Fast algorithms for complete linkage clustering
• Optimal algorithms for complete linkage clustering in d dimensions
• Improved analysis of complete-linkage clustering
• Analysis of agglomerative clustering
• Analysis of agglomerative clustering
• Analysis of Ward's method

This page was built for publication: Improved analysis of complete-linkage clustering

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