Consider training a binary decision tree using entropy splits. 1. Prove that the decrease in entropy by a split on a binary yes/no feature can never be greater than 1 bit. 2. Generalize this result to the case of arbitrary multiway branching

See Answer

Add Answer +20 Points

Community Answer

See all the answers with 1 Unlock

Get 4 Free Unlocks by registration

Get 4 Free Unlocks by registration

Entropy= -yes/total log yes/total -no/total log no/totalEntropycannot be greater than 1 because the value yes is less than total.The sum of yes and no is equal to to ... See the full answer