trait OneTimeProbEvidenceSampler extends OneTimeSampler with OneTimeProbEvidence
Onetime sampling algorithms that compute probability of evidence.
 Alphabetic
 By Inheritance
 OneTimeProbEvidenceSampler
 OneTimeProbEvidence
 ProbEvidenceAlgorithm
 OneTimeSampler
 OneTime
 Sampler
 Algorithm
 AnyRef
 Any
 Hide All
 Show All
 Public
 All
Abstract Value Members

abstract
def
computedResult: Double
 Attributes
 protected
 Definition Classes
 ProbEvidenceAlgorithm

abstract
def
doSample(): Unit
 Attributes
 protected
 Definition Classes
 Sampler

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

abstract
def
resetCounts(): Unit
 Attributes
 protected
 Definition Classes
 Sampler

abstract
val
universe: Universe
 Definition Classes
 ProbEvidenceAlgorithm

abstract
def
update(): Unit
 Attributes
 protected
 Definition Classes
 Sampler
Concrete Value Members

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

final
def
##(): Int
 Definition Classes
 AnyRef → Any

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

val
active: Boolean
 Attributes
 protected
 Definition Classes
 Algorithm

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 onetime algorithm can use an anytime algorithm for additional evidence.)
 Definition Classes
 OneTimeProbEvidenceSampler → ProbEvidenceAlgorithm

final
def
asInstanceOf[T0]: T0
 Definition Classes
 Any

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
 ProbEvidenceAlgorithm → Algorithm

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

val
denominator: Double
 Definition Classes
 ProbEvidenceAlgorithm

def
doKill(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

def
doResume(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

def
doStart(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

def
doStop(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

final
def
eq(arg0: AnyRef): Boolean
 Definition Classes
 AnyRef

def
equals(arg0: Any): Boolean
 Definition Classes
 AnyRef → Any

val
evidence: List[NamedEvidence[_]]
 Definition Classes
 ProbEvidenceAlgorithm

def
finalize(): Unit
 Attributes
 protected[java.lang]
 Definition Classes
 AnyRef
 Annotations
 @throws( classOf[java.lang.Throwable] )

final
def
getClass(): Class[_]
 Definition Classes
 AnyRef → Any

def
hashCode(): Int
 Definition Classes
 AnyRef → Any

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
 ProbEvidenceAlgorithm → Algorithm

def
isActive: Boolean
 Definition Classes
 Algorithm

final
def
isInstanceOf[T0]: Boolean
 Definition Classes
 Any

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

def
logProbEvidence: Double
The computed log probability of evidence.
The computed log probability of evidence.
 Definition Classes
 ProbEvidenceAlgorithm

final
def
ne(arg0: AnyRef): Boolean
 Definition Classes
 AnyRef

final
def
notify(): Unit
 Definition Classes
 AnyRef

final
def
notifyAll(): Unit
 Definition Classes
 AnyRef

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

def
probEvidence: Double
The computed probability of evidence.
The computed probability of evidence.
 Definition Classes
 ProbEvidenceAlgorithm

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

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

def
run(): Unit
Run the algorithm, performing its computation to completion.
Run the algorithm, performing its computation to completion.
 Definition Classes
 OneTimeSampler → OneTime

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

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

final
def
synchronized[T0](arg0: ⇒ T0): T0
 Definition Classes
 AnyRef

def
toString(): String
 Definition Classes
 AnyRef → Any

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

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

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