![]() |
Volumn 32, Issue 1, 2002, Pages 21-31
|
Maximal prime subgraph decomposition of bayesian networks
|
Author keywords
Bayesian networks; Divide and conquer triangulation; Graph decomposition; Hybrid propagation; Incremental compilation; Junction tree representation; LAZY propagation
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
GRAPH THEORY;
MARKOV PROCESSES;
SET THEORY;
THEOREM PROVING;
BAYESIAN NETWORKS;
DIVIDE AND CONQUER TRIANGULATION;
HYBRID PROPAGATION;
INCREMENTAL COMPILATION;
JUNCTION TREE REPRESENTATION;
MAXIMAL PRIME SUBGRAPH DECOMPOSITION;
PROBABILITY;
|
EID: 0036465639
PISSN: 10834419
EISSN: None
Source Type: Journal
DOI: 10.1109/3477.979956 Document Type: Article |
Times cited : (61)
|
References (19)
|