DECISION TREE Flashcards
what is decision tree?
a decision tree is a non-parametric supervised learning algo for classification and regression tasks
it contains questions organized hierarchically in the shape of a tree
what are the questions usually called?
test, split and condition
what does a decision tree consists of?
root node
branches
internal nodes
leaf nodes
decision node
sub tree
parent and child node
what is a root node?
initial or the starting node of a decision tree from where the entire dataset starts dividing based on various conditions
what are decision node?
nodes resulting from the splitting of the root node
what are leaf node?
nodes where further splitting is not possible indicating the final classification or outcome
which nodes indicate the final outcome
leaf nodes
leaf nodes are referred as?
terminal node
what is a sub tree
a sub-section of a decision tree is referred to as a sub-tree. It represents a specific portion of the decision tree.
what is parent node
node that is divided into sub nodes
what is child node
nodes emerging from a parent node
what does parent node represent
?
a decision or a condition
what does a child node represent?
outcomes or further decision
what is pruning
the process of removing specific nodes from the decision tree to prevent overfitting and simplify the model.
what is inference path
inference of a decision tree is calculated from the root to one of the leaf nodes according to the conditions.
The value of the reached leaf is the tree’s prediction
the set of visited node is called inference path
