Consider a decision stump. The information gain for the question at the parent is **zero**. If the
entropy of the left-child is equal to the entropy of the parent, what is the entropy of the right
child? Assume that each child has at least one data-point in it and that the entropy of the parent is
non-zero.
A.
The entropy of the right-child is equal to half the entropy of the left-child.
B.
The entropy of the right-child is equal to twice the entropy of the left-child.
C.
The entropy of the right-child is equal to the entropy of the parent.
D.
The entropy of the right-child is the sum of the entropies of the parent and the
left-child.
A published solution is not available for this question yet.
If the performance of each estimator in the bagging algorithm is almost
identical, the benefit of using bagging to combine them may be minimal or insignificant.
B.
Weak learners have low bias and high variance.
C.
In random forests, multiple decision trees (estimators) are trained
simultaneously, allowing for parallel processing and faster model training.
D.
In the random forest algorithm, multiple decision trees are trained on the
same dataset to create an ensemble model.
A published solution is not available for this question yet.
Based on the above data, answer the given subquestions.
What weight will be assigned to the point [1, 1]T when training the second decision stump,
assuming the weights are not normalized to add up to one? Please enter your answer rounded to
two decimal places.
A published solution is not available for this question yet.