loading...
Learning an Optimal Naive Bayes Classifier
Hong Kong August 20-August 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2006.74918th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Miriam Martinez-Arroyo, Instituto Tecnologico de Acapulco, Mexico
L. Enrique Sucar, INAOE Tonantzintla, Puebla, Mexico
The naive Bayes classifier is an efficient classification model that is easy to learn and has a high accuracy in many domains. However, it has two main drawbacks: (i) its classification accuracy decreases when the attributes are not independent, and (ii) it can not deal with nonparametric continuous attributes. In this work we propose a method that deals with both problems, and learns an optimal naive Bayes classifier. The method includes two phases, discretization and structural improvement, which are repeated alternately until the classification accuracy can not be improved. Discretization is based on the minimum description length principle. To deal with dependent and irrelevant attributes, we apply a structural improvement method that eliminates and/or joins attributes, based on mutual and conditional information measures. The method has been tested in two different domains with good results.
Citation:
Miriam Martinez-Arroyo, L. Enrique Sucar, "Learning an Optimal Naive Bayes Classifier," icpr, vol. 4, pp.958, 18th International Conference on Pattern Recognition (ICPR'06) Volume 4, 2006
Usage of this product signifies your acceptance of the Terms of Use.