Packages

o

scalation.graph_db

BoundedTreeWidthChains

object BoundedTreeWidthChains

The BoundedTreeWidthChains object is used to find bounded tree width chains to add edges to a Bayesian Network graph.

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

Value Members

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

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