Global Markov assumption: given Markov blanket, a node is independent of other nodes
three canonical structures: sequential, common cause, common effects
tested by: Bayes ball algorithm, moralized graph without irrelevant variables
1) table
2) tree structure
3) noisy-or
4) neural networks
5) generalized linear model for continuous variables
1) prediction
2) abduction
3) explaining away
1) conditional probability,
2) most probable explanation (joint distribution of query variables and evidence)
3) Maximum a posterior (MAP) (conditional distribution of query variables given evidence)
0) Naïve enumeration
1) variable elimination
2) belief propagation
3) Junction tree algorithm
1) direct sampling methods
2) rejection sampling methods
3) likelihood sampling methods
4) importance sampling methods
5) Gibbs sampling
6) Metropolis sampling
7) Markov chain
1) search-and-score-based methods
maximum likelihood, Bayesian information criterion, BDe score
2) constraint-based methods
IC-algorithm, CI-algorithm, PC-algorithm
3) Bayesian model averaging
1) Sprinkler network
2) Burglar & Earthquake & alarm network
3)
4) Alarm Network
5) QMR_DT
6) CPC network
Back to home last updated: 09/18/2007 © Copyright 2007