Abstract. One approach to induction is to develop a decision tree from a set of examples. When used with noisy rather than deterministic data, the method involves three main stages -creating a complete tree able to classify all the examples, pruning this tree to give statistical reliability, and processing the pruned tree to improve understandability. This paper is concerned with the first stage -tree creationwhich relies on a measure for "goodness of split," that is, how well the attributes discriminate between classes. Some problems encountered at this stage are missing data and multi-valued attributes. The paper considers a number of different measures and experimentally examines their behavior in four domains. The results show that the choice of measure affects the size of a tree but not its accuracy, which remains the same even when attributes are selected randomly.
REF provides an initial analysis and state that the "choice of measure affects the size of a tree but not its accuracy".
An empirical comparison of selection measures for decision-tree induction
Machine Learning
Machine Learning
Computer Science