Publication: A novel approach to cutting decision trees
Üney Yüksektepe, Fadime
Springer, 233 Spring Street, New York, Ny 10013, United States
In data mining, binary classification has a wide range of applications. Cutting Decision Tree (CDT) induction is an efficient mathematical programming based method that tries to discretize the data set on hand by using multiple separating hyperplanes. A new improvement to CDT model is proposed in this study by incorporating the second goal of maximizing the distance of the correctly classified instances to the misclassification region. Computational results show that developed model achieves better classification accuracy for Wisconsin Breast Cancer database and Japanese Banks data set when compared to existing piecewise-linear models in literature. Furthermore, remarkable results are obtained for the well-known benchmarking data sets (Buba Liver Disorders, Blood Tranfusion and Pima Indian Diabetes) when compared to the original CDT model.
Discriminant analysis, Mathematical programming, Data mining, Decision trees, Piecewise-linear models, Mathematical-Programming Models, Linear Discriminant-Analysis, Classification Problem