ProbabilisticGibbs

abstract val burnIn: Int

Number of samples to throw away initially.

abstract def createBlocks(): List[Block]

Method to create a blocking scheme given information about the model and factors.

abstract val dependentAlgorithm: (Universe, List[NamedEvidence[_]]) ⇒ () ⇒ Double

The algorithm to compute probability of specified evidence in a dependent universe.

abstract val dependentUniverses: List[(Universe, List[NamedEvidence[_]])]

A list of universes that depend on this universe such that evidence on those universes should be taken into account in this universe.

abstract def doKill(): Unit

abstract def doResume(): Unit

abstract def doStart(): Unit

abstract def doStop(): Unit

abstract val interval: Int

Iterations thrown away between samples.

abstract val targetElements: List[Element[_]]

Elements whose samples will be recorded at each iteration.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

var active: Boolean

var allLastUpdates: Map[Element[_], LastUpdate[_]]

var allTimesSeen: Map[Element[_], TimesSeen[_]]

final def asInstanceOf[T0]: T0

var blockSamplers: List[BlockSampler]

def cleanUp(): Unit

Called when the algorithm is killed.

def clone(): AnyRef

val currentSamples: Map[Variable[_], Int]

The most recent set of samples, used for sampling variables conditioned on the values of other variables.

def doSample(): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

var factors: List[Factor[Double]]

List of all factors.

def finalize(): Unit

final def getClass(): Class[_]

def getFactors(neededElements: List[Element[_]], targetElements: List[Element[_]], upperBounds: Boolean = false): List[Factor[Double]]

All implementations of factored algorithms must specify a way to get the factors from the given universe and dependent universes.

def getNeededElements(starterElements: List[Element[_]], depth: Int): (List[Element[_]], Boolean)

Get the elements that are needed by the query target variables and the evidence variables.

def getSampleCount: Int

Number of samples taken

def hashCode(): Int

def initUpdates(): Unit

def initialize(): Unit

Called when the algorithm is started before running any steps.

def isActive: Boolean

final def isInstanceOf[T0]: Boolean

def kill(): Unit

Kill the algorithm so that it is inactive.

final def ne(arg0: AnyRef): Boolean

def newLastUpdate[T](target: Element[T]): LastUpdate[T]

def newTimesSeen[T](target: Element[T]): TimesSeen[T]

final def notify(): Unit

final def notifyAll(): Unit

lazy val queryTargets: List[Element[_]]

def resetCounts(): Unit

def resume(): Unit

Resume the computation of the algorithm, if it has been stopped.

def sample(): (Boolean, Sample)

Produce a single sample.

def sampleAllBlocks(): Unit

var sampleCount: Int

val semiring: LogSumProductSemiring

Semiring for use in factors.

def start(): Unit

Start the algorithm and make it active.

def stop(): Unit

Stop the algorithm from computing.

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

def toString(): String

val universe: Universe

def update(): Unit

def updateTimesSeenForTarget[T](elem: Element[T], newValue: T): Unit

def updateTimesSeenWithValue[T](value: T, timesSeen: TimesSeen[T], seen: Int): Unit

var variables: Set[Variable[_]]

Variables to sample at each time step.

final def wait(): Unit

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

final def wait(arg0: Long): Unit