Algorithms for Learning Augmented Bayesian Classifiers (1999)
| Venue: | Proceedings of Seventh International Workshop on AI and Statistics |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Keogh99algorithmsfor,
author = {Eamonn J. Keogh and Michael J. Pazzani},
title = {Algorithms for Learning Augmented Bayesian Classifiers},
booktitle = {Proceedings of Seventh International Workshop on AI and Statistics},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. The nave Bayes classifier is built on the assumption of conditional independence between the attributes given the class. The algorithm has been shown to be surprisingly robust to obvious violations of this condition, but it is natural to ask if it is possible to further improve the accuracy by relaxing this assumption. We examine an approach where nave Bayes is augmented by the addition of correlation arcs between attributes. We explore two methods for finding the set of augmenting arcs, a greedy hill-climbing search, and a novel, more computationally efficient algorithm that we call SuperParent. We compare these methods to TAN; a state-of the-art distribution-based approach to finding the augmenting arcs. 1.0 Introduction The Bayesian classifier (Duda & Hart, 1973) is a simple classification method, which classifies an instance j by determining the probability of it belonging to class C . These probabilities are calculated as: ) & & ( 1 1 j N N i V A V A C P = = v , (1) ...
