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

DOI10.1016/0020-0255(82)90048-2MaRDI QIDQ1070834zbMATH OpenOpenAlexFDO

Authors Nicholas V. Findler, Neal Mazur, 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

algorithmasymptotic decision treebreadth-first orderlearning strategymultistage decision processesquasi-optimizier

Mathematics Subject Classification ID

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

Recommendations

• Optimum decision trees - an optimal variable theorem and its related applications
• Criteria for selecting a variable in the construction of efficient decision trees
• Decision trees based on 1-consequences
• Asymptotic properties of level-regular decision trees with randomly evaluated leaves
• On Optimization of Decision Trees

Cites work

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

Cited in

(1)

• A heuristic approach to optimum experimental design

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1070834)