class BoundedTreeWidthBN extends Error
The BoundedTreeWidthBN class provides bounded treewidth Bayesian Networks.
- Alphabetic
- By Inheritance
- BoundedTreeWidthBN
- Error
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
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
- val DEBUG: Boolean
-
def
addEdgesGreedily(g: MGraph[Double], mp: MGraph[Double], k: Int): Unit
Greedily add edges to 'g' that do not increase treewidth beyond 'kMax'.
Greedily add edges to 'g' that do not increase treewidth beyond 'kMax'.
- g
the maximum scoring graph of bounded treewidth
- mp
the triangulated moralized graph
- k
the current treewidth
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
blockSort(mp: MGraph[Double]): Array[Int]
Order the blocks in the graph.
Order the blocks in the graph.
- mp
the triangulated moralized graph
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
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] )
-
def
findbestEdge(g: MGraph[Double], mp: MGraph[Double], k: Int): Pair
Find and return the next best remaining edge.
Find and return the next best remaining edge. Return (-1, -1) if there are none.
- g
the maximum scoring graph of bounded treewidth
- mp
the triangulated moralized graph
- k
the current treewidth
-
final
def
flaw(method: String, message: String): Unit
- Definition Classes
- Error
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
learnBN(): MGraph[Double]
Learn a Bayesian Network with Bounded Treewidth.
Learn a Bayesian Network with Bounded Treewidth. Starting with a spanning tree, add score improving edges, so long as the 'kMax' bound on the graph's treewidth is not exceeded. This corresponds to Algorithm 1 in the paper.
-
def
maxCliqueSize(mp: MGraph[Double]): Int
Compute the size of the largest clique in the graph.
Compute the size of the largest clique in the graph.
- mp
the triangulated moralized graph whose maximum clique size is sought
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
orderVertices(g: MGraph[Double], mp: MGraph[Double]): (Array[Int], Array[Int])
Order the vertices and blocks in the graph.
Order the vertices and blocks in the graph.
- g
the graph built up from the spanning tree
- mp
the triangulated moralized graph
- See also
Algorithm 7
-
def
positiveEdges: Boolean
Determine whether positive scoring edges still exist.
- val stree: MinSpanningTree
-
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
- @native() @throws( ... )