作者
Dan Wu, Cory Butz
发表日期
2005
研讨会论文
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing: 10th International Conference, RSFDGrC 2005, Regina, Canada, August 31-September 3, 2005, Proceedings, Part I 10
页码范围
581-590
出版商
Springer Berlin Heidelberg
简介
In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks, which conventionally are believed to have efficient inference algorithms, the computational complexity is still NP-hard.
学术搜索中的文章
D Wu, C Butz - Rough Sets, Fuzzy Sets, Data Mining, and Granular …, 2005