Bayesian comparison of machine learning algorithms on single and multiple datasets

Journal of Machine Learning Research

Volumn 22, Issue , 2012, Pages 665-675

  Lacoste, Alexandre ^a   Laviolette, François ^a   Marchand, Mario ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); LEARNING SYSTEMS; STATISTICAL TESTS; TESTING;

ALGORITHM COMPARISON; FORMAL DEFINITION; MULTIPLE DATA SETS; MULTIPLE TASKS; NON-PARAMETRIC TEST; STATE OF THE ART; TESTING DATA; WILCOXON SIGNED RANK TEST;

LEARNING ALGORITHMS;

EID: 84919912244     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (22)

1. E. Alpaydin. Combined 5 × 2 cv F Test for Comparing Supervised Classification Learning Algorithms.
2. M. Abramowitz and I.A. Stegun. Handbook of mathematical functions with formulas, graphs, and mathematical tables. Dover publications, 1964.
3. Y. Bengio and Y. Grandvalet. No unbiased estimator of the variance of k-fold crossvalidation. The Journal of Machine Learning Research, 5: 1089-1105, 2004.
4. Y. Bengio and Y. Grandvalet. Bias in estimating the variance of k-fold crossvalidation. Statistical modeling and analysis for complex data problems, pages 75-95, 2005.
5. Y. Benjamini and Y. Hochberg. Controlling the false discovery rate: a practical and powerful approach to multiple testing. Journal of the Royal Statistical Society. Series B (Methodological), pages 289-300, 1995.
6. X.H. Chen, A.P. Dempster, and J.S. Liu. Weighted finite population sampling to maximize entropy. Biometrika, 81 (3): 457, 1994.
7. S.X. Chen and J.S. Liu. Statistical Applications of the Poisson-Binomial and conditional Bernoulli distributions. Statistica Sinica, 7: 875-892, 1997.
8. C. Cortes and V. Vapnik. Support-vector networks. Machine learning, 20 (3): 273-297, 1995.
9. J. Demšar. Statistical comparisons of classifiers over multiple data sets. The Journal of Machine Learning Research, 7: 1-30, 2006.
10. T.G. Dietterich. Approximate statistical tests for comparing supervised classification learning algorithms. Neural computation, 10 (7): 1895-1923, 1998.
11. M. Friedman. The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association, 32 (200): 675-701, 1937.
12. Y. Freund and R. Schapire. A desiciontheoretic generalization of on-line learning and an application to boosting. In Computational learning theory, pages 23-37. Springer, 1995.
13. M. Fernandez and S. Williams. Closed-Form Expression for the Poisson-Binomial Probability Density Function. Aerospace and Electronic Systems, IEEE Transactions on, 46 (2): 803-817, 2010.
14. Y. Hochberg and A.C. Tamhane. Multiple comparison procedures, volume 82. Wiley Online Library, 1987.
15. E.T. Jaynes. Information theory and statistical mechanics. II. Physical review, 108 (2): 171, 1957.
16. J. Langford. Tutorial on practical prediction theory for classification. Journal of Machine Learning Research, 6 (1): 273, 2006.
17. W. Mendenhall. Nonparametric statistics. Introduction to Probability and Statistics, 604, 1983.
18. M. Minsky and S. Papert. Perceptrons. MIT Press, Cambridge, MA, 1969.
19. E. Parzen. On estimation of a probability density function and mode. The annals of mathematical statistics, 33 (3): 1065-1076, 1962.
20. M. Rosenblatt. Remarks on some nonparametric estimates of a density function. The Annals of Mathematical Statistics, 27 (3): 832-837, 1956.
21. YH Wang. On the number of successes in independent trials. Statistica Sinica, 3 (2): 295-312, 1993.
22. F. Wilcoxon. Individual comparisons by ranking methods. Biometrics Bulletin, 1 (6): 80-83, 1945.