1991
DOI: 10.1016/0004-3702(91)90091-w
|View full text |Cite
|
Sign up to set email alerts
|

Initialization for the method of conditioning in Bayesian belief networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

1991
1991
2022
2022

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 22 publications
(9 citation statements)
references
References 3 publications
0
9
0
Order By: Relevance
“…only one path should exist between any two nodes. Otherwise the network is considered to have loops and various methods exist in the literature for handling them (Suermondt andCooper 1991, Pearl 1988). …”
Section: Bayesian Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…only one path should exist between any two nodes. Otherwise the network is considered to have loops and various methods exist in the literature for handling them (Suermondt andCooper 1991, Pearl 1988). …”
Section: Bayesian Networkmentioning
confidence: 99%
“…In our network there are two paths between S Dand D and in order to handle the loop we used the method of conditioning(reasoning by assumptions) which is based on the ability to change the connectivity of a network and render it singly connected by instantiating a selected group of variables (Suermondt andCooper 1991, Pearl 1988). …”
Section: Problem Formulationmentioning
confidence: 99%
“…In the process, we worked out many of . the technical details that previously were unspecified [22]. In particular, we examined cutset conditioning on multiply-connected networks.…”
Section: Studying and Extending Cutset Conditioningmentioning
confidence: 99%
“…Exact algorithms have explored Expression (1) to order operations efficiently [24,45], sometimes using auxiliary junction trees [15,42]. A few algorithms exploit conditioning operations [51,57] that reduce inference to manipulation of polytrees. These conditioning algorithms employ loop cutsets: a loop cutset is a set of edges that, once removed, leaves the underlying undirected graph as a tree [51].…”
Section: Introductionmentioning
confidence: 99%