{"id":4834,"date":"2026-10-14T12:20:25","date_gmt":"2026-10-14T12:20:25","guid":{"rendered":"https:\/\/prwatech.in\/blog\/?p=4834"},"modified":"2026-10-15T15:15:07","modified_gmt":"2026-10-15T15:15:07","slug":"naive-bayes-classifier-in-machine-learning","status":"publish","type":"post","link":"https:\/\/prwatech.in\/blog\/machine-learning\/machine-learning-modules\/naive-bayes-classifier-in-machine-learning\/","title":{"rendered":"Naive Bayes Classifier in Machine Learning"},"content":{"rendered":"

Naive Bayes Classifier in Machine Learning<\/b><\/strong><\/h1>\n

Every day your email inbox decides, in a fraction of a second, whether a message is spam. It does not read the message the way you do. It looks at the words, asks how often each one appears in spam compared with normal mail, and combines those clues into a single judgement. One of the oldest and most successful ways to do that is the Naive Bayes classifier.<\/p>\n

Naive Bayes is a classification method built on a result from probability called Bayes theorem. Despite a deliberately simple assumption, it is fast, needs little training data and works surprisingly well on text problems such as spam filtering, sentiment analysis and document sorting. That is why it is often the first model people try, and a sensible baseline to beat.<\/p>\n

This guide builds the idea from the ground up. We start with Bayes theorem and why the method is called naive, then work through a full example by hand so you can see every number. After that comes Gaussian Naive Bayes for continuous data with a working Python program, the other variants, smoothing, strengths and limits, applications, common mistakes and a short FAQ.<\/p>\n

Introduction to Bayes Theorem<\/b><\/strong><\/h2>\n

Bayes theorem tells you how to update a belief when you see new evidence. It connects two questions that sound similar but are not the same: how likely is the evidence if the thing is true, and how likely is the thing to be true given the evidence.<\/p>\n

P(A given B) = P(B given A) * P(A) \/ P(B)<\/p>\n

    \n
  • <\/b>P(A given B)<\/b><\/strong>is the probability of A once you know B has happened. This is what we want.<\/li>\n
  • <\/b>P(B given A)<\/b><\/strong>is the probability of seeing B if A is true. It is called the likelihood.<\/li>\n
  • <\/b>P(A)<\/b><\/strong>is how likely A is before seeing anything. It is called the prior.<\/li>\n
  • <\/b>P(B)<\/b><\/strong>is how likely the evidence is overall.<\/li>\n<\/ul>\n

    Here is a small example. Suppose 20 percent of your email is spam. The word offer appears in 60 percent of spam but only 5 percent of normal mail. An email arrives containing offer. How likely is it to be spam?<\/p>\n

    Spam and offer: \u00a0\u00a0\u00a0\u00a0\u00a00.60 * 0.20 = 0.12<\/p>\n

    Not spam and offer: \u00a00.05 * 0.80 = 0.04<\/p>\n

    P(spam given offer) = 0.12 \/ (0.12 + 0.04) = 0.75<\/p>\n

    A 20 percent prior turned into a 75 percent probability after one piece of evidence. That is Bayes theorem at work.<\/p>\n

    Why is It Called Naive?<\/b><\/strong><\/h2>\n

    A real email has many words, not one. Doing the exact calculation with all of them would need to know how every word combination behaves together, which needs far more data than anyone has. Naive Bayes takes a shortcut. It assumes that, once you know the class, each feature is independent of the others. So it simply multiplies the clues together.<\/p>\n

    That assumption is almost never exactly true. Words like free and offer often appear together. But the method is still often accurate, because it only needs to rank the classes correctly and not to get every probability right. The assumption is the naive part, and it is also what makes the method so cheap to train.<\/p>\n

    One correction to a common misreading: this does not mean every feature gets the same weight. Features with stronger evidence move the answer more. It means the features are treated as independent given the class.<\/p>\n

    Naive Bayes Classifier Example<\/b><\/strong><\/h2>\n

    Imagine you want to predict whether a cricket match will be played, based on the weather. Here are 14 past days. The first four columns are the features<\/b><\/strong>, collected into a feature matrix. The last column is the response<\/b><\/strong>, the thing we want to predict, collected into a response vector.<\/p>\n

    \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
    Weather and cricket dataset<\/caption>\n
    Outlook<\/th>\nTemperature<\/th>\nHumidity<\/th>\nWindy<\/th>\nCricket played<\/th>\n<\/tr>\n<\/thead>\n
    Sunny<\/td>\nHot<\/td>\nHigh<\/td>\nNo<\/td>\nNo<\/td>\n<\/tr>\n
    Sunny<\/td>\nHot<\/td>\nHigh<\/td>\nYes<\/td>\nNo<\/td>\n<\/tr>\n
    Overcast<\/td>\nHot<\/td>\nHigh<\/td>\nNo<\/td>\nYes<\/td>\n<\/tr>\n
    Rainy<\/td>\nMild<\/td>\nHigh<\/td>\nNo<\/td>\nYes<\/td>\n<\/tr>\n
    Rainy<\/td>\nCool<\/td>\nNormal<\/td>\nNo<\/td>\nYes<\/td>\n<\/tr>\n
    Rainy<\/td>\nCool<\/td>\nNormal<\/td>\nYes<\/td>\nNo<\/td>\n<\/tr>\n
    Overcast<\/td>\nCool<\/td>\nNormal<\/td>\nYes<\/td>\nYes<\/td>\n<\/tr>\n
    Sunny<\/td>\nMild<\/td>\nHigh<\/td>\nNo<\/td>\nNo<\/td>\n<\/tr>\n
    Sunny<\/td>\nCool<\/td>\nNormal<\/td>\nNo<\/td>\nYes<\/td>\n<\/tr>\n
    Rainy<\/td>\nMild<\/td>\nNormal<\/td>\nNo<\/td>\nYes<\/td>\n<\/tr>\n
    Sunny<\/td>\nMild<\/td>\nNormal<\/td>\nYes<\/td>\nYes<\/td>\n<\/tr>\n
    Overcast<\/td>\nMild<\/td>\nHigh<\/td>\nYes<\/td>\nYes<\/td>\n<\/tr>\n
    Overcast<\/td>\nHot<\/td>\nNormal<\/td>\nNo<\/td>\nYes<\/td>\n<\/tr>\n
    Rainy<\/td>\nMild<\/td>\nHigh<\/td>\nYes<\/td>\nNo<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

    The Two Assumptions<\/b><\/strong><\/p>\n

      \n
    • <\/b>Conditional independence.<\/b><\/strong>Given whether cricket is played, the weather features do not influence each other.<\/li>\n
    • <\/b>Every feature contributes.<\/b><\/strong>All the features are used as evidence, though not all push equally hard.<\/li>\n<\/ul>\n

      How Naive Bayes Works, Step by Step<\/b><\/strong><\/h2>\n

      \"naive<\/p>\n

      New day to predict: Sunny, Mild, Normal humidity, not windy. Will cricket be played? For each answer, Yes and No, we multiply a prior by the likelihood of each feature, then compare.<\/p>\n

      Step 1: the priors.<\/b><\/strong>\u00a0Cricket was played on 9 of the 14 days and not played on 5.<\/p>\n

      P(Yes) = 9\/14 = 0.643<\/p>\n

      P(No) \u00a0= 5\/14 = 0.357<\/p>\n

      Step 2: the likelihoods for Yes.<\/b><\/strong>\u00a0Among the 9 days when cricket was played, count how often each feature value appeared.<\/p>\n

      P(Sunny | Yes) \u00a0= 2\/9<\/p>\n

      P(Mild | Yes) \u00a0\u00a0= 4\/9<\/p>\n

      P(Normal | Yes) = 6\/9<\/p>\n

      P(Not windy | Yes) = 6\/9<\/p>\n

      \"naive<\/p>\n

      Step 3: the likelihoods for No.<\/b><\/strong>\u00a0Do the same for the 5 days when cricket was not played.<\/p>\n

      P(Sunny | No) \u00a0= 3\/5<\/p>\n

      P(Mild | No) \u00a0\u00a0= 2\/5<\/p>\n

      P(Normal | No) = 1\/5<\/p>\n

      P(Not windy | No) = 2\/5<\/p>\n

      \"naive<\/p>\n

      Step 4: multiply and compare.<\/b><\/strong><\/p>\n

      Score(Yes) = 0.643 * 0.222 * 0.444 * 0.667 * 0.667 = 0.0282<\/p>\n

      Score(No) \u00a0= 0.357 * 0.600 * 0.400 * 0.200 * 0.400 = 0.0069<\/p>\n

      \"naive<\/p>\n

      Yes scores higher. To turn the scores into probabilities, divide each by their total. That gives about 80.5 percent for Yes and 19.5 percent for No. Naive Bayes predicts that cricket will be played.<\/p>\n

      The Zero Frequency Problem and Smoothing<\/b><\/strong><\/h3>\n

      What if a feature value never appeared with a class in your training data? Its likelihood would be zero, and because we multiply, one zero wipes out the whole score. The fix is smoothing<\/b><\/strong>. Add a small count, usually 1, to every feature value so nothing is ever exactly zero. Adding 1 is called Laplace smoothing. In scikit learn, the setting is called alpha.<\/p>\n

      Gaussian Naive Bayes Classifier<\/b><\/strong><\/h2>\n

      The weather example uses categories. What about measurements such as height, temperature in degrees or a blood test value? Gaussian Naive Bayes handles continuous features by assuming that, within each class, each feature follows a bell shaped normal distribution. For every class it learns the average and the spread of each feature.<\/p>\n

      \"Gaussian<\/p>\n

      The probability of a feature value x for a class y is then read off the bell curve:<\/p>\n

      P(x | y) = 1 \/ sqrt(2 * pi * sigma_y^2) * exp( -(x – mu_y)^2 \/ (2 * sigma_y^2) )<\/p>\n

      Here mu_y is the average of the feature in class y, and sigma_y is its standard deviation.<\/p>\n

      \"gaussian<\/p>\n

      Gaussian Naive Bayes in Python<\/b><\/strong><\/h2>\n

      We will use the breast cancer dataset that comes with scikit learn, which has 30 measurements for each of 569 tumours and a label for malignant or benign. This complete program loads the data, splits it, trains the model and checks the accuracy.<\/p>\n

      from sklearn.datasets import load_breast_cancer<\/p>\n

      from sklearn.model_selection import train_test_split<\/p>\n

      from sklearn.naive_bayes import GaussianNB<\/p>\n

      from sklearn.metrics import accuracy_score<\/p>\n

       <\/p>\n

      X, y = load_breast_cancer(return_X_y=True)<\/p>\n

      X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.25, random_state=0)<\/p>\n

       <\/p>\n

      model = GaussianNB()<\/p>\n

      model.fit(X_train, y_train)<\/p>\n

      y_pred = model.predict(X_test)<\/p>\n

       <\/p>\n

      print(“Accuracy:”, round(accuracy_score(y_test, y_pred) * 100, 2), “percent”)<\/p>\n

      \"gaussian<\/p>\n

      Running it prints:<\/p>\n

      Accuracy: 93.71 percent<\/p>\n

      A model trained in a fraction of a second gets about 94 percent of the test cases right, which is a respectable result for a baseline. If you also want the probabilities, call predict_proba, but see the warning below before you trust them.<\/p>\n

      Types of Naive Bayes Classifiers<\/b><\/strong><\/h2>\n
      \n\n\n\n\n\n\n\n\n\n
      Naive Bayes variants<\/caption>\n
      Variant<\/th>\nFeature type<\/th>\nBest suited for<\/th>\n<\/tr>\n<\/thead>\n
      GaussianNB<\/th>\nContinuous numbers<\/td>\nMeasurements that look roughly bell shaped<\/td>\n<\/tr>\n
      MultinomialNB<\/th>\nCounts<\/td>\nText classification using word counts or tf idf<\/td>\n<\/tr>\n
      ComplementNB<\/th>\nCounts<\/td>\nImbalanced text data, often better than MultinomialNB<\/td>\n<\/tr>\n
      BernoulliNB<\/th>\nYes or no features<\/td>\nWord present or absent, shorter documents<\/td>\n<\/tr>\n
      CategoricalNB<\/th>\nCategories<\/td>\nData like the weather table, encoded as numbers first<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

       <\/p>\n

      Strengths and Limitations of Naive Bayes<\/b><\/strong><\/h2>\n

      Strengths<\/b><\/strong><\/h3>\n
        \n
      • Fast to train and fast to predict.<\/li>\n
      • Needs only a small amount of training data.<\/li>\n
      • Copes well with a very large number of features, such as words.<\/li>\n
      • Works well on text problems like spam filtering.<\/li>\n
      • Simple to explain, since you can read off which features pushed the answer.<\/li>\n<\/ul>\n

        Limitations<\/b><\/strong><\/h3>\n
          \n
        • The independence assumption is rarely true, so strongly related features are double counted.<\/li>\n
        • <\/b>The probability scores are unreliable.<\/b><\/strong>scikit learn itself notes that Naive Bayes is a decent classifier but a poor estimator, so the output of predict_proba should not be taken too seriously without calibration.<\/li>\n
        • Gaussian Naive Bayes expects roughly bell shaped features and can struggle otherwise.<\/li>\n
        • It cannot learn interactions between features.<\/li>\n<\/ul>\n

          Applications of Naive Bayes<\/b><\/strong><\/h2>\n
            \n
          • <\/b>Spam filtering. <\/b><\/strong>Classifying email from word evidence.<\/li>\n
          • <\/b>Sentiment analysis. <\/b><\/strong>Deciding whether a review is positive or negative.<\/li>\n
          • <\/b>Document and news classification. <\/b><\/strong>Sorting text by topic.<\/li>\n
          • <\/b>Recommendation and ranking. <\/b><\/strong>Quick first stage classifiers.<\/li>\n
          • <\/b>Medical screening. <\/b><\/strong>Combining test results into a risk estimate.<\/li>\n
          • <\/b>Real time prediction. <\/b><\/strong>The speed suits systems that must answer instantly.<\/li>\n<\/ul>\n