Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Lecture Notes in Computer ScienceEvaluating the Replicability of Significance Tests for Comparing Learning Algorithms

Lecture Notes in Computer Science: Evaluating the Replicability of Significance Tests for... http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Neural Information Processing Unpaywall

Lecture Notes in Computer ScienceEvaluating the Replicability of Significance Tests for Comparing Learning Algorithms

Bouckaert, Remco R.; Frank, Eibe
Unpaywall — Jan 1, 2004
Download PDF

Lecture Notes in Computer ScienceEvaluating the Replicability of Significance Tests for Comparing Learning Algorithms

Bouckaert, Remco R.; Frank, Eibe
Unpaywall — Jan 1, 2004

Loading next page...
 
/lp/unpaywall/lecture-notes-in-computer-science-evaluating-the-replicability-of-0YCSkEpLRy

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

DOI
10.1007/978-3-540-24775-3_3
Publisher site
See Chapter on Publisher Site

Abstract

Published: Jan 1, 2004

There are no references for this article.