A New Pruning Method for Solving Decision Trees and Game Trees

View/ Open
Issue Date
1995-08Author
Shenoy, Prakash P.
Publisher
Morgan Kaufmann Publishers
Format
145991 bytes
Type
Book chapter
Metadata
Show full item recordAbstract
The main goal of this paper is to describe a newpruning method for solving decision trees and game trees. The pruning method for decision trees suggests a slight variant of decision trees that we call scenario trees. In scenario trees, we do not need a conditional probability for each edge emanating from a chance node. Instead, we require a joint probability for each path from the root node to a leaf node. We compare the pruning method to the traditional rollback method for decision trees and game trees. For problems that require Bayesian revision of probabilities, a scenario tree representation with the pruning method is more efficient than a decision tree representation with the rollback method. For game trees, the pruning method is more efficient than the rollback method.
ISBN
1-55860-385-9Collections
Citation
Shenoy, P. P., "A New Pruning Method for Solving Decision Trees and Game Trees," in P. Besnard and S. Hanks (eds.), Uncertainty in Artificial Intelligence, Vol. 11, 1995, pp. 482--490, Morgan Kaufmann, San Francisco, CA.
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.