A note on computing the asymptotic form of a limited sequence of decision trees

DOI10.1016/0020-0255(82)90048-2zbMath0585.68074OpenAlexW2070996668MaRDI QIDQ1070834

Neal Mazur, Nicholas V. Findler, Bede McCall

Publication date: 1982

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(82)90048-2

zbMATH Keywords

algorithmlearning strategymultistage decision processesasymptotic decision treebreadth-first orderquasi-optimizier

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Statistical decision theory (62C99)

Related Items (1)

A heuristic approach to optimum experimental design

Cites Work

• On the complexity of decision trees, the quasi-optimizer, and the power of heuristic rules

This page was built for publication: A note on computing the asymptotic form of a limited sequence of decision trees