Decision tree induction is the learning of decision trees from class-labelled training examples.
A decision-tree is a flow-chart like tree structure, where each internal node denotes a test on an attribute, each branch represents an outcome of the ...See more
test and each leaf node holds a class label.
ID3, C4.5 and CART adopt a greedy(nonbacktracking) approach in which decision trees are constructed in a top-down recursive divide-and-conquer manner.
Answer the Question