Decision Tree for Regression

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/9

flashcard set

Earn XP

Description and Tags

These flashcards cover key concepts related to decision tree regressors, including metrics for evaluating performance.

Last updated 6:50 AM on 4/28/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

10 Terms

1
New cards

Decision tree regressor

A decision tree used for regression tasks that divides input feature space using inequalities.

2
New cards

Leaf

A terminal node in a decision tree where the predicted value is computed from training instances.

3
New cards

Mean Squared Error (MSE)

A common measure of the average squared difference between predicted and actual values.

4
New cards

Mean Absolute Error (MAE)

A metric that measures the average magnitude of errors between predicted and actual values, without considering their direction.

5
New cards

Friedman's Improvement (FI)

A measure used to evaluate the performance of a decision tree regression model, comparing the differences in predictions.

6
New cards

Cost Complexity Pruning

A technique used in decision trees to remove nodes that do not significantly improve the model's performance.

7
New cards

Error estimate

An assessment of the accuracy of a model based on its predictions compared to actual values.

8
New cards

Performance evaluation

The process of assessing how well a decision tree regressor performs using metrics like MSE and MAE.

9
New cards

Subtree

A section of a decision tree that can be analyzed separately.

10
New cards

Cost complexity formula

Rx(T) = R(T) + alpha * |T|, where R(T) is the error estimate of the tree and |T| is the number of leaves.