Candidate elimination criteria for lazy Bayesian rules

11Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Lazy Bayesian Rules modifies naive Bayesian classification to undo elements of the harmful attribute independence assumption. It has been shown to provide classification error comparable to boosting decision trees. This paper explores alternatives to the candidate elimination criterion employed within Lazy Bayesian Rules. Improvements over naive Bayes are consistent so long as the candidate elimination criteria ensures there is sufficient data for accurate probability estimation. However, the original candidate elimination criterion is demonstrated to provide better overall error reduction than the use of a minimum data subset size criterion.

Author supplied keywords

Cite

CITATION STYLE

APA

Webb, G. I. (2001). Candidate elimination criteria for lazy Bayesian rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2256, pp. 545–556). Springer Verlag. https://doi.org/10.1007/3-540-45656-2_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free