Skip to main content
Conference ProceedingsOPEN ACCESS

Averaging over decision stumps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 784 LNCS 231-241
DOI: 10.1007/3-540-57868-4_61
22Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we examine a minimum encoding approach to the inference of decision stumps. We then examine averaging over decision stumps as a method of generating probability estimates at the leaves of decision trees.

Cite

CITATION STYLE

APA

Oliver, J. J., & Hand, D. (1994). Averaging over decision stumps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 784 LNCS, pp. 231–241). Springer Verlag. https://doi.org/10.1007/3-540-57868-4_61

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