arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1301.0609cs.AI
收藏

贝叶斯网络推理中函数依赖性的利用

Exploiting Functional Dependence in Bayesian Network Inference

Aalborg University(奥尔堡大学)

Jirka Vomlel

摘要:

提出了一种有效的函数依赖模型的贝叶斯网络推理方法。本文推广了Takikawa和D Ambrosio(1999)为因果影响独立模型设计的乘性因子分解方法,通过引入隐变量,将概率势变换为二维的势的乘积.例如,在连接树传播中,它有助于避免大的集团。为了使势函数保持较小,隐变量的状态数应最小化.本文将此问题转化为一个在特定空间中的最小基组合问题.本文给出了一个计算机自适应测验的例子,其中因式分解方法比以往的推理方法有明显的效率.

英文摘要:

We propose an efficient method for Bayesian network inference in models with functional dependence. We generalize the multiplicative factorization method originally designed by Takikawa and D Ambrosio(1999) FOR models WITH independence OF causal influence.Using a hidden variable, we transform a probability potential INTO a product OF two - dimensional potentials.The multiplicative factorization yields more efficient inference. FOR example, IN junction tree propagation it helps TO avoid large cliques. IN ORDER TO keep potentials small, the number OF states OF the hidden variable should be minimized.We transform this problem INTO a combinatorial problem OF minimal base IN a particular space.We present an example OF a computerized adaptive test, IN which the factorization method IS significantly more efficient than previous inference methods.

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

↑