Question: Prove that a decision list can represent the same function as a decision tree while using at most as many rules as there are leaves
Prove that a decision list can represent the same function as a decision tree while using at most as many rules as there are leaves in the decision tree for that function. Give an example of a function represented by a decision list using strictly fewer rules than the number of leaves in a minimal-sized decision tree for that same function.
Step by Step Solution
3.47 Rating (170 Votes )
There are 3 Steps involved in it
Proof sketch Each path from the root to a leaf in a decision tree represents a logical conjunction ... View full answer
Get step-by-step solutions from verified subject matter experts
