SufficientStatisticsFactor

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

11. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    Definition Classes

    AnyRef → Any

13. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

14. def make(elem: Element[_]): List[Factor[(Double, Map[Parameter[_], Seq[Double]])]]

    Create the probabilistic factors associated with an element.

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

15. def makeConditionalSelector[T, U](overallElem: Element[U], selector: Variable[T], outcomeIndex: Int, resultElem: Element[U])(implicit mapper: PointMapper[U]): Factor[(Double, Map[Parameter[_], Seq[Double]])]

    Make a conditional selector factor used in the decomposition of chain and other elements.

    Make a conditional selector factor used in the decomposition of chain and other elements. A chain defines a factor over the parent element, each of the possible result elements of the chain, and the overall chain element. This can produce a very large factor when there are many result elements. This is solved by decomposing the chain factor into a product of factors, each of which contains the parent element, one of the result elements, and the overall chain element.

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

    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.

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

    Definition Classes

    AnyRef

18. final def notify(): Unit

    Definition Classes

    AnyRef

19. final def notifyAll(): Unit

    Definition Classes

    AnyRef

20. def removeFactors(): Unit

    Removes the factors for all elements from the cache.

21. def removeFactors(elem: Element[_]): Unit

    Removes the factors for the specified element from the cache.

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

    Definition Classes

    AnyRef

23. def toString(): String

    Definition Classes

    AnyRef → Any

24. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )