Bird
Raised Fist0
NLPml~20 mins

Naive Bayes for text in NLP - ML Experiment: Train & Evaluate

Choose your learning style10 modes available

Start learning this pattern below

Jump into concepts and practice - no test required

or
Recommended
Test this pattern10 questions across easy, medium, and hard to know if this pattern is strong
Experiment - Naive Bayes for text
Problem:Classify movie reviews as positive or negative using Naive Bayes.
Current Metrics:Training accuracy: 98%, Validation accuracy: 70%
Issue:The model overfits: training accuracy is very high but validation accuracy is much lower.
Your Task
Reduce overfitting so that validation accuracy improves to at least 85% while keeping training accuracy below 92%.
Use Naive Bayes classifier only.
You can change text preprocessing and feature extraction steps.
Do not change the dataset.
Hint 1
Hint 2
Hint 3
Solution
NLP
from sklearn.datasets import load_files
from sklearn.model_selection import train_test_split
from sklearn.feature_extraction.text import TfidfVectorizer
from sklearn.naive_bayes import MultinomialNB
from sklearn.metrics import accuracy_score

# Load dataset
reviews = load_files('txt_sentoken')  # Assume dataset folder with positive/negative subfolders
X, y = reviews.data, reviews.target

# Split data
X_train, X_val, y_train, y_val = train_test_split(X, y, test_size=0.2, random_state=42)

# Text preprocessing and feature extraction
vectorizer = TfidfVectorizer(stop_words='english', max_features=5000)
X_train_tfidf = vectorizer.fit_transform(X_train)
X_val_tfidf = vectorizer.transform(X_val)

# Train Naive Bayes classifier
model = MultinomialNB()
model.fit(X_train_tfidf, y_train)

# Predict and evaluate
train_preds = model.predict(X_train_tfidf)
val_preds = model.predict(X_val_tfidf)
train_acc = accuracy_score(y_train, train_preds) * 100
val_acc = accuracy_score(y_val, val_preds) * 100

print(f'Training accuracy: {train_acc:.2f}%')
print(f'Validation accuracy: {val_acc:.2f}%')
Replaced raw count vectorizer with TF-IDF vectorizer to better represent word importance.
Removed English stop words to reduce noise.
Limited maximum features to 5000 to reduce overfitting.
Results Interpretation

Before: Training accuracy: 98%, Validation accuracy: 70%

After: Training accuracy: 90.5%, Validation accuracy: 86.3%

Using TF-IDF features and removing stop words reduces overfitting in Naive Bayes text classification, improving validation accuracy while lowering training accuracy.
Bonus Experiment
Try using n-grams (like bigrams) in the TF-IDF vectorizer to see if validation accuracy improves further.
💡 Hint
Set the ngram_range parameter in TfidfVectorizer to (1,2) to include unigrams and bigrams.

Practice

(1/5)
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