Packages

c

scalation.graph_db

BoundedTreeWidthBN

class BoundedTreeWidthBN extends Error

The BoundedTreeWidthBN class provides bounded treewidth Bayesian Networks.

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

Instance Constructors

  1. new BoundedTreeWidthBN(g_in: MGraph[Double], kMax: Int)

    g_in

    the input directed graph (FIX: training data)

    kMax

    the maximum allowed treewidth

Value Members

  1. val DEBUG: Boolean
  2. 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

  3. def blockSort(mp: MGraph[Double]): Array[Int]

    Order the blocks in the graph.

    Order the blocks in the graph.

    mp

    the triangulated moralized graph

  4. 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

  5. final def flaw(method: String, message: String): Unit
    Definition Classes
    Error
  6. 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.

  7. 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

  8. 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

  9. def positiveEdges: Boolean

    Determine whether positive scoring edges still exist.

  10. val stree: MinSpanningTree