Decision tree classifier in ML Python - Model Metrics & Evaluation

Metrics & Evaluation - Decision tree classifier

Which metric matters for Decision Tree Classifier and WHY

For decision tree classifiers, the key metrics are accuracy, precision, recall, and F1 score. Accuracy shows overall correct predictions. Precision tells us how many predicted positives are truly positive. Recall shows how many actual positives were found. F1 score balances precision and recall. These metrics help us understand if the tree is good at classifying both classes well, especially when classes are uneven.

Confusion Matrix Example

      Actual \ Predicted | Positive | Negative
      -------------------|----------|---------
      Positive           |    40    |   10    
      Negative           |    5     |   45    

      Total samples = 40 + 10 + 5 + 45 = 100

      Precision = TP / (TP + FP) = 40 / (40 + 5) = 0.89
      Recall = TP / (TP + FN) = 40 / (40 + 10) = 0.80
      Accuracy = (TP + TN) / Total = (40 + 45) / 100 = 0.85
      F1 Score = 2 * (Precision * Recall) / (Precision + Recall) = 2 * (0.89 * 0.80) / (0.89 + 0.80) ≈ 0.84
    

Precision vs Recall Tradeoff with Examples

Decision trees can be tuned to favor precision or recall depending on the problem:

• High Precision: Useful when false positives are costly. For example, in email spam detection, we want to avoid marking good emails as spam.
• High Recall: Important when missing positives is risky. For example, in medical diagnosis, we want to catch as many sick patients as possible.

Adjusting the tree depth or pruning can shift this balance.

What Good vs Bad Metric Values Look Like

Good metrics: Accuracy above 80%, precision and recall both above 75%, and balanced F1 score indicate a reliable decision tree.

Bad metrics: Accuracy near 50% (random guessing), very low precision or recall (below 50%), or large difference between precision and recall show poor model performance or bias.

Common Pitfalls in Metrics for Decision Trees

• Accuracy Paradox: High accuracy can be misleading if classes are imbalanced.
• Overfitting: Very high training accuracy but low test accuracy means the tree memorizes data, not generalizes.
• Data Leakage: Using future or test data during training inflates metrics falsely.
• Ignoring Class Imbalance: Not checking precision and recall can hide poor detection of minority class.

Self Check

Your decision tree model has 98% accuracy but only 12% recall on the positive class (e.g., fraud). Is it good for production?

Answer: No. Despite high accuracy, the model misses most positive cases (low recall). This means many fraud cases go undetected, which is risky. You should improve recall before using it in production.

Key Result

Decision tree classifiers need balanced precision and recall to perform well, not just high accuracy.

Practice

1. What is the main purpose of a Decision Tree Classifier in machine learning?

easy

A. To store data in a database

B. To perform mathematical calculations on numbers

C. To generate random numbers for simulations

D. To split data into groups based on simple questions for classification

Solution

1. Step 1: Understand the role of decision trees

   Decision tree classifiers split data by asking simple yes/no questions to separate data into classes.

2. Step 2: Compare options with the purpose

   Only To split data into groups based on simple questions for classification describes splitting data for classification, which is the main use of decision trees.

3. Final Answer:

   To split data into groups based on simple questions for classification -> Option D

4. Quick Check:

   Decision tree purpose = classification by splitting [OK]

Hint: Decision trees split data step-by-step for classification [OK]

Common Mistakes:

• Confusing decision trees with random number generators
• Thinking decision trees store data like databases
• Assuming decision trees perform complex math calculations

2. Which of the following is the correct way to create a Decision Tree Classifier in Python using scikit-learn?

easy

A. from sklearn.tree import DecisionTreeClassifier
model = DecisionTreeClassifier()

B. from sklearn.tree import DecisionTree
model = DecisionTree()

C. import DecisionTreeClassifier from sklearn
model = DecisionTreeClassifier()

D. from sklearn.classifier import DecisionTreeClassifier
model = DecisionTreeClassifier()

Solution

1. Step 1: Recall correct import syntax

   The correct import for decision tree classifier is from sklearn.tree import DecisionTreeClassifier.

2. Step 2: Check object creation

   Creating the model with DecisionTreeClassifier() is correct. Other options have wrong imports or class names.

3. Final Answer:

   from sklearn.tree import DecisionTreeClassifier model = DecisionTreeClassifier() -> Option A

4. Quick Check:

   Correct import and class name = from sklearn.tree import DecisionTreeClassifier model = DecisionTreeClassifier() [OK]

Hint: Use sklearn.tree and DecisionTreeClassifier() to create model [OK]

Common Mistakes:

• Using wrong import paths like sklearn.classifier
• Misspelling class name as DecisionTree
• Incorrect import syntax like import DecisionTreeClassifier from sklearn

3. Given the following code, what will be the predicted class for the input X_test = [[5, 3]]?

from sklearn.tree import DecisionTreeClassifier
X_train = [[2, 3], [10, 15], [6, 8], [1, 1]]
y_train = [0, 1, 1, 0]
model = DecisionTreeClassifier(max_depth=2)
model.fit(X_train, y_train)
print(model.predict(X_test))

medium

A. [0]

B. [1]

C. [2]

D. Error: max_depth must be greater than 2

Solution

1. Step 1: Understand training data and labels

   Training data has points labeled 0 or 1. Points near [5,3] are closer to class 1 points like [6,8].

2. Step 2: Predict with trained model

   The decision tree with max_depth=2 will classify [5,3] as class 1 based on training data proximity.

3. Final Answer:

   [1] -> Option B

4. Quick Check:

   Prediction for [5,3] = [1] [OK]

Hint: Check nearest training points to predict class [OK]

Common Mistakes:

• Assuming max_depth=2 causes error
• Predicting class 2 which does not exist
• Ignoring training labels when predicting

4. What is wrong with this code snippet for training a Decision Tree Classifier?

from sklearn.tree import DecisionTreeClassifier
model = DecisionTreeClassifier(max_depth=-1)
model.fit(X_train, y_train)

medium

A. X_train and y_train are not defined

B. DecisionTreeClassifier does not have max_depth parameter

C. max_depth cannot be negative; it should be null or positive

D. fit() method requires extra parameters

Solution

1. Step 1: Check max_depth parameter validity

   max_depth must be null or a positive integer. Negative values are invalid and cause errors.

2. Step 2: Verify other code parts

   Assuming X_train and y_train are defined, and fit() requires only these two parameters, the main error is max_depth.

3. Final Answer:

   max_depth cannot be negative; it should be null or positive -> Option C

4. Quick Check:

   max_depth negative = error [OK]

Hint: max_depth must be positive or null, never negative [OK]

Common Mistakes:

• Thinking max_depth can be negative
• Assuming fit() needs more parameters
• Confusing parameter names

5. You want to avoid overfitting in a Decision Tree Classifier trained on a noisy dataset. Which approach is best to control this?

hard

A. Limit the tree depth using the max_depth parameter

B. Increase the number of features used for splitting

C. Train the tree without any depth limit

D. Use a decision tree without pruning

Solution

1. Step 1: Understand overfitting in decision trees

   Overfitting happens when the tree is too deep and fits noise instead of general patterns.

2. Step 2: Choose method to reduce overfitting

   Limiting max_depth controls tree size and prevents overfitting. Increasing features or no pruning can worsen it.

3. Final Answer:

   Limit the tree depth using the max_depth parameter -> Option A

4. Quick Check:

   Control overfitting = limit max_depth [OK]

Hint: Limit tree depth to prevent overfitting [OK]

Common Mistakes:

• Thinking more features reduce overfitting
• Believing no depth limit is better
• Ignoring pruning or depth control