o

VariableElimination 

Companion trait VariableElimination

object VariableElimination

Linear Supertypes
AnyRef, Any
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. VariableElimination
2. AnyRef
3. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

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. def apply(dependentUniverses: List[(Universe, List[NamedEvidence[_]])], dependentAlgorithm: (Universe, List[NamedEvidence[_]]) ⇒ () ⇒ Double, targets: Element[_]*)(implicit universe: Universe)

Create a variable elimination computer with the given target query variables and using the given dependent universes in the current default universe.

Create a variable elimination computer with the given target query variables and using the given dependent universes in the current default universe. Use the given dependent algorithm function to determine the algorithm to use to compute probability of evidence in each dependent universe.

5. def apply(dependentUniverses: List[(Universe, List[NamedEvidence[_]])], targets: Element[_]*)(implicit universe: Universe)

Create a variable elimination computer with the given target query variables and using the given dependent universes in the current default universe.

6. def apply(targets: Element[_]*)(implicit universe: Universe)

Create a variable elimination computer with the given target query variables in the current default universe.

7. final def asInstanceOf[T0]: T0
Definition Classes
Any
8. def clone(): AnyRef
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
9. def debugged(targets: Element[_]*)(implicit universe: Universe)

Create a variable elimination computer with the given target query variables in the current default universe, with debug information enabled.

10. def eliminationOrder[T](factors: Traversable[Factor[T]], toPreserve: Traversable[Variable[_]], useBestScore: Boolean = true): (Double, List[Variable[_]])

Method for choosing the elimination order.

Method for choosing the elimination order. The default order chooses first the variable that minimizes the number of extra factor entries that would be created when it is eliminated. Override this method if you want a different rule.

Returns the score of the ordering as well as the ordering. If useBestScore is set to false, then it returns the total score of the entire eliminiation operation

11. final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
12. def equals(arg0: Any): Boolean
Definition Classes
AnyRef → Any
13. def finalize(): Unit
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
14. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
15. def hashCode(): Int
Definition Classes
AnyRef → Any
16. final def isInstanceOf[T0]: Boolean
Definition Classes
Any
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 probability[T](target: Element[T], value: T): Double

Use VE to compute the probability that the given element has the given value.

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

Use VE to compute the probability that the given element satisfies the given predicate.

22. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
23. def timed(targets: Element[_]*)(implicit universe: Universe)

Create a variable elimination computer with the given target query variables in the current default universe, with timing information enabled.

24. def toString(): String
Definition Classes
AnyRef → Any
25. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
26. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
27. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )