Bayes' classifier, also known as Naive Bayes, is a simple application
of Bayes' rule to allow computation of the probability that row
is
a positive experiment. If we assume that the attributes are
conditionally independent given the outcome, that is
, then we may apply
Bayes' rule to compute
![]() |
(6.9) |
There are two principal problems with BC. The first and less
important problem is that the attributes are rarely conditionally
independent, making the predictions suspect. The second problem is
that BC is a generative classifier. A generative classifier is
one which attempts to learn the joint probability
and
makes predictions by forming the conditional distribution
. This indirect approach contrasts with that of a
discriminative classifier, such as LR, which estimates
directly from the data. The result is that generative
classifiers are not directly optimizing the quantity of interest
[33]. Russel and Norvig [39] contains a nice description
of BC.
Computing
and
only needs to be done
once, thus BC is always fast. By exploiting sparsity and using a few
computation tricks, we have made our implementation of BC very fast.
Our implementation is linear in the number of nonzero entries of
.