英语翻译The general framework for inference ingraphical model is the Junction Tree algorithm [32].The general Junction Tree algorithm mainlyconsists of constructing a junction tree from themodel and propagating probabilities acrossthe tree.The ef

来源:学生作业帮助网 编辑:作业帮 时间:2024/04/30 11:05:42

英语翻译The general framework for inference ingraphical model is the Junction Tree algorithm [32].The general Junction Tree algorithm mainlyconsists of constructing a junction tree from themodel and propagating probabilities acrossthe tree.The ef
英语翻译

The general framework for inference ingraphical model is the Junction Tree algorithm [32].
The general Junction Tree algorithm mainlyconsists of constructing a junction tree from the
model and propagating probabilities acrossthe tree.The efficiency of the Junction Tree al-
gorithm depends on the underlying graphstructure.It is well known that the algorithm is
computationally practical only for graphswith small tree-width (size of clique).
手打的可以能有错误 图片为准

英语翻译The general framework for inference ingraphical model is the Junction Tree algorithm [32].The general Junction Tree algorithm mainlyconsists of constructing a junction tree from themodel and propagating probabilities acrossthe tree.The ef
说明:方括号中的数字是参考文献的顺序号,在正式整理成文时要设置成上标,这里无法示范.
用于在图形模型中进行推断的一般框架是联合树算法[32].一般的联合树算法主要包括从模型构建一棵联合树,并且跨树来传播跨概率.联合树算法的效率取决于底层图形的结构.众所周知,该算法在计算上只对树的宽度(团的大小)较小的图形是实际可行的.

The general framework for inference ingraphical model is the Junction Tree algorithm [32].
推理ingraphical模型的一般框架是联合树算法[ 32 ]。
The general Junction Tree algorithm mainlyconsists of constructing ...

全部展开

The general framework for inference ingraphical model is the Junction Tree algorithm [32].
推理ingraphical模型的一般框架是联合树算法[ 32 ]。
The general Junction Tree algorithm mainlyconsists of constructing a junction tree from the
一般连接树算法主要由从构造一个连接树
model and propagating probabilities acrossthe tree. The efficiency of the Junction Tree al-
模型和传播的概率在树。的交界处树效率铝—
gorithm depends on the underlying graphstructure. It is well known that the algorithm is
算法依赖于底层graphstructure。这是众所周知的算法
computationally practical only for graphswith small tree-width (size of clique).
只有graphswith小的树宽计算实用(尺寸的团)。

收起