t

com.cra.figaro.algorithm.sampling

OneTimeProbEvidenceSampler

trait OneTimeProbEvidenceSampler extends OneTimeSampler with OneTimeProbEvidence

One-time sampling algorithms that compute probability of evidence.

Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. OneTimeProbEvidenceSampler
  2. OneTimeProbEvidence
  3. ProbEvidenceAlgorithm
  4. OneTimeSampler
  5. OneTime
  6. Sampler
  7. Algorithm
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def computedResult: Double
    Attributes
    protected
    Definition Classes
    ProbEvidenceAlgorithm
  2. abstract def doSample(): Unit
    Attributes
    protected
    Definition Classes
    Sampler
  3. abstract val numSamples: Int

    The number of samples to collect from the model.

    The number of samples to collect from the model.

    Definition Classes
    OneTimeSampler
  4. abstract def resetCounts(): Unit
    Attributes
    protected
    Definition Classes
    Sampler
  5. abstract val universe: Universe
    Definition Classes
    ProbEvidenceAlgorithm
  6. abstract def update(): Unit
    Attributes
    protected
    Definition Classes
    Sampler

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. val active: Boolean
    Attributes
    protected
    Definition Classes
    Algorithm
  5. def additionalEvidenceAlgorithm(evidence: List[NamedEvidence[_]]): ProbEvidenceSampler with OneTimeProbEvidenceSampler

    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
    OneTimeProbEvidenceSamplerProbEvidenceAlgorithm
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. 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
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. val denominator: Double
    Definition Classes
    ProbEvidenceAlgorithm
  10. def doKill(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    OneTimeAlgorithm
  11. def doResume(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    OneTimeAlgorithm
  12. def doStart(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    OneTimeAlgorithm
  13. def doStop(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    OneTimeAlgorithm
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. val evidence: List[NamedEvidence[_]]
    Definition Classes
    ProbEvidenceAlgorithm
  17. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  19. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  20. 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
  21. def isActive: Boolean
    Definition Classes
    Algorithm
  22. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  23. 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
  24. def logProbEvidence: Double

    The computed log probability of evidence.

    The computed log probability of evidence.

    Definition Classes
    ProbEvidenceAlgorithm
  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 probabilityOfEvidence(): Double

    Returns the probability of evidence of the universe on which the algorithm operates.

    Returns the probability of evidence of the universe on which the algorithm operates. Throws AlgorithmInactiveException if the algorithm is not active.

    Definition Classes
    OneTimeProbEvidence
  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 run(): Unit

    Run the algorithm, performing its computation to completion.

    Run the algorithm, performing its computation to completion.

    Definition Classes
    OneTimeSamplerOneTime
  33. 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
  34. 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
  35. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  36. def toString(): String
    Definition Classes
    AnyRef → Any
  37. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from OneTimeProbEvidence

Inherited from ProbEvidenceAlgorithm

Inherited from OneTimeSampler

Inherited from OneTime

Inherited from Sampler

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped