Class

com.cra.figaro.algorithm.learning

SufficientStatisticsFactor

Related Doc: package learning

Permalink

class SufficientStatisticsFactor extends AnyRef

Methods for creating probabilistic factors associated with elements and their sufficient statistics.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SufficientStatisticsFactor
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SufficientStatisticsFactor(parameterMap: Map[Parameter[_], Seq[Double]])

    Permalink

    parameterMap

    Map of parameters to their sufficient statistics. Expectation

Value Members

  1. final def !=(arg0: Any): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def convertFactor[T](factor: Factor[Double]): Factor[(Double, Map[Parameter[_], Seq[Double]])]

    Permalink
  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  13. def make(elem: Element[_]): List[Factor[(Double, Map[Parameter[_], Seq[Double]])]]

    Permalink

    Create the probabilistic factors associated with an element.

    Create the probabilistic factors associated with an element. This method is memoized.

  14. def makeDependentFactor(cc: ComponentCollection, parentUniverse: Universe, dependentUniverse: Universe, probEvidenceComputer: () ⇒ Double): Factor[(Double, Map[Parameter[_], Seq[Double]])]

    Permalink

    Create the probabilistic factor encoding the probability of evidence in the dependent universe as a function of the values of variables in the parent universe.

    Create the probabilistic factor encoding the probability of evidence in the dependent universe as a function of the values of variables in the parent universe. The third argument is the the function to use for computing probability of evidence in the dependent universe. It is assumed that the definition of this function will already contain the right evidence.

  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. def partitionConstraintFactors(factors: List[Factor[Double]]): (List[Factor[Double]], List[Factor[Double]])

    Permalink
  19. val semiring: SufficientStatisticsSemiring

    Permalink
  20. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  21. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped