Abstract
Data mining applications require learning algorithms to have high predictive accuracy, scale up to large datasets, and produce comprehensible outcomes. Naive Bayes classifier has received extensive attention due to its efficiency, reasonable predictive accuracy, and simplicity. However, the assumption of attribute dependency given class of Naive Bayes is often violated, producing incorrect probability that can affect the success of data mining applications. We extend Naive Bayes classifier to allow certain dependency relations among attributes. Comparing to previous extensions of Naive Bayes, our algorithm is more efficient (more so in problems with a large number of attributes), and produces simpler dependency relation for better comprehensibility, while maintaining very similar predictive accuracy.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Friedman, N.: Bayesian network classifier. Machine Learning, 29 (1997) 131–161.
Holte, R.: Very simple classification rules perform well on most commonly used datasets. Machine Learning, 3 (1993), 63–91.
Keogh and Pazzani, E., Pazzani, M.: Learning augmented bayesian classifiers. Proceedings of Seventh International Workshop on AI and Statistics. (1999) Ft. Lauderdale.
Merz, C.: Uci repository of machine learning databases. Dept. of Information and Computer Science, University of California, (1997) Irvine.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., Ling, C.X. (2001). An Improved Learning Algorithm for Augmented Naive Bayes. In: Cheung, D., Williams, G.J., Li, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2001. Lecture Notes in Computer Science(), vol 2035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45357-1_62
Download citation
DOI: https://doi.org/10.1007/3-540-45357-1_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41910-5
Online ISBN: 978-3-540-45357-4
eBook Packages: Springer Book Archive