class MPEVariableElimination extends OneTimeMPE with ProbabilisticVariableElimination

Variable elimination algorithm to compute the most probable explanation.

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MPEVariableElimination
  2. ProbabilisticVariableElimination
  3. VariableElimination
  4. FactoredAlgorithm
  5. OneTimeMPE
  6. OneTime
  7. MPEAlgorithm
  8. Algorithm
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MPEVariableElimination(universe: Universe)(showTiming: Boolean, dependentUniverses: List[(Universe, List[NamedEvidence[_]])], dependentAlgorithm: (Universe, List[NamedEvidence[_]]) ⇒ () ⇒ Double)

    showTiming

    Produce timing information on steps of the algorithm

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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. 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
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. val comparator: Some[(Double, Double) ⇒ Boolean]
  9. val debug: Boolean

    By default, implementations that inherit this trait have no debug information.

    By default, implementations that inherit this trait have no debug information. Override this if you want a debugging option.

    Definition Classes
    VariableElimination
  10. val dependentAlgorithm: (Universe, List[NamedEvidence[_]]) ⇒ () ⇒ Double
  11. val dependentUniverses: List[(Universe, List[NamedEvidence[_]])]
  12. def doElimination(allFactors: List[Factor[Double]], targetVariables: Seq[Variable[_]]): Unit
    Attributes
    protected
    Definition Classes
    VariableElimination
  13. def doKill(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    OneTimeAlgorithm
  14. def doMostLikelyValue[T](target: Element[T]): T
    Attributes
    protected
    Definition Classes
    OneTimeMPEMPEAlgorithm
  15. def doResume(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    OneTimeAlgorithm
  16. def doStart(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    OneTimeAlgorithm
  17. def doStop(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    OneTimeAlgorithm
  18. def eliminateInOrder(order: List[Variable[_]], factors: MultiSet[Factor[Double]], map: FactorMap[Double]): MultiSet[Factor[Double]]
    Attributes
    protected
    Definition Classes
    VariableElimination
  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  22. def finish(factorsAfterElimination: MultiSet[Factor[Double]], eliminationOrder: List[Variable[_]]): Unit

    All implementation of variable elimination must specify what to do after variables have been eliminated.

    All implementation of variable elimination must specify what to do after variables have been eliminated.

    Definition Classes
    MPEVariableEliminationVariableElimination
  23. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  24. def getFactors(allElements: List[Element[_]], targetElements: List[Element[_]], upper: 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.

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

    Definition Classes
    MPEVariableEliminationProbabilisticVariableEliminationFactoredAlgorithm
  25. def getNeededElements(starterElements: List[Element[_]], depth: Int, parameterized: Boolean = false): (List[Element[_]], Boolean)

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

    Get the elements that are needed by the query target variables and the evidence variables. Also compute the values of those variables to the given depth. Only get factors for elements that are actually used by the target variables. This is more efficient. Also, it avoids problems when values of unused elements have not been computed.

    In addition to getting all the needed elements, it determines if any of the conditioned, constrained, or dependent universe parent elements has * in its range. If any of these elements has * in its range, the lower and upper bounds of factors will be different, so we need to compute both. If they don't, we don't need to compute bounds.

    Definition Classes
    FactoredAlgorithm
  26. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  27. def initialFactorMap(factors: Traversable[Factor[Double]]): FactorMap[Double]
    Attributes
    protected
    Definition Classes
    VariableElimination
  28. 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
  29. def isActive: Boolean
    Definition Classes
    Algorithm
  30. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  31. 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
  32. def mostLikelyValue[T](target: Element[T]): T

    Returns the most likely value for the target element.

    Returns the most likely value for the target element.

    Definition Classes
    MPEVariableEliminationMPEAlgorithm
  33. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. final def notify(): Unit
    Definition Classes
    AnyRef
  35. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  36. val recordingFactors: List[Factor[_]]
    Attributes
    protected
    Definition Classes
    VariableElimination
  37. 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
  38. def run(): Unit

    Run the algorithm, performing its computation to completion.

    Run the algorithm, performing its computation to completion.

    Definition Classes
    VariableEliminationOneTime
  39. val semiring: MaxProductSemiring
  40. val showTiming: Boolean
  41. 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
  42. val starterElements: List[Element[_]]
  43. 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
  44. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  45. val targetElements: List[Element[_]]

    Empty for MPE Algorithms.

    Empty for MPE Algorithms.

    Definition Classes
    MPEVariableEliminationVariableElimination
  46. val targetFactors: Map[Element[_], Factor[Double]]
    Attributes
    protected[com.cra.figaro]
    Definition Classes
    VariableElimination
  47. def toString(): String
    Definition Classes
    AnyRef → Any
  48. val universe: Universe
  49. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from VariableElimination[Double]

Inherited from FactoredAlgorithm[Double]

Inherited from OneTimeMPE

Inherited from OneTime

Inherited from MPEAlgorithm

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped