|
| TreeEP () |
| Default constructor. More...
|
|
| TreeEP (const TreeEP &x) |
| Copy constructor. More...
|
|
TreeEP & | operator= (const TreeEP &x) |
| Assignment operator. More...
|
|
| TreeEP (const FactorGraph &fg, const PropertySet &opts) |
| Construct from FactorGraph fg and PropertySet opts. More...
|
|
|
virtual TreeEP * | clone () const |
| Returns a pointer to a new, cloned copy of *this (i.e., virtual copy constructor) More...
|
|
virtual TreeEP * | construct (const FactorGraph &fg, const PropertySet &opts) const |
| Returns a pointer to a newly constructed inference algorithm. More...
|
|
virtual std::string | name () const |
| Returns the name of the algorithm. More...
|
|
virtual Real | logZ () const |
| Returns the logarithm of the (approximated) partition sum (normalizing constant of the factor graph). More...
|
|
virtual void | init () |
| Initializes all data structures of the approximate inference algorithm. More...
|
|
virtual void | init (const VarSet &) |
| Initializes all data structures corresponding to some set of variables. More...
|
|
virtual Real | run () |
| Runs the approximate inference algorithm. More...
|
|
virtual Real | maxDiff () const |
| Returns maximum difference between single variable beliefs in the last iteration. More...
|
|
virtual size_t | Iterations () const |
| Returns number of iterations done (one iteration passes over the complete factorgraph). More...
|
|
virtual void | setMaxIter (size_t maxiter) |
| Sets maximum number of iterations (one iteration passes over the complete factorgraph). More...
|
|
virtual void | setProperties (const PropertySet &opts) |
| Set parameters of this inference algorithm. More...
|
|
virtual PropertySet | getProperties () const |
| Returns parameters of this inference algorithm converted into a PropertySet. More...
|
|
virtual std::string | printProperties () const |
| Returns parameters of this inference algorithm formatted as a string in the format "[key1=val1,key2=val2,...,keyn=valn]". More...
|
|
| JTree () |
| Default constructor. More...
|
|
| JTree (const FactorGraph &fg, const PropertySet &opts, bool automatic=true) |
| Construct from FactorGraph fg and PropertySet opts. More...
|
|
virtual Factor | belief (const VarSet &vs) const |
| Returns the (approximate) marginal probability distribution of a set of variables. More...
|
|
virtual std::vector< Factor > | beliefs () const |
| Returns all beliefs (approximate marginal probability distributions) calculated by the algorithm. More...
|
|
std::vector< size_t > | findMaximum () const |
|
void | construct (const FactorGraph &fg, const std::vector< VarSet > &cl, bool verify=false) |
| Constructs a junction tree based on the cliques cl (corresponding to some elimination sequence). More...
|
|
void | GenerateJT (const FactorGraph &fg, const std::vector< VarSet > &cl) |
| Constructs a junction tree based on the cliques cl (corresponding to some elimination sequence). More...
|
|
const Factor & | message (size_t alpha, size_t _beta) const |
| Returns constant reference to the message from outer region alpha to its _beta 'th neighboring inner region. More...
|
|
Factor & | message (size_t alpha, size_t _beta) |
| Returns reference to the message from outer region alpha to its _beta 'th neighboring inner region. More...
|
|
void | runHUGIN () |
| Runs junction tree algorithm using HUGIN (message-free) updates. More...
|
|
void | runShaferShenoy () |
| Runs junction tree algorithm using Shafer-Shenoy updates. More...
|
|
size_t | findEfficientTree (const VarSet &vs, RootedTree &Tree, size_t PreviousRoot=(size_t)-1) const |
| Finds an efficient subtree for calculating the marginal of the variables in vs. More...
|
|
Factor | calcMarginal (const VarSet &vs) |
| Calculates the marginal of a set of variables (using cutset conditioning, if necessary) More...
|
|
| DAIAlg () |
| Default constructor. More...
|
|
| DAIAlg (const GRM &grm) |
| Construct from GRM. More...
|
|
FactorGraph & | fg () |
| Returns reference to underlying FactorGraph. More...
|
|
const FactorGraph & | fg () const |
| Returns constant reference to underlying FactorGraph. More...
|
|
void | clamp (size_t i, size_t x, bool backup=false) |
| Clamp variable with index i to value x (i.e. multiply with a Kronecker delta ) More...
|
|
void | makeCavity (size_t i, bool backup=false) |
| Sets all factors interacting with variable with index i to one. More...
|
|
void | makeRegionCavity (std::vector< size_t > facInds, bool backup) |
| Sets all factors indicated by facInds to one. More...
|
|
void | backupFactor (size_t I) |
| Make a backup copy of factor I. More...
|
|
void | backupFactors (const VarSet &vs) |
| Make backup copies of all factors involving the variables in vs. More...
|
|
void | restoreFactor (size_t I) |
| Restore factor I from its backup copy. More...
|
|
void | restoreFactors (const VarSet &vs) |
| Restore the factors involving the variables in vs from their backup copies. More...
|
|
void | restoreFactors () |
| Restore all factors from their backup copies. More...
|
|
virtual | ~InfAlg () |
| Virtual destructor (needed because this class contains virtual functions) More...
|
|
virtual std::string | identify () const |
| Identifies itself for logging purposes. More...
|
|
virtual Factor | belief (const Var &v) const |
| Returns the (approximate) marginal probability distribution of a variable. More...
|
|
virtual Factor | beliefV (size_t i) const |
| Returns the (approximate) marginal probability distribution of the variable with index i. More...
|
|
virtual Factor | beliefF (size_t I) const |
| Returns the (approximate) marginal probability distribution of the variables on which factor I depends. More...
|
|
Approximate inference algorithm "Tree Expectation Propagation" [MiQ04].