com.cra.figaro.algorithm.sampling

ProbEvidenceSampler

abstract class ProbEvidenceSampler extends ProbEvidenceAlgorithm with Sampler

Algorithm that computes probability of evidence using forward sampling. The evidence is specified as NamedEvidence. Only the probability of this evidence is computed. Conditions and constraints that are already on elements are considered part of the definition of the model.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ProbEvidenceSampler
  2. Sampler
  3. ProbEvidenceAlgorithm
  4. Algorithm
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ProbEvidenceSampler(universe: Universe, evidence: List[NamedEvidence[_]] = immutable.this.Nil, partition: Double = 1.0)

Abstract Value Members

  1. abstract def additionalEvidenceAlgorithm(evidence: List[NamedEvidence[_]]): ProbEvidenceAlgorithm

    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.)

    Definition Classes
    ProbEvidenceAlgorithm
  2. abstract def doKill(): Unit

    Attributes
    protected
    Definition Classes
    Algorithm
  3. abstract def doResume(): Unit

    Attributes
    protected
    Definition Classes
    Algorithm
  4. abstract def doStart(): Unit

    Attributes
    protected
    Definition Classes
    Algorithm
  5. abstract def doStop(): Unit

    Attributes
    protected
    Definition Classes
    Algorithm

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. var active: Boolean

    Attributes
    protected
    Definition Classes
    Algorithm
  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def cleanUp(): Unit

    Removes the evidence provided in the constructor from the universe.

    Removes the evidence provided in the constructor from the universe.

    Definition Classes
    ProbEvidenceAlgorithmAlgorithm
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def computedResult: Double

    Attributes
    protected
    Definition Classes
    ProbEvidenceSamplerProbEvidenceAlgorithm
  11. val denominator: Double

    Definition Classes
    ProbEvidenceAlgorithm
  12. def doSample(): Unit

    Attributes
    protected
    Definition Classes
    ProbEvidenceSamplerSampler
  13. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  15. val evidence: List[NamedEvidence[_]]

  16. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  19. def initialize(): Unit

    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.

    Definition Classes
    ProbEvidenceAlgorithmAlgorithm
  20. def isActive: Boolean

    Definition Classes
    Algorithm
  21. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  22. def kill(): Unit

    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.

    Definition Classes
    Algorithm
  23. def logComputedResult: Double

    Attributes
    protected
  24. def logProbEvidence: Double

    The computed log probability of evidence

    The computed log probability of evidence

    Definition Classes
    ProbEvidenceSamplerProbEvidenceAlgorithm
  25. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  26. final def notify(): Unit

    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  28. def probAdditionalEvidence(evidence: List[NamedEvidence[_]]): ProbEvidenceAlgorithm

    Returns an algorithm to compute the probability of the additional evidence provided.

    Returns an algorithm to compute the probability of the additional evidence provided.

    Definition Classes
    ProbEvidenceAlgorithm
  29. def probEvidence: Double

    The computed probability of evidence

    The computed probability of evidence

    Definition Classes
    ProbEvidenceAlgorithm
  30. def resetCounts(): Unit

    Attributes
    protected
    Definition Classes
    ProbEvidenceSamplerSampler
  31. def resume(): Unit

    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.

    Definition Classes
    Algorithm
  32. def start(): Unit

    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.

    Definition Classes
    Algorithm
  33. def stop(): Unit

    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.

    Definition Classes
    Algorithm
  34. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  35. def toString(): String

    Definition Classes
    AnyRef → Any
  36. val universe: Universe

  37. def update(): Unit

    Attributes
    protected
    Definition Classes
    ProbEvidenceSamplerSampler
  38. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Sampler

Inherited from ProbEvidenceAlgorithm

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped