Information gain measures how much uncertainty a split removes. In a decision tree, it is the entropy before a candidate split minus the entropy remaining afterward; the tree favors splits with greater gain. section 5.3.1
A split with 1.00 bit of initial entropy and 0.80 bits of weighted remaining entropy removes 0.20 bits of uncertainty. section 5.3.1






