Naive Bayes for text in NLP - Model Pipeline Trace

Model Pipeline - Naive Bayes for text

This pipeline shows how a Naive Bayes model learns to classify text messages into categories by counting word frequencies and using probabilities.

Data Flow - 5 Stages

1Raw text data

1000 rows x 1 column→Original text messages with labels→1000 rows x 1 column

"I love this movie" labeled as Positive

↓

2Text cleaning and tokenization

1000 rows x 1 column→Lowercase, remove punctuation, split sentences into words→1000 rows x variable-length word lists

"I love this movie" -> ["i", "love", "this", "movie"]

↓

3Feature extraction (Bag of Words)

1000 rows x variable-length word lists→Count word occurrences, create fixed-size vocabulary vector→1000 rows x 5000 columns

"i love this movie" -> vector with counts for words like 'love':1, 'movie':1

↓

4Train/test split

1000 rows x 5000 columns→Split data into training (80%) and testing (20%) sets→800 rows x 5000 columns (train), 200 rows x 5000 columns (test)

Training set has 800 messages with word count vectors

↓

5Model training (Naive Bayes)

800 rows x 5000 columns→Calculate word probabilities per class with smoothing→Model with learned word probabilities

Probability of word 'love' given Positive class is 0.03

Training Trace - Epoch by Epoch

Loss
0.7 |****
0.6 |****
0.5 |****
0.4 |****
0.3 |****
    +----
     1 5 Epochs

Epoch	Loss ↓	Accuracy ↑	Observation
1	0.65	0.7	Initial training with basic word counts
2	0.5	0.8	Model learns better word-class associations
3	0.4	0.85	Improved smoothing and probability estimates
4	0.35	0.88	Model converges with stable accuracy
5	0.33	0.89	Final epoch with slight improvement

Prediction Trace - 4 Layers

Layer 1: Input text

Layer 2: Feature vector creation

Layer 3: Calculate class probabilities

Layer 4: Prediction

Model Quiz - 3 Questions

What does the Bag of Words step do in this pipeline?

A Splits text into sentences

B Counts how many times each word appears in the text

C Removes stop words from the text

D Converts text into audio signals

Key Insight

Naive Bayes uses simple word counts and probabilities to classify text quickly and effectively, showing how counting features can help machines understand language.

Practice

1. What is the main assumption behind the Naive Bayes algorithm when used for text classification?

easy

A. Words always appear in a fixed order

B. Words in a document are independent of each other given the class label

C. All documents have the same length

D. The frequency of words does not affect classification

Solution

1. Step 1: Understand Naive Bayes assumption

   Naive Bayes assumes that each feature (word) is independent of others given the class label.

2. Step 2: Relate assumption to text classification

   This means the presence or absence of one word does not affect another word's probability in the same document for classification.

3. Final Answer:

   Words in a document are independent of each other given the class label -> Option B

4. Quick Check:

   Naive Bayes = word independence assumption [OK]

Hint: Naive Bayes treats words as independent features [OK]

Common Mistakes:

• Thinking word order matters
• Assuming word frequency is ignored
• Believing documents must be same length

2. Which of the following is the correct way to calculate the probability of a document belonging to a class using Naive Bayes?

easy

A. P(class) / \sum_{word} P(word|class)

B. P(class) + \sum_{word} P(word|class)

C. P(class) * \prod_{word} P(word|class)

D. P(class) - \prod_{word} P(word|class)

Solution

1. Step 1: Recall Naive Bayes formula for text

   The probability of a class given a document is proportional to the prior probability of the class times the product of the conditional probabilities of each word given the class.

2. Step 2: Match formula to options

   P(class) * \prod_{word} P(word|class) correctly shows multiplication (product) of P(word|class) terms with P(class).

3. Final Answer:

   P(class) * \prod_{word} P(word|class) -> Option C

4. Quick Check:

   Naive Bayes uses product of word probabilities [OK]

Hint: Multiply class prior by product of word likelihoods [OK]

Common Mistakes:

• Adding probabilities instead of multiplying
• Dividing probabilities incorrectly
• Subtracting probabilities

3. Given the following code snippet using sklearn's MultinomialNB for text classification, what will be the predicted class for the input text ['love this movie']?

from sklearn.feature_extraction.text import CountVectorizer
from sklearn.naive_bayes import MultinomialNB

texts = ['I love this movie', 'I hate this movie']
labels = ['positive', 'negative']

vectorizer = CountVectorizer()
X = vectorizer.fit_transform(texts)

model = MultinomialNB()
model.fit(X, labels)

new_text = vectorizer.transform(['love this movie'])
prediction = model.predict(new_text)
print(prediction[0])

medium

A. movie

B. negative

C. hate

D. positive

Solution

1. Step 1: Understand training data and labels

   The model is trained on two texts: one labeled 'positive' and one 'negative'. The words 'love' and 'hate' are key indicators.

2. Step 2: Analyze prediction input

   The input text 'love this movie' contains the word 'love' which appeared in the positive example, so the model predicts 'positive'.

3. Final Answer:

   positive -> Option D

4. Quick Check:

   Word 'love' matches positive class [OK]

Hint: Check which class words in input appeared during training [OK]

Common Mistakes:

• Confusing label names with words
• Ignoring vectorizer transformation
• Predicting word instead of class

4. Consider this code snippet using Naive Bayes for text classification:

from sklearn.feature_extraction.text import CountVectorizer
from sklearn.naive_bayes import MultinomialNB

texts = ['spam spam spam', 'ham ham ham']
labels = ['spam', 'ham']

vectorizer = CountVectorizer()
X = vectorizer.fit_transform(texts)

model = MultinomialNB()
model.fit(X, labels)

new_text = vectorizer.transform(['spam ham spam'])
prediction = model.predict(new_text)
print(prediction[0])

The output is unexpected. What is the likely cause?

medium

A. The input text contains words from both classes causing confusion

B. The vectorizer did not fit on the training data

C. MultinomialNB requires numeric labels, not strings

D. The model cannot handle words not seen in training

Solution

1. Step 1: Analyze training and input data

   The training data has clear spam and ham texts. The input text mixes words from both classes.

2. Step 2: Understand Naive Bayes behavior with mixed words

   Naive Bayes calculates probabilities for each class. Mixed words can cause the model to be uncertain or pick the class with higher prior or likelihood.

3. Final Answer:

   The input text contains words from both classes causing confusion -> Option A

4. Quick Check:

   Mixed class words confuse Naive Bayes prediction [OK]

Hint: Mixed class words can confuse Naive Bayes predictions [OK]

Common Mistakes:

• Assuming unseen words cause error
• Thinking vectorizer was not fitted
• Believing labels must be numeric

5. You want to improve a Naive Bayes text classifier that often misclassifies short texts with rare words. Which approach is best to reduce this problem?

hard

A. Use Laplace smoothing to handle rare or unseen words

B. Remove all stop words from the training data

C. Increase the number of classes to make classification finer

D. Use raw word counts without normalization

Solution

1. Step 1: Identify problem with rare words

   Rare or unseen words can cause zero probabilities, making Naive Bayes assign zero probability to classes incorrectly.

2. Step 2: Apply Laplace smoothing

   Laplace smoothing adds a small count to all words, preventing zero probabilities and improving classification on rare words.

3. Final Answer:

   Use Laplace smoothing to handle rare or unseen words -> Option A

4. Quick Check:

   Laplace smoothing fixes zero probability issues [OK]

Hint: Add smoothing to avoid zero probabilities for rare words [OK]

Common Mistakes:

• Thinking removing stop words fixes rare word issue
• Believing more classes always improve accuracy
• Ignoring smoothing effects on probabilities