.png){kind=icon}
返回
Using hidden nodes in Bayesian networks
.png){kind=icon}
OA
AI
DOI：10.1016/0004-3702(95)00119-0.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the construction of a Bayesian network, it is always assumed that the variables starting from the same parent are conditionally independent. In practice, this assumption may not hold, and will give rise to incorrect inferences. In cases where some dependency is found between variables, we propose that the creation of a hidden node, which in effect models the dependency, can solve the problem. In order to determine the conditional probability matrices for the hidden node, we use a gradient descent method. The objective function to be minimised is the squared-error between the measured and computed values of the instantiated nodes. Both forward and backward propagation are used to compute the node probabilities. The error gradients can be treated as updating messages and can be propagated in any direction throughout any singly connected network. We used the simplest node-by-node creation approach for parents with more than two children. We tested our approach on two different networks in an endoscope guidance system and, in both cases, demonstrated improved results.
Keyword:
EXPERT-SYSTEMS
EM ALGORITHM
PROBABILITIES
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏Investigation of Supporting Electrolyte Effect on Supercapacitor Properties of Poly(Carbazole) Films
OAAI
OAAI分享收藏
查看更多内容