Skip to Main Content
The above paper1 provides an automated technique for decision tree design which relies only on a priori statistics. The technique is basically to find a partition of the class set which maximizes the probability of correct classification at a given decision node. To do so, in the above paper1 all the possible partitions are searched exhaustively. In the present comment it is pointed out that the search for the partitions with a size of two is sufficient, and the higher order of partitions need not be searched.