Learning an Optimal Naive Bayes Classifier
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742 · cited 1×
“One is to transform the structure of the classifier to a Bayesian network, by introducing directed arcs between the dependent attributes [3].”
Research works printed but not linked: 8
- cheng, 1999, Comparing bayesian network classifiers, Proceedings of the Fifteenth Conference on Uncertainty in Arifi cial intelligence, 101
- yang, 2002, A comparative study of discretization methods for naive-bayes classifiers, Proc Pacific Rim Knowl Acquisition Workshop
- 10.1109/ENC.2005.14 · DOI
- pazzani, 1996, Searching for atribute dependencies in bayesian classifiers, In preliminary Papers of the Intelligence and Statistics, 424
- pazzani, 1995, An iterative improvement approach for the discretization of numeric attributes in bayesian classifiers, KDD95, 228
- 10.1111/j.1467-8640.1994.tb00166.x · DOI · Paper page
- friedman, 1996, Discretizing continuous attributes while learning bayesian networks, International Conference on Machine Learning (ICML), 157
- 10.1109/CEC.2003.1299913 · doi:10.1109/cec.2003.1299913
Cited by
Predicting Anxiety, Depression and Stress in Modern Life using Machine Learning Algorithms
Priya, A., Garg, S., & Tigga, N. P. (2020) · Procedia Computer Science · doi:10.1016/j.procs.2020.03.442 · Cited by 458
Internet of Things: Evolution, Concerns and Security Challenges
Malhotra, P., Singh, Y., Anand, P., Bangotra, D. K., Singh, P. K., & Hong, W.-C. (2021) · Sensors · doi:10.3390/s21051809 · Cited by 260
Innovative Materials Science via Machine Learning
Gao, C., Min, X., Fang, M., Tao, T., Zheng, X., Liu, Y., Wu, X., & Huang, Z. (2022) · Advanced Functional Materials · doi:10.1002/adfm.202108044 · Cited by 198
Machine Learning for Perovskite Solar Cells and Component Materials: Key Technologies and Prospects
Liu, Y., Tan, X., Liang, J., Han, H., Xiang, P., & Yan, W. (2023) · Advanced Functional Materials · doi:10.1002/adfm.202214271 · Cited by 174
Kebede, M. M., Le Cornet, C., & Fortner, R. T. (2023) · Research Synthesis Methods · doi:10.1002/jrsm.1589 · Cited by 50
Metadata
- Authors
- Martinez-Arroyo, M., & Sucar, L. E.
- Venue
- 18th International Conference on Pattern Recognition (ICPR'06)
- Publisher
- IEEE
- Published
- 2006
- Pages
- 1236-1239
- ISSN
- 1041-3278 (ISSN-L)
- OpenAlex
- W3140817226
- Cited by
- 48
- References
- 1
- FWCI
- 0.24
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.