Approximate belief updating in max-2-connected Bayes networks is NP-hard |
| |
| Authors: | Erez Karpas Solomon Eyal Shimony Amos Beimel |
| |
| Affiliation: | 1. Faculty of Industrial Engineering, Technion, Haifa, Israel;2. Dept. of Computer Science, Ben-Gurion University, P.O. Box 645, Beer-Sheva, Israel |
| |
| Abstract: | A max-2-connected Bayes network is one where there are at most 2 distinct directed paths between any two nodes. We show that even for this restricted topology, null-evidence belief updating is hard to approximate. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
