作业帮英语翻译2.3.3 Approximate Probabilistic Inference近似?概率推理For those graphical models with dense connections,the Junction Tree algorithmusually in-dacesan intractable tree with large tree-width.For random field models,the partition func-
来源：学生作业帮助网 编辑：作业帮 时间：2024/10/04 21:02:26
英语翻译2.3.3 Approximate Probabilistic Inference近似?概率推理For those graphical models with dense connections,the Junction Tree algorithmusually in-dacesan intractable tree with large tree-width.For random field models,the partition func-
英语翻译
2.3.3 Approximate Probabilistic Inference
近似?概率推理
For those graphical models with dense connections,the Junction Tree algorithmusually in-
dacesan intractable tree with large tree-width.For random field models,the partition func-
tionsin their distributions usually are also intractable in computation.Thus wehave to resort
toapproximate approaches.There are two primary approaches in the literature:variational
approximationand sampling-based approximation.
以上手打的 可能有错误 图片为准
英语翻译2.3.3 Approximate Probabilistic Inference近似?概率推理For those graphical models with dense connections,the Junction Tree algorithmusually in-dacesan intractable tree with large tree-width.For random field models,the partition func-
近似概率推理
对于那些带有密集连接的图形模型,联合树算法通常引出一个带有巨大树冠的棘手的树结果.对于随机场模型,在其分布的分区功能通常在计算上也是颇为棘手的.因此我们不得不借助近似方法.文献中介绍了两种主要方法：变分近似法和抽样近似法.