object BoundedTreeWidthChains
The BoundedTreeWidthChains
object is used to find bounded tree width
chains to add edges to a Bayesian Network graph.
- Alphabetic
- By Inheritance
- BoundedTreeWidthChains
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
edgeUpdate(g: MGraph[Double], mp: MGraph[Double], e: Pair): Unit
Update edges of 'mp' (M+) when adding (s → t) to 'g'.
Update edges of 'mp' (M+) when adding (s → t) to 'g'. This corresponds to Algorithm 3 in the paper.
- g
the maximum scoring graph of bounded treewidth
- mp
the triangulated moralized graph of g
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
learnChain(g: MGraph[Double], order: (Array[Int], Array[Int])): Array[Pair]
Learn the optimal non-contaminating chain with respect to topological node ordering.
Learn the optimal non-contaminating chain with respect to topological node ordering. This corresponds to Algorithm 6 in the paper.
- g
the maximum scoring graph of bounded treewidth
- order
the topological ordering of vertices and blocks
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )