|
Class Summary |
| AIS |
Adaptive importance sampling gets samples by instantiating each node
of the network (using the likelihood of each state given the state of
the parent nodes) in topological order, using the probabilities in
the importance function (which are initially
set equal to the conditional probability tables).
|
| AISEvent |
|
| ChavezMCMC |
Chavez MCMC method |
| ForwardSampling |
Simple Sampling (Whoops, this is actually a forward sampling) |
| LikelihoodWeighting |
Forward sampling with likelihood weighting gets samples by
instantiating each node of the network (using the prior probabilities
of each node as a weight) in topological order. |
| LogicSampling |
Logic sampling gets samples by instantiating each node of the network
(using the likelihood of each state given the state of the parent nodes)
in topological order. |
| MCMC |
Super class for MCMC based approximate inference engine |
| MCMCEvent |
Abstract event class for sampling methods |
| MCMCOptionGUI |
|
| PearlMCMC |
Pearl MCMC method |
| SelfImportance |
Self-importance sampling, much like adaptive importance sampling,
gets samples by instantiating each node of the network (using the
likelihood of each state given the state of the parent nodes)
in topological order, using the probabilities in the importance
function (which are initially set equal to the conditional probability
tables). |