Dealing with Missing Values in a Probabilistic Decision Tree during Classification

This paper deals with the problem of missing values in decision trees during classification. Our approach is derived from the ordered attribute trees method, proposed by Lobo and Numao in 2000, which builds a decision tree for each attribute and uses these trees to fill the missing attribute values. Our method takes into account the dependence between attributes by using mutual information. The result of the classification process is a probability distribution instead of a single class. In this paper, we present tests performed on several databases using our approach and Quinlan´s method. We also measure the quality of our classification results. Finally, we discuss some perspectives