Advances in Knowledge Discovery and Data Mining

Volume 3056 of the series Lecture Notes in Computer Science pp 3-12

Evaluating the Replicability of Significance Tests for Comparing Learning Algorithms

  • Remco R. BouckaertAffiliated withXtal Mountain Information TechnologyComputer Science Department, University of Waikato
  • , Eibe FrankAffiliated withComputer Science Department, University of Waikato

* Final gross prices may vary according to local VAT.

Get Access


Empirical research in learning algorithms for classification tasks generally requires the use of significance tests. The quality of a test is typically judged on Type I error (how often the test indicates a difference when it should not) and Type II error (how often it indicates no difference when it should). In this paper we argue that the replicability of a test is also of importance. We say that a test has low replicability if its outcome strongly depends on the particular random partitioning of the data that is used to perform it. We present empirical measures of replicability and use them to compare the performance of several popular tests in a realistic setting involving standard learning algorithms and benchmark datasets. Based on our results we give recommendations on which test to use.