Performance analysis of hierarchical clustering algorithms

DOI10.1007/S00357-004-0003-2MaRDI QIDQ1762826zbMATH OpenOpenAlexFDO

Authors O. Gascuel, Andy McKenzie

Publication date 11 February 2005

Published in Journal of Classification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00357-004-0003-2

zbMATH Keywords

Infinty-normTree inference algorithmUltrametric and additive conditions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20)

Recommendations

• Performance analysis for clustering algorithms
• scientific article; zbMATH DE number 894865
• scientific article; zbMATH DE number 2089373
• Performance guarantees for hierarchical clustering
• Assessing the Performance of a Graph-Based Clustering Algorithm
• Publication:4721426
• A Statistical Performance Analysis of Graph Clustering Algorithms

Cited in

(7)

• A `stochastic safety radius' for distance-based tree reconstruction
• Robustness of phylogenetic inference based on minimum evolution
• Assessing the Performance of a Graph-Based Clustering Algorithm
• The minimum evolution problem: Overview and classification
• scientific article; zbMATH DE number 6452617 (Why is no real title available?)
• UPGMA and the normalized equidistant minimum evolution problem
• A tutorial on the balanced minimum evolution problem

This page was built for publication: Performance analysis of hierarchical clustering algorithms

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