Up to now, the decision tree method is used to find the optimal solution of a Bayesian decision problem, that is, to select an optimal one from several decision alternatives.
决策树方法一直被用于贝叶斯决策问题的最优方案选择，即从若干决策方案中选择一个最优方案。
It is difficult to use the decision tree method to find the sub-optimal solution, not to mention the alternative ranking.
利用传统的决策树方法，无法确定一个次优方案，对所有方案进行排序也很难。
We can use dynamic programming on the tree decomposition to find an optimal solution in linear time.
我们可以使用树分解的动态规划在线性时间内找到最优解。
应用推荐