Ensemble methods with Random Oracles have been proposed recently (Kuncheva and Rodriguez, 2007). A random-oracle classifier consists of a pair of classifiers and a fixed, randomly created oracle that selects between them. Ensembles of random-oracle decision trees were shown to fare better than standard ensembles. In that study, the oracle for a given tree was a random hyperplane at the root of the tree. The present work considers two random oracles types (linear and spherical) in ensembles of Naive Bayes Classifiers (NB). Our experiments show that ensembles based solely upon the spherical oracle (and no other ensemble heuristic) outrank Bagging, Wagging, Random Subspaces, AdaBoost.M1, MultiBoost and Decorate. Moreover, all these ensemble methods are better with any of the two random oracles than their standard versions without the oracles. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Rodríguez, J. J., & Kuncheva, L. I. (2007). Naïve bayes ensembles with a random oracle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4472 LNCS, pp. 450–458). Springer Verlag. https://doi.org/10.1007/978-3-540-72523-7_45
Mendeley helps you to discover research relevant for your work.