Naive Bayes classifier
In statistics, naive Bayes classifiers are a family of linear "probabilistic classifiers" which assumes that the features are conditionally independent, given the target class. The strength (naivety) of this assumption is what gives the classifier its name. These classifiers are among the simplest Bayesian network models.^{[1]}
Naive Bayes classifiers are highly scalable, requiring a number of parameters linear in the number of variables (features/predictors) in a learning problem. Maximum-likelihood training can be done by evaluating a closed-form expression,^{[2]}^{:718} which takes linear time, rather than by expensive iterative approximation as used for many other types of classifiers.
In the statistics literature, naive Bayes models are known under a variety of names, including simple Bayes and independence Bayes.^{[3]} All these names reference the use of Bayes' theorem in the classifier's decision rule, but naive Bayes is not (necessarily) a Bayesian method.^{[2]}^{[3]}
Introduction
Naive Bayes is a simple technique for constructing classifiers: models that assign class labels to problem instances, represented as vectors of feature values, where the class labels are drawn from some finite set. There is not a single algorithm for training such classifiers, but a family of algorithms based on a common principle: all naive Bayes classifiers assume that the value of a particular feature is independent of the value of any other feature, given the class variable. For example, a fruit may be considered to be an apple if it is red, round, and about 10 cm in diameter. A naive Bayes classifier considers each of these features to contribute independently to the probability that this fruit is an apple, regardless of any possible correlations between the color, roundness, and diameter features.
In many practical applications, parameter estimation for naive Bayes models uses the method of maximum likelihood; in other words, one can work with the naive Bayes model without accepting Bayesian probability or using any Bayesian methods.
Despite their naive design and apparently oversimplified assumptions, naive Bayes classifiers have worked quite well in many complex real-world situations. In 2004, an analysis of the Bayesian classification problem showed that there are sound theoretical reasons for the apparently implausible efficacy of naive Bayes classifiers.^{[4]} Still, a comprehensive comparison with other classification algorithms in 2006 showed that Bayes classification is outperformed by other approaches, such as boosted trees or random forests.^{[5]}
An advantage of naive Bayes is that it only requires a small amount of training data to estimate the parameters necessary for classification.^{[6]}
Probabilistic model
Abstractly, naive Bayes is a conditional probability model: it assigns probabilities [math]\displaystyle{ p(C_k \mid x_1, \ldots, x_n) }[/math] for each of the K possible outcomes or classes [math]\displaystyle{ C_k }[/math] given a problem instance to be classified, represented by a vector [math]\displaystyle{ \mathbf{x} = (x_1, \ldots, x_n) }[/math] encoding some n features (independent variables).^{[7]}
The problem with the above formulation is that if the number of features n is large or if a feature can take on a large number of values, then basing such a model on probability tables is infeasible. The model must therefore be reformulated to make it more tractable. Using Bayes' theorem, the conditional probability can be decomposed as:
- [math]\displaystyle{ p(C_k \mid \mathbf{x}) = \frac{p(C_k) \ p(\mathbf{x} \mid C_k)}{p(\mathbf{x})} \, }[/math]
In plain English, using Bayesian probability terminology, the above equation can be written as
- [math]\displaystyle{ \text{posterior} = \frac{\text{prior} \times \text{likelihood}}{\text{evidence}} \, }[/math]
In practice, there is interest only in the numerator of that fraction, because the denominator does not depend on [math]\displaystyle{ C }[/math] and the values of the features [math]\displaystyle{ x_i }[/math] are given, so that the denominator is effectively constant. The numerator is equivalent to the joint probability model
- [math]\displaystyle{ p(C_k, x_1, \ldots, x_n)\, }[/math]
which can be rewritten as follows, using the chain rule for repeated applications of the definition of conditional probability:
- [math]\displaystyle{ \begin{align} p(C_k, x_1, \ldots, x_n) & = p(x_1, \ldots, x_n, C_k) \\ & = p(x_1 \mid x_2, \ldots, x_n, C_k) \ p(x_2, \ldots, x_n, C_k) \\ & = p(x_1 \mid x_2, \ldots, x_n, C_k) \ p(x_2 \mid x_3, \ldots, x_n, C_k) \ p(x_3, \ldots, x_n, C_k) \\ & = \cdots \\ & = p(x_1 \mid x_2, \ldots, x_n, C_k) \ p(x_2 \mid x_3, \ldots, x_n, C_k) \cdots p(x_{n-1} \mid x_n, C_k) \ p(x_n \mid C_k) \ p(C_k) \\ \end{align} }[/math]
Now the "naive" conditional independence assumptions come into play: assume that all features in [math]\displaystyle{ \mathbf{x} }[/math] are mutually independent, conditional on the category [math]\displaystyle{ C_k }[/math]. Under this assumption,
- [math]\displaystyle{ p(x_i \mid x_{i+1}, \ldots ,x_{n}, C_k ) = p(x_i \mid C_k)\, }[/math].
Thus, the joint model can be expressed as
- [math]\displaystyle{ \begin{align} p(C_k \mid x_1, \ldots, x_n) \varpropto\ & p(C_k, x_1, \ldots, x_n) \\ & = p(C_k) \ p(x_1 \mid C_k) \ p(x_2\mid C_k) \ p(x_3\mid C_k) \ \cdots \\ & = p(C_k) \prod_{i=1}^n p(x_i \mid C_k)\,, \end{align} }[/math]
where [math]\displaystyle{ \varpropto }[/math] denotes proportionality since the denominator [math]\displaystyle{ p(\mathbf{x}) }[/math] is omitted.
This means that under the above independence assumptions, the conditional distribution over the class variable [math]\displaystyle{ C }[/math] is:
- [math]\displaystyle{ p(C_k \mid x_1, \ldots, x_n) = \frac{1}{Z} \ p(C_k) \prod_{i=1}^n p(x_i \mid C_k) }[/math]
where the evidence [math]\displaystyle{ Z = p(\mathbf{x}) = \sum_k p(C_k) \ p(\mathbf{x} \mid C_k) }[/math] is a scaling factor dependent only on [math]\displaystyle{ x_1, \ldots, x_n }[/math], that is, a constant if the values of the feature variables are known.
Constructing a classifier from the probability model
The discussion so far has derived the independent feature model, that is, the naive Bayes probability model. The naive Bayes classifier combines this model with a decision rule. One common rule is to pick the hypothesis that is most probable so as to minimize the probability of misclassification; this is known as the maximum a posteriori' or MAP decision rule. The corresponding classifier, a Bayes classifier, is the function that assigns a class label [math]\displaystyle{ \hat{y} = C_k }[/math] for some k as follows:
- [math]\displaystyle{ \hat{y} = \underset{k \in \{1, \ldots, K\}}{\operatorname{argmax}} \ p(C_k) \displaystyle\prod_{i=1}^n p(x_i \mid C_k). }[/math]
Parameter estimation and event models
A class's prior may be calculated by assuming equiprobable classes, i.e., [math]\displaystyle{ p(C_k) = \frac{1}{K} }[/math], or by calculating an estimate for the class probability from the training set:
- [math]\displaystyle{ \text{prior for a given class} = \frac{\text{no. of samples in that class}}{\text{total no. of samples}} \, }[/math]
To estimate the parameters for a feature's distribution, one must assume a distribution or generate nonparametric models for the features from the training set.^{[8]}
The assumptions on distributions of features are called the "event model" of the naive Bayes classifier. For discrete features like the ones encountered in document classification (include spam filtering), multinomial and Bernoulli distributions are popular. These assumptions lead to two distinct models, which are often confused.^{[9]}^{[10]}
Gaussian naive Bayes
When dealing with continuous data, a typical assumption is that the continuous values associated with each class are distributed according to a normal (or Gaussian) distribution. For example, suppose the training data contains a continuous attribute, [math]\displaystyle{ x }[/math]. The data is first segmented by the class, and then the mean and variance of [math]\displaystyle{ x }[/math] is computed in each class. Let [math]\displaystyle{ \mu_k }[/math] be the mean of the values in [math]\displaystyle{ x }[/math] associated with class [math]\displaystyle{ C_k }[/math], and let [math]\displaystyle{ \sigma^2_k }[/math] be the Bessel corrected variance of the values in [math]\displaystyle{ x }[/math] associated with class [math]\displaystyle{ C_k }[/math]. Suppose one has collected some observation value [math]\displaystyle{ v }[/math]. Then, the probability density of [math]\displaystyle{ v }[/math] given a class [math]\displaystyle{ C_k }[/math], i.e., [math]\displaystyle{ p(x=v \mid C_k) }[/math], can be computed by plugging [math]\displaystyle{ v }[/math] into the equation for a normal distribution parameterized by [math]\displaystyle{ \mu_k }[/math] and [math]\displaystyle{ \sigma^2_k }[/math]. Formally,
- [math]\displaystyle{ p(x=v \mid C_k)=\frac{1}{\sqrt{2\pi\sigma^2_k}}\,e^{ -\frac{(v-\mu_k)^2}{2\sigma^2_k} } }[/math]
Another common technique for handling continuous values is to use binning to discretize the feature values and obtain a new set of Bernoulli-distributed features. Some literature suggests that this is required in order to use naive Bayes, but it is not true, as the discretization may throw away discriminative information.^{[3]}
Sometimes the distribution of class-conditional marginal densities is far from normal. In these cases, kernel density estimation can be used for a more realistic estimate of the marginal densities of each class. This method, which was introduced by John and Langley,^{[8]} can boost the accuracy of the classifier considerably.^{[11]}^{[12]}
Multinomial naive Bayes
With a multinomial event model, samples (feature vectors) represent the frequencies with which certain events have been generated by a multinomial [math]\displaystyle{ (p_1, \dots, p_n) }[/math] where [math]\displaystyle{ p_i }[/math] is the probability that event i occurs (or K such multinomials in the multiclass case). A feature vector [math]\displaystyle{ \mathbf{x} = (x_1, \dots, x_n) }[/math] is then a histogram, with [math]\displaystyle{ x_i }[/math] counting the number of times event i was observed in a particular instance. This is the event model typically used for document classification, with events representing the occurrence of a word in a single document (see bag of words assumption). The likelihood of observing a histogram x is given by:
- [math]\displaystyle{ p(\mathbf{x} \mid C_k) = \frac{(\sum_{i=1}^n x_i)!}{\prod_{i=1}^n x_i !} \prod_{i=1}^n {p_{ki}}^{x_i} }[/math] where [math]\displaystyle{ p_{ki} := p(x_i \mid C_k) }[/math].
The multinomial naive Bayes classifier becomes a linear classifier when expressed in log-space:^{[13]}
- [math]\displaystyle{ \begin{align} \log p(C_k \mid \mathbf{x}) & \varpropto \log \left( p(C_k) \prod_{i=1}^n {p_{ki}}^{x_i} \right) \\ & = \log p(C_k) + \sum_{i=1}^n x_i \cdot \log p_{ki} \\ & = b + \mathbf{w}_k^\top \mathbf{x} \end{align} }[/math]
where [math]\displaystyle{ b = \log p(C_k) }[/math] and [math]\displaystyle{ w_{ki} = \log p_{ki} }[/math]. Estimating the parameters in log space is advantageous since multiplying a large number of small values can lead to significant rounding error. Applying a log transform reduces the effect of this rounding error.
If a given class and feature value never occur together in the training data, then the frequency-based probability estimate will be zero, because the probability estimate is directly proportional to the number of occurrences of a feature's value. This is problematic because it will wipe out all information in the other probabilities when they are multiplied. Therefore, it is often desirable to incorporate a small-sample correction, called pseudocount, in all probability estimates such that no probability is ever set to be exactly zero. This way of regularizing naive Bayes is called Laplace smoothing when the pseudocount is one, and Lidstone smoothing in the general case.
Rennie et al. discuss problems with the multinomial assumption in the context of document classification and possible ways to alleviate those problems, including the use of tf–idf weights instead of raw term frequencies and document length normalization, to produce a naive Bayes classifier that is competitive with support vector machines.^{[13]}
Bernoulli naive Bayes
In the multivariate Bernoulli event model, features are independent Booleans (binary variables) describing inputs. Like the multinomial model, this model is popular for document classification tasks,^{[9]} where binary term occurrence features are used rather than term frequencies. If [math]\displaystyle{ x_i }[/math] is a Boolean expressing the occurrence or absence of the i'th term from the vocabulary, then the likelihood of a document given a class [math]\displaystyle{ C_k }[/math] is given by:^{[9]}
- [math]\displaystyle{ p(\mathbf{x} \mid C_k) = \prod_{i=1}^n p_{ki}^{x_i} (1 - p_{ki})^{(1-x_i)} }[/math]
where [math]\displaystyle{ p_{ki} }[/math] is the probability of class [math]\displaystyle{ C_k }[/math] generating the term [math]\displaystyle{ x_i }[/math]. This event model is especially popular for classifying short texts. It has the benefit of explicitly modelling the absence of terms. Note that a naive Bayes classifier with a Bernoulli event model is not the same as a multinomial NB classifier with frequency counts truncated to one.
Semi-supervised parameter estimation
Given a way to train a naive Bayes classifier from labeled data, it's possible to construct a semi-supervised training algorithm that can learn from a combination of labeled and unlabeled data by running the supervised learning algorithm in a loop:^{[14]}
- Given a collection [math]\displaystyle{ D = L \uplus U }[/math] of labeled samples L and unlabeled samples U, start by training a naive Bayes classifier on L.
- Until convergence, do:
- Predict class probabilities [math]\displaystyle{ P(C \mid x) }[/math] for all examples x in [math]\displaystyle{ D }[/math].
- Re-train the model based on the probabilities (not the labels) predicted in the previous step.
Convergence is determined based on improvement to the model likelihood [math]\displaystyle{ P(D \mid \theta) }[/math], where [math]\displaystyle{ \theta }[/math] denotes the parameters of the naive Bayes model.
This training algorithm is an instance of the more general expectation–maximization algorithm (EM): the prediction step inside the loop is the E-step of EM, while the re-training of naive Bayes is the M-step. The algorithm is formally justified by the assumption that the data are generated by a mixture model, and the components of this mixture model are exactly the classes of the classification problem.^{[14]}
Discussion
Despite the fact that the far-reaching independence assumptions are often inaccurate, the naive Bayes classifier has several properties that make it surprisingly useful in practice. In particular, the decoupling of the class conditional feature distributions means that each distribution can be independently estimated as a one-dimensional distribution. This helps alleviate problems stemming from the curse of dimensionality, such as the need for data sets that scale exponentially with the number of features. While naive Bayes often fails to produce a good estimate for the correct class probabilities,^{[15]} this may not be a requirement for many applications. For example, the naive Bayes classifier will make the correct MAP decision rule classification so long as the correct class is predicted as more probable than any other class. This is true regardless of whether the probability estimate is slightly, or even grossly inaccurate. In this manner, the overall classifier can be robust enough to ignore serious deficiencies in its underlying naive probability model.^{[16]} Other reasons for the observed success of the naive Bayes classifier are discussed in the literature cited below.
Relation to logistic regression
In the case of discrete inputs (indicator or frequency features for discrete events), naive Bayes classifiers form a generative-discriminative pair with multinomial logistic regression classifiers: each naive Bayes classifier can be considered a way of fitting a probability model that optimizes the joint likelihood [math]\displaystyle{ p(C, \mathbf{x}) }[/math], while logistic regression fits the same probability model to optimize the conditional [math]\displaystyle{ p(C \mid \mathbf{x}) }[/math].^{[17]}
More formally, we have the following:
Theorem — Naive Bayes classifiers on binary features are subsumed by logistic regression classifiers.
Consider a generic multiclass classification problem, with possible classes [math]\displaystyle{ Y\in \{1, ..., n\} }[/math], then the (non-naive) Bayes classifier gives, by Bayes theorem:
[math]\displaystyle{ p(Y \mid X=x) = \text{softmax}(\{\ln p(Y = k) + \ln p(X=x \mid Y=k)\}_k) }[/math]
The naive Bayes classifier gives
[math]\displaystyle{ \text{softmax}\left(\left\{\ln p(Y = k) + \frac 12 \sum_i (a^+_{i, k} - a^-_{i, k})x_i + (a^+_{i, k} + a^-_{i, k})\right\}_k\right) }[/math] where
[math]\displaystyle{ a^+_{i, s} = \ln p(X_i=+1 \mid Y=s);\quad a^-_{i, s} = \ln p(X_i=-1 \mid Y=s) }[/math]
This is exactly a logistic regression classifier.
The link between the two can be seen by observing that the decision function for naive Bayes (in the binary case) can be rewritten as "predict class [math]\displaystyle{ C_1 }[/math] if the odds of [math]\displaystyle{ p(C_1 \mid \mathbf{x}) }[/math] exceed those of [math]\displaystyle{ p(C_2 \mid \mathbf{x}) }[/math]". Expressing this in log-space gives:
- [math]\displaystyle{ \log\frac{p(C_1 \mid \mathbf{x})}{p(C_2 \mid \mathbf{x})} = \log p(C_1 \mid \mathbf{x}) - \log p(C_2 \mid \mathbf{x}) \gt 0 }[/math]
The left-hand side of this equation is the log-odds, or logit, the quantity predicted by the linear model that underlies logistic regression. Since naive Bayes is also a linear model for the two "discrete" event models, it can be reparametrised as a linear function [math]\displaystyle{ b + \mathbf{w}^\top x \gt 0 }[/math]. Obtaining the probabilities is then a matter of applying the logistic function to [math]\displaystyle{ b + \mathbf{w}^\top x }[/math], or in the multiclass case, the softmax function.
Discriminative classifiers have lower asymptotic error than generative ones; however, research by Ng and Jordan has shown that in some practical cases naive Bayes can outperform logistic regression because it reaches its asymptotic error faster.^{[17]}
Examples
Person classification
Problem: classify whether a given person is a male or a female based on the measured features. The features include height, weight, and foot size. Although with NB classifier we treat them as independent, they are not in reality.
Training
Example training set below.
Person | height (feet) | weight (lbs) | foot size (inches) |
---|---|---|---|
male | 6 | 180 | 12 |
male | 5.92 (5'11") | 190 | 11 |
male | 5.58 (5'7") | 170 | 12 |
male | 5.92 (5'11") | 165 | 10 |
female | 5 | 100 | 6 |
female | 5.5 (5'6") | 150 | 8 |
female | 5.42 (5'5") | 130 | 7 |
female | 5.75 (5'9") | 150 | 9 |
The classifier created from the training set using a Gaussian distribution assumption would be (given variances are unbiased sample variances):
Person | mean (height) | variance (height) | mean (weight) | variance (weight) | mean (foot size) | variance (foot size) |
---|---|---|---|---|---|---|
male | 5.855 | 3.5033 × 10^{−2} | 176.25 | 1.2292 × 10^{2} | 11.25 | 9.1667 × 10^{−1} |
female | 5.4175 | 9.7225 × 10^{−2} | 132.5 | 5.5833 × 10^{2} | 7.5 | 1.6667 |
The following example assumes equiprobable classes so that P(male)= P(female) = 0.5. This prior probability distribution might be based on prior knowledge of frequencies in the larger population or in the training set.
Testing
Below is a sample to be classified as male or female.
Person | height (feet) | weight (lbs) | foot size (inches) |
---|---|---|---|
sample | 6 | 130 | 8 |
In order to classify the sample, one has to determine which posterior is greater, male or female. For the classification as male the posterior is given by
- [math]\displaystyle{ \text{posterior (male)} = \frac{P(\text{male}) \, p(\text{height} \mid \text{male}) \, p(\text{weight} \mid \text{male}) \, p(\text{foot size} \mid \text{male})}{evidence} }[/math]
For the classification as female the posterior is given by
- [math]\displaystyle{ \text{posterior (female)} = \frac{P(\text{female}) \, p(\text{height} \mid \text{female}) \, p(\text{weight} \mid \text{female}) \, p(\text{foot size} \mid \text{female})}{evidence} }[/math]
The evidence (also termed normalizing constant) may be calculated:
- [math]\displaystyle{ \begin{align} \text{evidence} = P(\text{male}) \, p(\text{height} \mid \text{male}) \, p(\text{weight} \mid \text{male}) \, p(\text{foot size} \mid \text{male}) \\ + P(\text{female}) \, p(\text{height} \mid \text{female}) \, p(\text{weight} \mid \text{female}) \, p(\text{foot size} \mid \text{female}) \end{align} }[/math]
However, given the sample, the evidence is a constant and thus scales both posteriors equally. It therefore does not affect classification and can be ignored. The probability distribution for the sex of the sample can now be determined:
- [math]\displaystyle{ P(\text{male}) = 0.5 }[/math]
- [math]\displaystyle{ p({\text{height}} \mid \text{male}) = \frac{1}{\sqrt{2\pi \sigma^2}}\exp\left(\frac{-(6-\mu)^2}{2\sigma^2}\right) \approx 1.5789 }[/math],
where [math]\displaystyle{ \mu = 5.855 }[/math] and [math]\displaystyle{ \sigma^2 = 3.5033 \cdot 10^{-2} }[/math] are the parameters of normal distribution which have been previously determined from the training set. Note that a value greater than 1 is OK here – it is a probability density rather than a probability, because height is a continuous variable.
- [math]\displaystyle{ p({\text{weight}} \mid \text{male}) = \frac{1}{\sqrt{2\pi \sigma^2}}\exp\left(\frac{-(130-\mu)^2}{2\sigma^2}\right) = 5.9881 \cdot 10^{-6} }[/math]
- [math]\displaystyle{ p({\text{foot size}} \mid \text{male}) = \frac{1}{\sqrt{2\pi \sigma^2}}\exp\left(\frac{-(8-\mu)^2}{2\sigma^2}\right) = 1.3112 \cdot 10^{-3} }[/math]
- [math]\displaystyle{ \text{posterior numerator (male)} = \text{their product} = 6.1984 \cdot 10^{-9} }[/math]
- [math]\displaystyle{ P({\text{female}}) = 0.5 }[/math]
- [math]\displaystyle{ p({\text{height}} \mid {\text{female}}) = 2.23 \cdot 10^{-1} }[/math]
- [math]\displaystyle{ p({\text{weight}} \mid {\text{female}}) = 1.6789 \cdot 10^{-2} }[/math]
- [math]\displaystyle{ p({\text{foot size}} \mid {\text{female}}) = 2.8669 \cdot 10^{-1} }[/math]
- [math]\displaystyle{ \text{posterior numerator (female)} = \text{their product} = 5.3778 \cdot 10^{-4} }[/math]
Since posterior numerator is greater in the female case, the prediction is that the sample is female.
Document classification
Here is a worked example of naive Bayesian classification to the document classification problem. Consider the problem of classifying documents by their content, for example into spam and non-spam e-mails. Imagine that documents are drawn from a number of classes of documents which can be modeled as sets of words where the (independent) probability that the i-th word of a given document occurs in a document from class C can be written as
- [math]\displaystyle{ p(w_i \mid C)\, }[/math]
(For this treatment, things are further simplified by assuming that words are randomly distributed in the document - that is, words are not dependent on the length of the document, position within the document with relation to other words, or other document-context.)
Then the probability that a given document D contains all of the words [math]\displaystyle{ w_i }[/math], given a class C, is
- [math]\displaystyle{ p(D\mid C)=\prod_i p(w_i \mid C)\, }[/math]
The question that has to be answered is: "what is the probability that a given document D belongs to a given class C?" In other words, what is [math]\displaystyle{ p(C \mid D)\, }[/math]?
Now by definition
- [math]\displaystyle{ p(D\mid C)={p(D\cap C)\over p(C)} }[/math]
and
- [math]\displaystyle{ p(C \mid D)={p(D\cap C)\over p(D)} }[/math]
Bayes' theorem manipulates these into a statement of probability in terms of likelihood.
- [math]\displaystyle{ p(C\mid D)=\frac{p(C)\,p(D\mid C)}{p(D)} }[/math]
Assume for the moment that there are only two mutually exclusive classes, S and ¬S (e.g. spam and not spam), such that every element (email) is in either one or the other;
- [math]\displaystyle{ p(D\mid S)=\prod_i p(w_i \mid S)\, }[/math]
and
- [math]\displaystyle{ p(D\mid\neg S)=\prod_i p(w_i\mid\neg S)\, }[/math]
Using the Bayesian result above, one can write:
- [math]\displaystyle{ p(S\mid D)={p(S)\over p(D)}\,\prod_i p(w_i \mid S) }[/math]
- [math]\displaystyle{ p(\neg S\mid D)={p(\neg S)\over p(D)}\,\prod_i p(w_i \mid\neg S) }[/math]
Dividing one by the other gives:
- [math]\displaystyle{ {p(S\mid D)\over p(\neg S\mid D)}={p(S)\,\prod_i p(w_i \mid S)\over p(\neg S)\,\prod_i p(w_i \mid\neg S)} }[/math]
Which can be re-factored as:
- [math]\displaystyle{ {p(S\mid D)\over p(\neg S\mid D)}={p(S)\over p(\neg S)}\,\prod_i {p(w_i \mid S)\over p(w_i \mid\neg S)} }[/math]
Thus, the probability ratio p(S | D) / p(¬S | D) can be expressed in terms of a series of likelihood ratios. The actual probability p(S | D) can be easily computed from log (p(S | D) / p(¬S | D)) based on the observation that p(S | D) + p(¬S | D) = 1.
Taking the logarithm of all these ratios, one obtains:
- [math]\displaystyle{ \ln{p(S\mid D)\over p(\neg S\mid D)}=\ln{p(S)\over p(\neg S)}+\sum_i \ln{p(w_i\mid S)\over p(w_i\mid\neg S)} }[/math]
(This technique of "log-likelihood ratios" is a common technique in statistics. In the case of two mutually exclusive alternatives (such as this example), the conversion of a log-likelihood ratio to a probability takes the form of a sigmoid curve: see logit for details.)
Finally, the document can be classified as follows. It is spam if [math]\displaystyle{ p(S\mid D) \gt p(\neg S\mid D) }[/math] (i. e., [math]\displaystyle{ \ln{p(S\mid D)\over p(\neg S\mid D)} \gt 0 }[/math]), otherwise it is not spam.
See also
- AODE
- Bayes classifier
- Bayesian spam filtering
- Bayesian network
- Random naive Bayes
- Linear classifier
- Logistic regression
- Perceptron
- Take-the-best heuristic
References
- ↑ McCallum, Andrew. "Graphical Models, Lecture2: Bayesian Network Representation". https://people.cs.umass.edu/~mccallum/courses/gm2011/02-bn-rep.pdf.
- ↑ ^{2.0} ^{2.1} Russell, Stuart; Norvig, Peter (2003) [1995]. Artificial Intelligence: A Modern Approach (2nd ed.). Prentice Hall. ISBN 978-0137903955.
- ↑ ^{3.0} ^{3.1} ^{3.2} Hand, D. J.; Yu, K. (2001). "Idiot's Bayes — not so stupid after all?". International Statistical Review 69 (3): 385–399. doi:10.2307/1403452. ISSN 0306-7734.
- ↑ Zhang, Harry. "The Optimality of Naive Bayes". FLAIRS2004 conference. http://www.cs.unb.ca/profs/hzhang/publications/FLAIRS04ZhangH.pdf.
- ↑ Caruana, R.; Niculescu-Mizil, A. (2006). "An empirical comparison of supervised learning algorithms". Proc. 23rd International Conference on Machine Learning.
- ↑ "Why does Naive Bayes work better when the number of features >> sample size compared to more sophisticated ML algorithms?". https://stats.stackexchange.com/q/379383.
- ↑ Narasimha Murty, M.; Susheela Devi, V. (2011). Pattern Recognition: An Algorithmic Approach. ISBN 978-0857294944.
- ↑ ^{8.0} ^{8.1} John, George H.; Langley, Pat (1995). "Estimating Continuous Distributions in Bayesian Classifiers". Proc. Eleventh Conf. on Uncertainty in Artificial Intelligence. Morgan Kaufmann. pp. 338–345. https://dl.acm.org/doi/10.5555/2074158.2074196.
- ↑ ^{9.0} ^{9.1} ^{9.2} McCallum, Andrew; Nigam, Kamal (1998). "A comparison of event models for Naive Bayes text classification". AAAI-98 workshop on learning for text categorization. 752. http://www.kamalnigam.com/papers/multinomial-aaaiws98.pdf.
- ↑ Metsis, Vangelis; Androutsopoulos, Ion; Paliouras, Georgios (2006). "Spam filtering with Naive Bayes—which Naive Bayes?". Third conference on email and anti-spam (CEAS). 17. https://www.researchgate.net/publication/221650814.
- ↑ Piryonesi, S. Madeh; El-Diraby, Tamer E. (2020-06-01). "Role of Data Analytics in Infrastructure Asset Management: Overcoming Data Size and Quality Problems". Journal of Transportation Engineering, Part B: Pavements 146 (2): 04020022. doi:10.1061/JPEODX.0000175.
- ↑ Hastie, Trevor. (2001). The elements of statistical learning : data mining, inference, and prediction : with 200 full-color illustrations. Tibshirani, Robert., Friedman, J. H. (Jerome H.). New York: Springer. ISBN 0-387-95284-5. OCLC 46809224.
- ↑ ^{13.0} ^{13.1} Rennie, J.; Shih, L.; Teevan, J.; Karger, D. (2003). "Tackling the poor assumptions of naive Bayes classifiers". ICML. http://people.csail.mit.edu/~jrennie/papers/icml03-nb.pdf.
- ↑ ^{14.0} ^{14.1} Nigam, Kamal; McCallum, Andrew; Thrun, Sebastian; Mitchell, Tom (2000). "Learning to classify text from labeled and unlabeled documents using EM". Machine Learning 39 (2/3): 103–134. doi:10.1023/A:1007692713085. http://www.kamalnigam.com/papers/emcat-aaai98.pdf.
- ↑ Niculescu-Mizil, Alexandru; Caruana, Rich (2005). "Predicting good probabilities with supervised learning". ICML. doi:10.1145/1102351.1102430. http://machinelearning.wustl.edu/mlpapers/paper_files/icml2005_Niculescu-MizilC05.pdf. Retrieved 2016-04-24.
- ↑ Rish, Irina (2001). "An empirical study of the naive Bayes classifier". IJCAI Workshop on Empirical Methods in AI. http://www.research.ibm.com/people/r/rish/papers/RC22230.pdf.
- ↑ ^{17.0} ^{17.1} Ng, Andrew Y.; Jordan, Michael I. (2002). "On discriminative vs. generative classifiers: A comparison of logistic regression and naive Bayes". NIPS. 14. http://papers.nips.cc/paper/2020-on-discriminative-vs-generative-classifiers-a-comparison-of-logistic-regression-and-naive-bayes.
Further reading
- Domingos, Pedro; Pazzani, Michael (1997). "On the optimality of the simple Bayesian classifier under zero-one loss". Machine Learning 29 (2/3): 103–137. doi:10.1023/A:1007413511361. http://citeseer.ist.psu.edu/domingos97optimality.html.
- Webb, G. I.; Boughton, J.; Wang, Z. (2005). "Not So Naive Bayes: Aggregating One-Dependence Estimators". Machine Learning 58 (1): 5–24. doi:10.1007/s10994-005-4258-6.
- Mozina, M.; Demsar, J.; Kattan, M.; Zupan, B. (2004). "Nomograms for Visualization of Naive Bayesian Classifier". Proc. PKDD-2004. pp. 337–348. http://eprints.fri.uni-lj.si/154/01/PKDD_camera_mozina.pdf.
- Maron, M. E. (1961). "Automatic Indexing: An Experimental Inquiry". Journal of the ACM 8 (3): 404–417. doi:10.1145/321075.321084.
- Minsky, M. (1961). "Steps toward Artificial Intelligence". Proc. IRE. 49. pp. 8–30.
External links
- Book Chapter: Naive Bayes text classification, Introduction to Information Retrieval
- Naive Bayes for Text Classification with Unbalanced Classes
- Benchmark results of Naive Bayes implementations
- Hierarchical Naive Bayes Classifiers for uncertain data (an extension of the Naive Bayes classifier).
- Software
- Naive Bayes classifiers are available in many general-purpose machine learning and NLP packages, including Apache Mahout, Mallet, NLTK, Orange, scikit-learn and Weka.
- IMSL Numerical Libraries Collections of math and statistical algorithms available in C/C++, Fortran, Java and C#/.NET. Data mining routines in the IMSL Libraries include a Naive Bayes classifier.
- An interactive Microsoft Excel spreadsheet Naive Bayes implementation using VBA (requires enabled macros) with viewable source code.
- jBNC - Bayesian Network Classifier Toolbox
- Statistical Pattern Recognition Toolbox for Matlab.
- ifile - the first freely available (Naive) Bayesian mail/spam filter
- NClassifier - NClassifier is a .NET library that supports text classification and text summarization. It is a port of Classifier4J.
- Classifier4J - Classifier4J is a Java library designed to do text classification. It comes with an implementation of a Bayesian classifier.
- JNBC Naive Bayes Classifier running in-memory or using fast key-value stores (MapDB, LevelDB or RocksDB).
- Blayze - Blayze is a minimal JVM library for Naive Bayes classification written in Kotlin.
Original source: https://en.wikipedia.org/wiki/Naive Bayes classifier.
Read more |