Over-optimistic evaluation and reporting of novel cluster algorithms: an illustrative study

DOI10.1007/s11634-022-00496-5OpenAlexW4220855543MaRDI QIDQ6106161

Maximilian Hünemörder, Thomas Seidl, Anne-Laure Boulesteix, Theresa Ullmann, Anna Beer

Publication date: 27 June 2023

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-022-00496-5

zbMATH Keywords

clusteringevaluationcluster analysisover-optimism

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms (68W40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On similarity indices and correction for chance agreement
• An empirical comparison and characterisation of nine popular clustering methods
• On the necessity and design of studies comparing statistical methods
• Finding the Number of Normal Groups in Model-Based Clustering via Constrained Likelihoods
• The estimation of the gradient of a density function, with applications in pattern recognition
• Least squares quantization in PCM
• 10.1162/153244303321897735

This page was built for publication: Over-optimistic evaluation and reporting of novel cluster algorithms: an illustrative study