An Evaluation of Classification Algorithms Using Mc Nemar's Test
暂无分享,去创建一个
[1] M. Friedman. A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings , 1940 .
[2] Eibe Frank,et al. Evaluating the Replicability of Significance Tests for Comparing Learning Algorithms , 2004, PAKDD.
[3] Thomas G. Dietterich. Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms , 1998, Neural Computation.
[4] Q. Mcnemar. Note on the sampling error of the difference between correlated proportions or percentages , 1947, Psychometrika.
[5] อนิรุธ สืบสิงห์,et al. Data Mining Practical Machine Learning Tools and Techniques , 2014 .
[6] Ian H. Witten,et al. The WEKA data mining software: an update , 2009, SKDD.
[7] Nir Friedman,et al. Bayesian Network Classifiers , 1997, Machine Learning.
[8] D A Berry,et al. Logarithmic transformations in ANOVA. , 1987, Biometrics.
[9] Janez Demsar,et al. Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..
[10] D. Kibler,et al. Instance-based learning algorithms , 2004, Machine Learning.
[11] M. Friedman. The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance , 1937 .
[12] D. Liddell. Practical Tests of 2Times2 Contingency Tables , 1976 .
[13] Vipin Kumar,et al. Introduction to Data Mining , 2022, Data Mining and Machine Learning Applications.