Consider a two-category problem and the following training patterns, each having four binary attributes:
a b
0110 1011
1010 0000
0011 0100
1111 1110
(a) Use the entropy to create, by hand, an unpruned classifier for these data.
(b) Apply simple logical reduction methods to your tree in order to express each category by the simplest logical expression, that is, with the fewest ANDs and ORs.