Investigation and reduction of discretization variance in decision tree induction

19Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper focuses on the variance introduced by the discretization techniques used to handle continuous attributes in decision tree induction. Different discretization procedures are first studied empirically, then means to reduce the discretization variance are proposed. The experiment shows that discretization variance is large and that it is possible to reduce it significantly without notable computational costs. The resulting variance reduction mainly improves interpretability and stability of decision trees, and marginally their accuracy.

Cite

CITATION STYLE

APA

Geurts, P., & Wehenkel, L. (2000). Investigation and reduction of discretization variance in decision tree induction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1810, pp. 162–170). Springer Verlag. https://doi.org/10.1007/3-540-45164-1_17

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