Question: Q7. Consider a decision tree to classify a dataset into 2 classes A and B. Suppose that at a given level, the classes in one

Q7. Consider a decision tree to classify a dataset into 2 classes A and B. Suppose that at a given level, the classes in one inner node are AABBB. Qualitatively, does this represent a relatively low or relatively high entropy? Write down the expression representing the entropy at this inner node. (If you have a logarithmic expression (e.g. log3) you do not need to simplify it any further) Q7. Consider a decision tree to classify a dataset into 2 classes A and B. Suppose that at a given level, the classes in one inner node are AABBB. Qualitatively, does this represent a relatively low or relatively high entropy? Write down the expression representing the entropy at this inner node. (If you have a logarithmic expression (e.g. log3) you do not need to simplify it any further)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
