PBNT.Graph.MoralDBNGraph Class Reference

Inheritance diagram for PBNT.Graph.MoralDBNGraph:

Collaboration diagram for PBNT.Graph.MoralDBNGraph:

Public Member Functions
def	__init__ (self, DBN)
Public Member Functions inherited from PBNT.Graph.MoralGraph
def	__init__ (self, DAG)
def	deep_copy_nodes (self)
Public Member Functions inherited from PBNT.Graph.Graph
def	__init__ (self, nodes)
def	add_node (self, node)
def	member_of (self, node)
def	contains (self, nodes)
def	connect_nodes (self, node1, node2)

Additional Inherited Members
Public Attributes inherited from PBNT.Graph.Graph
	nodes

Detailed Description

This is not finished yet.  The plan is to use this class to create a MoralGraph for use in Dynamic Bayes Nets. The primary difference between doing JunctionTreeInference on a DBN from a static bayes net is that I have to ensure that the forward interface and the backward interface are both contained in a clique of the final join tree.  This can be ensured by making sure that all of the nodes in the two interfaces are connected.  For more details and a justification please see Kevin Murphy's dissertation.

---

The documentation for this class was generated from the following file:

• PBNT/Graph.py