| 动态贝叶斯网精确推理中联合树算法的改进 |
| |
| 引用本文： | 周本达,赵建中.动态贝叶斯网精确推理中联合树算法的改进[J].合肥工业大学学报(自然科学版),2006,29(10):1330-1334. |
| |
| 作者姓名： | 周本达 赵建中 |
| |
| 作者单位： | 安徽皖西学院,数理系,安徽,六安,237012 |
| |
| 基金项目： | 安徽省教育厅自然科学基金 |
| |
| 摘 要： | 基于动态贝叶斯网络处理动态不确定性问题的过程中推理是非常重要的,而推理算法的优劣决定推理的执行效率;文章在分析联合树性质的基础上提出一种较简单的3/2片联合树算法,该算法不需要限制消去顺序且只作一次扩展;讨论了算法的复杂度,并作了试验比较。
|
| 关 键 词： | 动态贝叶斯网络 联合树 马尔可夫模型 |
| 文章编号： | 1003-5060(2006)10-1330-05 |
| 修稿时间： | 2005年10月17 |
Improvement of the junction tree algorithm for exact inference in dynamic Bayesian networks |
| |
| ZHOU Ben-da,ZHAO Jian-zhong.Improvement of the junction tree algorithm for exact inference in dynamic Bayesian networks[J].Journal of Hefei University of Technology(Natural Science),2006,29(10):1330-1334. |
| |
| Authors: | ZHOU Ben-da ZHAO Jian-zhong |
| |
| Abstract: | In solving the dynamic uncertainty problem based on dynamic Bayesian networks(DBNs),the efficiency of processing is decided by the inference algorithm.In the paper,a 3/2 slice junction tree algorithm is presented in which the elimination order is not limited and constitution of the junction tree is carried out only one time.Comparative analysis shows that it is simpler and has a lower complexity. |
| |
| Keywords: | dynamic Bayesian network junction tree Markov model |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
