摘要
基于动态贝叶斯网络处理动态不确定性问题的过程中推理是非常重要的,而推理算法的优劣决定着推理的执行效率。该文提出一种较简单的112片联合树算法,在不需要限制消去顺序且只作一次扩展的条件下构造联合树,所以算法简单且具有较小的复杂度。
To solve the dynamic uncertainty problem which is based on DBNs,the efficiency of process is decided by inference algorithm.The paper presents a new 1 slices Junction Tree algorithm which don't need elimination order limited and constitute the Junction Tree only one times.So it's more simple and has a lower complexity.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第14期81-84,共4页
Computer Engineering and Applications
基金
安徽省自然科学基金项目(编号:03042305)资助
