Approximate belief updating in max-2-connected Bayes networks is NP-hard

Erez Karpas; Solomon Eyal Shimony; Amos Beimel

doi:10.1016/j.artint.2009.04.001

Approximate belief updating in max-2-connected Bayes networks is NP-hard

Erez Karpas, Solomon Eyal Shimony, Amos Beimel

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English
Pages (from-to)	1150-1153
Number of pages	4
Journal	Artificial Intelligence
Volume	173
Issue number	12-13
DOIs	https://doi.org/10.1016/j.artint.2009.04.001
State	Published - 1 Aug 2009

Keywords

Bayes network
Complexity
Max-k-connected

ASJC Scopus subject areas

Language and Linguistics
Linguistics and Language
Artificial Intelligence

Access to Document

10.1016/j.artint.2009.04.001

Cite this

@article{4ec96d70ad224b30922d00d2ea008340,

title = "Approximate belief updating in max-2-connected Bayes networks is NP-hard",

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 = "Bayes network, Complexity, Max-k-connected",

author = "Erez Karpas and Shimony, \{Solomon Eyal\} and Amos Beimel",

year = "2009",

month = aug,

day = "1",

doi = "10.1016/j.artint.2009.04.001",

language = "English",

volume = "173",

pages = "1150--1153",

journal = "Artificial Intelligence",

issn = "0004-3702",

publisher = "Elsevier B.V.",

number = "12-13",

}

TY - JOUR

T1 - Approximate belief updating in max-2-connected Bayes networks is NP-hard

AU - Karpas, Erez

AU - Shimony, Solomon Eyal

AU - Beimel, Amos

PY - 2009/8/1

Y1 - 2009/8/1

N2 - 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.

AB - 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.

KW - Bayes network

KW - Complexity

KW - Max-k-connected

UR - https://www.scopus.com/pages/publications/67449116309

U2 - 10.1016/j.artint.2009.04.001

DO - 10.1016/j.artint.2009.04.001

M3 - Article

AN - SCOPUS:67449116309

SN - 0004-3702

VL - 173

SP - 1150

EP - 1153

JO - Artificial Intelligence

JF - Artificial Intelligence

IS - 12-13

ER -

Approximate belief updating in max-2-connected Bayes networks is NP-hard

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this