@conference {IIIA-2005-992,
title = {Robust Bayesian Linear Classifier Ensembles},
booktitle = {Lecture Notes in Computer Science},
volume = {3720},
year = {2005},
pages = {72 - 83},
publisher = {Springer-Verlag},
organization = {Springer-Verlag},
abstract = {Ensemble classifiers combine the classification results of several classifiers. Simple ensemble methods such as uniform averaging over a set of models usually provide an improvement over selecting the single best model. Usually probabilistic classifiers restrict the set of possible models that can be learnt in order to lower computational complexity costs. In these restricted spaces, where incorrect modeling assumptions are possibly made, uniform averaging sometimes performs even better than bayesian model averaging. Linear mixtures over sets of models provide an space that includes uniform averaging as a particular case. We develop two algorithms for learning maximum a posteriori weights for linear mixtures, based on expectation maximization and on constrained optimizition. We provide a nontrivial example of the utility of these two algorithms by applying them for one dependence estimators. We develop the conjugate distribution for one dependence estimators and empirically show that uniform averaging is clearly superior to Bayesian model averaging for this family of models. After that we empirically show that the maximum a posteriori linear mixture weights improve accuracy significantly over uniform aggregation},
author = {Jes{\'u}s Cerquides and Ramon L{\'o}pez de M{\'a}ntaras},
editor = {Gama, Jo{\~a}o and Camacho, Rui and Brazdil, Pavel B. and Jorge, Al{\'\i}pio M. and Torgo, Lu{\'\i}s}
}