The algorithm to compute probability of specified evidence in a dependent universe.
The algorithm to compute probability of specified evidence in a dependent universe. We use () => Double to represent this algorithm instead of an instance of ProbEvidenceAlgorithm. Typical usage is to return the result of ProbEvidenceAlgorithm.computeProbEvidence when invoked.
A list of universes that depend on this universe such that evidence on those universes should be taken into account in this universe.
A list of universes that depend on this universe such that evidence on those universes should be taken into account in this universe.
All implementation of variable elimination must specify what to do after variables have been eliminated.
All implementations of factored algorithms must specify a way to get the factors from the given universe and dependent universes.
All implementations of factored algorithms must specify a way to get the factors from the given universe and dependent universes.
The sum, product operations on the factor types and appropriate values for zero and one must be defined.
The sum, product operations on the factor types and appropriate values for zero and one must be defined.
Flag indicating whether the run time of each step should be displayed.
Target elements that should not be eliminated but should be available for querying.
The universe on which this variable elimination algorithm should be applied.
The universe on which this variable elimination algorithm should be applied.
Called when the algorithm is killed.
Called when the algorithm is killed. By default, does nothing. Can be overridden.
Some variable elimination algorithms, such as computing the most probable explanation, record values of variables as they are eliminated.
Some variable elimination algorithms, such as computing the most probable explanation, record values of variables as they are eliminated. Such values are stored in a factor that maps values of the other variables to a value of the eliminated variable. This factor is produced by finding the value of the variable that "maximizes" the entry associated with the value in the product factor resulting from eliminating this variable, for some maximization function. The recordingFunction determines which of two entries is greater according to the maximization function. It returns true iff the second entry is greater. The recording function is an option so that variable elimination algorithms that do not use it can ignore it.
By default, implementations that inherit this trait have no debug information.
By default, implementations that inherit this trait have no debug information. Override this if you want a debugging option.
Method for choosing the elimination order.
Method for choosing the elimination order. The default order chooses first the variable that minimizes the number of extra factor entries that would be created when it is eliminated. Override this method if you want a different rule.
Get the elements that are needed by the query target variables and the evidence variables.
Get the elements that are needed by the query target variables and the evidence variables. Also compute the values of those variables to the given depth. Only get factors for elements that are actually used by the target variables. This is more efficient. Also, it avoids problems when values of unused elements have not been computed.
In addition to getting all the needed elements, it determines if any of the conditioned, constrained, or dependent universe parent elements has * in its range. If any of these elements has * in its range, the lower and upper bounds of factors will be different, so we need to compute both. If they don't, we don't need to compute bounds.
Called when the algorithm is started before running any steps.
Called when the algorithm is started before running any steps. By default, does nothing. Can be overridden.
Kill the algorithm so that it is inactive.
Kill the algorithm so that it is inactive. It will no longer be able to provide answers.Throws AlgorithmInactiveException if the algorithm is not active.
Resume the computation of the algorithm, if it has been stopped.
Resume the computation of the algorithm, if it has been stopped. Throws AlgorithmInactiveException if the algorithm is not active.
Run the algorithm, performing its computation to completion.
Run the algorithm, performing its computation to completion.
Start the algorithm and make it active.
Start the algorithm and make it active. After it returns, the algorithm must be ready to provide answers. Throws AlgorithmActiveException if the algorithm is already active.
Elements towards which queries are directed.
Elements towards which queries are directed. By default, these are the target elements. This is overridden by DecisionVariableElimination, where it also includes utility variables.
Stop the algorithm from computing.
Stop the algorithm from computing. The algorithm is still ready to provide answers after it returns. Throws AlgorithmInactiveException if the algorithm is not active.
Trait of algorithms that perform variable elimination.
The type of entries in the factors.