A note on computing the asymptotic form of a limited sequence of decision trees
type: Item
instance of: scholarly article
title: A note on computing the asymptotic form of a limited sequence of decision trees
zbMATH Open document ID: 0585.68074
DOI: 10.1016/0020-0255(82)90048-2
author: Nicholas V. Findler
author: Neal Mazur
author: Bede McCall
published in: Information Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 62C99
zbMATH DE Number: 3938589
zbMATH Keywords: multistage decision processes
zbMATH Keywords: learning strategy
zbMATH Keywords: quasi-optimizier
zbMATH Keywords: algorithm
zbMATH Keywords: asymptotic decision tree
zbMATH Keywords: breadth-first order
MaRDI profile type: Publication
full work available at URL: 0020-0255(82)90048-2
OpenAlex ID: W2070996668
cites work: On the complexity of decision trees, the quasi-optimizer, and the power of heuristic rules
description: scientific article; zbMATH DE number 3938589