The algorithm used to compute the probability of additional evidence, as created by probAdditionalEvidence.
The algorithm used to compute the probability of additional evidence, as created by probAdditionalEvidence. This algorithm can be different to the one defined in this class. (For example, a one-time algorithm can use an anytime algorithm for additional evidence.)
Removes the evidence provided in the constructor from the universe.
Removes the evidence provided in the constructor from the universe.
Since probability of evidence algorithms introduce additional evidence (namely, their evidence argument), into an existing universe, a mechanism must be provided for introducing the evidence when the algorithm begins and cleaning it up at the end.
Since probability of evidence algorithms introduce additional evidence (namely, their evidence argument), into an existing universe, a mechanism must be provided for introducing the evidence when the algorithm begins and cleaning it up at the end. This is achieved with the initialize method, called when the algorithm starts, and the cleanUp method, called when the algorithm is killed.
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.
The computed log probability of evidence
Returns an algorithm to compute the probability of the additional evidence provided.
The computed probability of evidence
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.
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.
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.
Algorithms that compute probability of evidence. The evidence is specified as a list of named Evidence items. In addition to the universe, the ProbEvidenceAlgorithm takes two optional arguments. The evidence, which defaults to empty, and the denominator, which defaults to 1. The evidence is a list of specific evidence items associated with references. When started, the algorithm computes the probability of the named evidence, in addition to the conditions and constraints in the model, divided by the denominator (partition function). In a typical use case, one might want to compute the probability of the named evidence, taking the conditions and constraints as a given part of the model. To achieve this, you would create a ProbEvidenceAlgorithm with no evidence to compute the probability of the conditions and constraints. This probability becomes the denominator in a subsequent algorithm that takes the named evidence whose probability you want to compute. Several shortcut ways of achieving this are provided.