• DOI:10.1007/s10115-016-1004-2
Corpus ID: 40772241

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

@article{Kriegel2016TheA,
  title={The (black) art of runtime evaluation: Are we comparing algorithms or implementations?},
  author={H. Kriegel and Erich Schubert and A. Zimek},
  journal={Knowledge and Information Systems},
  year={2016},
  volume={52},
  pages={341-378}
}

H. Kriegel, Erich Schubert, A. Zimek

Published 2016

Computer Science

Knowledge and Information Systems

Any paper proposing a new algorithm should come with an evaluation of efficiency and scalability (particularly when we are designing methods for “big data”). However, there are several (more or less serious) pitfalls in such evaluations. We would like to point the attention of the community to these pitfalls. We substantiate our points with extensive experiments, using clustering and outlier detection methods with and without index acceleration. We discuss what we can learn from evaluations… CONTINUE READING

View on Springer

www-ai.cs.tu-dortmund.de

Save to Library

Create Alert

Cite

Launch Research Feed