Weighted decision trees where the cost of a test depends on its outcome

Matthew J. Bennett

Applied Stochastic Models and Data Analysis, 1987, vol. 3, issue 4, 257-273

Abstract: The problem of choosing strategies which minimize the cost of decision tree testing is considered in the case where the cost of each test depends on its outcome. The classical entropy bound on the cost is derived and we propose an algorithm for decision tree design based on an extension of Huffman's construction. By comparing the mean costs for a large sample of randomly chosen situations, we show that this algorithm performs well compared with a number of previously published algorithms. The algorithms are also compared with optimal performance for a range of simple cases.

Date: 1987
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asm.3150030407

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:apsmda:v:3:y:1987:i:4:p:257-273

Access Statistics for this article

More articles in Applied Stochastic Models and Data Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().