The (black) art of runtime evaluation: Are we comparing algorithms or implementations?

2016/10/22 by Hans-Peter Kriegel, Hans‐Peter Kriegel, Erich Schubert +1 · 2 citations
Computer Science · #Anomaly Detection Techniques and Applications #Machine Learning and Data Classification #Time Series Analysis and Forecasting

paper · doi:10.1007/s10115-016-1004-2

crossref issued 2016/10/22 · crossref published 2016/10/22 · crossref published-online 2016/10/22 · openalex publication_date 2016/10/22 · crossref created 2016/10/22 · crossref published-print 2017/08/01 · crossref deposited 2019/09/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01 · crossref indexed 2026/08/04

Citations

• Modern hierarchical, agglomerative clustering algorithms
• Shortest Connection Networks And Some Generalizations
• A Survey of Algorithms for Contiguity-constrained Clustering and Related Problems
• The Lack of A Priori Distinctions Between Learning Algorithms
• SLINK: An optimally efficient algorithm for the single-link cluster method
• LOF
• Least squares quantization in PCM
• An efficient k-means clustering algorithm: analysis and implementation
• Multidimensional binary search trees used for associative searching
• Julia: A Fresh Approach to Numerical Computing

Cited by

• Numerically stable parallel computation of (co-)variance
• Algorithm [wikipedia]