arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.4981cs.AI
收藏

求解决策树和博弈树的一种新剪枝方法

A New Pruning Method for Solving Decision Trees and Game Trees

Prakash P. Shenoy

摘要:

本文的主要目标是描述一种新的剪枝方法来求解决策树和博弈树。决策树的修剪方法是决策树的一个微小变体,我们称之为情景树。在场景树中,我们不需要从机会节点发出的每条边的条件概率。相反,我们需要从根结点到叶节点的每条路径的联合概率。我们比较了剪枝方法和传统的回滚方法的决策树和博弈树。对于需要贝叶斯概率修正的问题,使用剪枝方法的情景树表示比使用回滚方法的决策树表示更有效。对于博弈树,剪枝方法比回滚方法更有效。

英文摘要:

The main goal of this paper is to describe a new pruning 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑