An extended depth-first search algorithm for optimal triangulation of Bayesian networks

详细信息    查看全文

• 作者：Chao Li ; ^{chao.li.314@gmail.com} ; Maomi Ueno
• 关键词：Bayesian network ; Probabilistic inference ; Optimal triangulation ; Dynamic clique maintenance
• 刊名：International Journal of Approximate Reasoning
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：80
• 期：Complete
• 页码：294-312
• 全文大小：1419 K
• 卷排序：80

文摘

A state-of-the-art algorithm for optimal triangulation is proposed. Evaluated the degree of impact for employing the total table size as optimality criterion. A novel pruning rule for triangulation algorithm is proposed. A fast dynamic clique maintenance algorithm is proposed.