Speeding up Logistic Model Tree induction

229Citations
Citations of this article
126Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Logistic Model Trees have been shown to be very accurate and compact classifiers [8]. Their greatest disadvantage is the computational complexity of inducing the logistic regression models in the tree. We address this issue by using the AIC criterion [1] instead of cross-validation to prevent overfitting these models. In addition, a weight trimming heuristic is used which produces a significant speedup. We compare the training time and accuracy of the new induction process with the original one on various datasets and show that the training time often decreases while the classification accuracy diminishes only slightly. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Sumner, M., Frank, E., & Hall, M. (2005). Speeding up Logistic Model Tree induction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3721 LNAI, pp. 675–683). https://doi.org/10.1007/11564126_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free