On the Use of m-Probability-Estimation and Imprecise Probabilities in the Naïve Bayes Classifier
暂无分享,去创建一个
[1] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[2] M. Friedman. A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings , 1940 .
[3] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[4] Nir Friedman,et al. Bayesian Network Classifiers , 1997, Machine Learning.
[5] Joaquín Abellán,et al. Uncertainty measures on probability intervals from the imprecise Dirichlet model , 2006, Int. J. Gen. Syst..
[6] S. Holm. A Simple Sequentially Rejective Multiple Test Procedure , 1979 .
[7] Pedro M. Domingos,et al. On the Optimality of the Simple Bayesian Classifier under Zero-One Loss , 1997, Machine Learning.
[8] Janez Demsar,et al. Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..
[9] Francisco Herrera,et al. Evaluating the classifier behavior with noisy data considering performance and robustness: The Equalized Loss of Accuracy measure , 2016, Neurocomputing.
[10] P. Walley. Inferences from Multinomial Data: Learning About a Bag of Marbles , 1996 .
[11] HerreraFrancisco,et al. Evaluating the classifier behavior with noisy data considering performance and robustness , 2016 .