Exact model averaging with naive Bayesian classifiers
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Compression-Based Averaging of Selective Naive Bayes Classifiers
The Journal of Machine Learning Research
Learning Reliable Classifiers From Small or Incomplete Data Sets: The Naive Credal Classifier 2
The Journal of Machine Learning Research
Evaluating credal classifiers by utility-discounted predictive accuracy
International Journal of Approximate Reasoning
Credal ensembles of classifiers
Computational Statistics & Data Analysis
Hi-index | 0.00 |
We deal with the arbitrariness in the choice of the prior over the models in Bayesian model averaging(BMA), by modelling prior knowledge by a set of priors (i.e., a prior credal set). We consider Dash and Cooper's BMA applied to naive Bayesian networks, replacing the single prior over the naive models by a credal set; this models a condition close to prior ignorance about the models, which leads to credal model averaging(CMA). CMA returns an indeterminateclassification, i.e., multiple classes, on the instances for which the learning set is not informative enough to smooth the effect of the choice of the prior. We give an algorithm to compute exact credal model averaging for naive networks. Extensive experiments show that indeterminate classifications preserve the reliability of CMA on the instances which are classified in a prior-dependent way by BMA.