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 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.
Since BP uses division to compute messages, the semiring has to have a division function defined
Since BP uses division to compute messages, the semiring has to have a division function defined
Target elements that should not be eliminated but should be available for querying.
The universe on which this belief propagation algorithm should be applied.
The universe on which this belief propagation algorithm should be applied.
Returns the product of all messages from a source node's neighbors to itself.
Called when the algorithm is killed.
Called when the algorithm is killed. By default, does nothing. Can be overridden.
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.
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.
Runs this belief propagation algorithm for one iteration.
Runs this belief propagation algorithm for one iteration. An iteration consists of each node of the factor graph sending a message to each of its neighbors.
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 for performing belief propagation.
The type of entries in the factors.