Naive Bayesian Classifier Committees

Abstract

The naive Bayesian classifier provides a very simple yet surprisingly accurate technique for machine [email protected] Some researchers have examined extensions to the naive Bayesian classifier that seek to further improve the accuracy. For example, a naive Bayesian tree approach generates a decision tree with one naive Bayesian classifier at each leaf. Another example is a constructive Bayesian classifier that eliminates attributes and constructs new attributes using Cartesian products of existing attributes. This paper proposes a simple, but effective approach for the same purpose. It generates a naive Bayesian classifier committee for a given classification task. Each member of the committee is a naive Bayesian classifier based on a subset of all the attributes available for the task. During the classification stage, the committee members vote to predict classes. Experiments across a wide variety of natural domains show that this method significantly increases the prediction accuracy of the naive Bayesian classifier on average. It performs better than the two approaches mentioned above in terms of higher prediction accuracy.

Cite

Text

Zheng. "Naive Bayesian Classifier Committees." European Conference on Machine Learning, 1998. doi:10.1007/BFB0026690

Markdown

[Zheng. "Naive Bayesian Classifier Committees." European Conference on Machine Learning, 1998.](https://mlanthology.org/ecmlpkdd/1998/zheng1998ecml-naive/) doi:10.1007/BFB0026690

BibTeX

@inproceedings{zheng1998ecml-naive,
  title     = {{Naive Bayesian Classifier Committees}},
  author    = {Zheng, Zijian},
  booktitle = {European Conference on Machine Learning},
  year      = {1998},
  pages     = {196-207},
  doi       = {10.1007/BFB0026690},
  url       = {https://mlanthology.org/ecmlpkdd/1998/zheng1998ecml-naive/}
}