StructuredVEGibbsChooser

Instance Constructors

new StructuredVEGibbsChooser(universe: Universe, scoreThreshold: Double, numSamples: Int, burnIn: Int, interval: Int, blockToSampler: BlockSamplerCreator, targets: Element[_]*)

Type Members

class NotATargetException[T] extends AlgorithmException

Definition Classes
BaseProbQueryAlgorithm

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
var active: Boolean

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

Definition Classes
Any
val cc: ComponentCollection

Definition Classes
StructuredProbQueryAlgorithm
def cleanUp(): Unit

Called when the algorithm is killed.
Called when the algorithm is killed. By default, does nothing. Can be overridden.

Definition Classes
Algorithm
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def computeDistribution[T](target: Element[T]): Stream[(Double, T)]

Computes the normalized distribution over a single target element.
Computes the normalized distribution over a single target element.

Definition Classes
StructuredProbQueryAlgorithm → BaseProbQueryAlgorithm
def computeExpectation[T](target: Element[T], function: (T) ⇒ Double): Double

Computes the expectation of a given function for single target element.
Computes the expectation of a given function for single target element.

Definition Classes
StructuredProbQueryAlgorithm → BaseProbQueryAlgorithm
def computeProbability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

Return an estimate of the probability of the predicate under the marginal probability distribution of the target.
Return an estimate of the probability of the predicate under the marginal probability distribution of the target.

Definition Classes
BaseProbQueryAlgorithm
def computeProjection[T](target: Element[T]): List[(T, Double)]

Attributes
protected[com.cra.figaro.algorithm]
Definition Classes
BaseProbQueryAlgorithm
def distribution[T](target: Element[T]): Stream[(Double, T)]

Return an estimate of the marginal probability distribution over the target that lists each element with its probability.
Return an estimate of the marginal probability distribution over the target that lists each element with its probability. The result is a lazy stream. It is up to the algorithm how the stream is ordered. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

Definition Classes
BaseProbQueryAlgorithm
def doDistribution[T](target: Element[T]): Stream[(Double, T)]

Attributes
protected
Definition Classes
OneTimeProbQuery → BaseProbQueryAlgorithm
def doExpectation[T](target: Element[T], function: (T) ⇒ Double): Double

Attributes
protected
Definition Classes
OneTimeProbQuery → BaseProbQueryAlgorithm
def doKill(): Unit

Attributes
protected[com.cra.figaro.algorithm]
Definition Classes
OneTime → Algorithm
def doProbability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

Attributes
protected
Definition Classes
OneTimeProbQuery → BaseProbQueryAlgorithm
def doProjection[T](target: Element[T]): List[(T, Double)]

Attributes
protected
Definition Classes
OneTimeProbQuery → BaseProbQueryAlgorithm
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 evidenceElems: List[Element[_]]

Definition Classes
StructuredProbQueryAlgorithm
def expectation[T](target: Element[T])(function: (T) ⇒ Double, c: Any = DummyImplicit): Double

Return an estimate of the expectation of the function under the marginal probability distribution of the target.
Return an estimate of the expectation of the function under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

Definition Classes
BaseProbQueryAlgorithm
def expectation[T](target: Element[T], function: (T) ⇒ Double): Double

Return an estimate of the expectation of the function under the marginal probability distribution of the target.
Return an estimate of the expectation of the function under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

Definition Classes
BaseProbQueryAlgorithm
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 initialComponents(): List[ProblemComponent[_]]

Definition Classes
StructuredProbQueryAlgorithm
def initialize(): Unit

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.

Definition Classes
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 marginalizeToTarget(target: Element[_], jointFactor: Factor[Double]): Unit

Attributes
protected
Definition Classes
StructuredProbQueryAlgorithm
def mean(target: Element[Double]): Double

Return the mean of the probability density function for the given continuous element.
Return the mean of the probability density function for the given continuous element.

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def posteriorElement[T](target: Element[T], universe: Universe = Universe.universe): Element[T]

Return an element representing the posterior probability distribution of the given element.
Return an element representing the posterior probability distribution of the given element.

Definition Classes
ProbQueryAlgorithm
def probability[T](target: Element[T], value: T): Double

Return an estimate of the probability that the target produces the value.
Return an estimate of the probability that the target produces the value. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

Definition Classes
BaseProbQueryAlgorithm
def probability[T](target: Element[T])(predicate: (T) ⇒ Boolean, c: Any = DummyImplicit): Double

Return an estimate of the probability of the predicate under the marginal probability distribution of the target.
Return an estimate of the probability of the predicate under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

Definition Classes
BaseProbQueryAlgorithm
def probability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

Return an estimate of the probability of the predicate under the marginal probability distribution of the target.
Return an estimate of the probability of the predicate under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

Definition Classes
BaseProbQueryAlgorithm
val problem: Problem

Definition Classes
StructuredProbQueryAlgorithm
val queryTargets: Element[_]*

Definition Classes
StructuredProbQueryAlgorithm → BaseProbQueryAlgorithm
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
StructuredVEGibbsChooser → StructuredProbQueryAlgorithm → OneTime
val semiring: SumProductSemiring

Definition Classes
StructuredVEGibbsChooser → StructuredProbQueryAlgorithm
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
val targetFactors: Map[Element[_], Factor[Double]]

Definition Classes
StructuredProbQueryAlgorithm
def toString(): String

Definition Classes
AnyRef → Any
val universe: Universe

Definition Classes
StructuredProbQueryAlgorithm → ProbQueryAlgorithm
def variance(target: Element[Double]): Double

Return the variance of the probability density function for the given continuous element.
Return the variance of the probability density function for the given continuous element.

Definition Classes
BaseProbQueryAlgorithm
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( ... )

Related Docs: object StructuredVEGibbsChooser | package hybrid

class StructuredVEGibbsChooser extends StructuredProbQueryAlgorithm

Instance Constructors

new StructuredVEGibbsChooser(universe: Universe, scoreThreshold: Double, numSamples: Int, burnIn: Int, interval: Int, blockToSampler: BlockSamplerCreator, targets: Element[_]*)

Type Members

class NotATargetException[T] extends AlgorithmException

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

var active: Boolean

final def asInstanceOf[T0]: T0

val cc: ComponentCollection

def cleanUp(): Unit

def clone(): AnyRef

def computeDistribution[T](target: Element[T]): Stream[(Double, T)]

def computeExpectation[T](target: Element[T], function: (T) ⇒ Double): Double

def computeProbability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

def computeProjection[T](target: Element[T]): List[(T, Double)]

def distribution[T](target: Element[T]): Stream[(Double, T)]

def doDistribution[T](target: Element[T]): Stream[(Double, T)]

def doExpectation[T](target: Element[T], function: (T) ⇒ Double): Double

def doKill(): Unit

def doProbability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

def doProjection[T](target: Element[T]): List[(T, Double)]

def doResume(): Unit

def doStart(): Unit

def doStop(): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

val evidenceElems: List[Element[_]]

def expectation[T](target: Element[T])(function: (T) ⇒ Double, c: Any = DummyImplicit): Double

def expectation[T](target: Element[T], function: (T) ⇒ Double): Double

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def initialComponents(): List[ProblemComponent[_]]

def initialize(): Unit

def isActive: Boolean

final def isInstanceOf[T0]: Boolean

def kill(): Unit

def marginalizeToTarget(target: Element[_], jointFactor: Factor[Double]): Unit

def mean(target: Element[Double]): Double

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def posteriorElement[T](target: Element[T], universe: Universe = Universe.universe): Element[T]

def probability[T](target: Element[T], value: T): Double

def probability[T](target: Element[T])(predicate: (T) ⇒ Boolean, c: Any = DummyImplicit): Double

def probability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

val problem: Problem

val queryTargets: Element[_]*

def resume(): Unit

def run(): Unit

val semiring: SumProductSemiring

def start(): Unit

def stop(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

val targetFactors: Map[Element[_], Factor[Double]]

def toString(): String

val universe: Universe

def variance(target: Element[Double]): Double

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from StructuredProbQueryAlgorithm

Inherited from OneTimeProbQuery

Inherited from OneTime

Inherited from ProbQueryAlgorithm

Inherited from BaseProbQueryAlgorithm[Element]

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped