The Naive Bayes classifier is a simple and accurate classifier. This paper shows that assuming the Naive Bayes classifier model and applying Bayesian model averaging and the principle of indifference, an equally simple, more accurate and theoretically well founded classifier can be obtained.

Classification as a goal I Machine learning focuses on identifying classes (classification), while social science is typically interested in locating things on latent traits (scaling) I But the two methods overlap and can be adapted – will demonstrate later using the Naive Bayes classifier I

Naïve Bayes classifiers are a very simple tool for classification problems, although they are based on independence assumptions that do not hold in most cases. Extended naïve Bayes classifiers also rely on independence assumption, but break them down to artificial subclasses, in this way becoming

Naive Bayes classifiers tend to perform very well on a large number of problem domains, although their representation power is quite limited compared to more sophisticated machine learning algorithms. In this paper we study combining multiple naive Bayes classifiers by using the hierarchical

The naive Bayes classifier greatly simplify learning by assuming that features are independent given class. Although independence is generally a poor assumption, in practice naive Bayes often competes well with more sophisticated classifiers. Our broad goal is to understand the data characteristics

In this paper we discuss how machine learning, and specifically how naive Bayes classifiers, can be used for user modeling tasks. We argue that in general, machine learning techniques should be used to improve a user modeling system’s interactions with users. We further argue that a naive Bayes

regular Naive Bayes. This result holds for several aggregation techniques for combining the predictions of the individual classifiers, including the commonly used voting and weighted voting techniques. On the other hand, Naive Bayes with one-against-all binarization is not equivalent to a regular Naive

Abstract. Naïve-Bayes classifiers (NB) support incremental learning. However, the lack of effective incremental discretization methods has been hindering NB’s incremental learning in face of quantitative data. This problem is further compounded by the fact that quantitative data are everywhere

We augment naive Bayes models with statistical n-gram language models to address shortcomings of the standard naive Bayes text classifier. The result is a generalized naive Bayes classifier

, and the total cost of all feature values acquired during training must remain less than this fixed budget. This paper compares methods for sequentially choosing which feature value to purchase next, given the budget and user’s current knowledge of Naïve Bayes model parameters. Whereas active learning has