Quiz 3 Flashcards
Decision trees are an algorithm for which machine learning task?
Classification
Root node
decision tree has no incoming edges and zero or more outgoing edges
Internal node
has more than one incoming edge and one or more outgoing edges
Terminal node
has exactly one incoming edge and no outgoing edge
Internal node
denotes a test on a feature
In classification, a model or classifier
constructed to predict class (categorical) labels
Homogeneous class distribution
preferred to determine the best split for decision trees
Methods to look at node Impurity
Gini Index
Information Gain
Gain Ratio
Misclassification Error
What is the minimum and maximum value for entropy?
0,1
What is the minimum and maximum value of GINI?
0,0.5
What is the minimum and maximum value for Misclassification Error?
0,0.5
The process of building a decision tree is recursive. It is built one node at a time and the algorithm is applied at each node the same way.
True
During the process of building a decision tree, at each node, the algorithm decides which attribute to use for a new split based on some criteria evaluated for each possible attribute.
True
During the process of building a decision tree, at each node, we consider the similarities between all the points and take the most similar ones to create the next nodes based on a criteria evaluated at each similar group of data.
False
What are splitting criteria used in decision trees?
GINI index
Information Gain - Entropy
Misclassification Error
Gain Ratio
