AI helps you reading Science
Approximation algorithms for the loop cutset problem
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence, (2013): 60-68
EI
Abstract
We show how to find a small loop cutset in a Bayesian network. Finding such a loop cutset is the first step in the method of conditioning for inference. Our algorithm for finding a loop cutset, called MGA, finds a loop cut-set which is guaranteed in the worst case to contain less than twice the number of variables contained in a minimum l...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn