class TestJunctionTreeCreation(unittest.TestCase):
def setUp(self):
self.graph = JunctionTree()
def test_add_single_node(self):
self.graph.add_node(('a', 'b'))
self.assertListEqual(self.graph.nodes(), [('a', 'b')])
def test_add_single_node_raises_error(self):
self.assertRaises(TypeError, self.graph.add_node, 'a')
def test_add_multiple_nodes(self):
self.graph.add_nodes_from([('a', 'b'), ('b', 'c')])
self.assertListEqual(hf.recursive_sorted(self.graph.nodes()),
[['a', 'b'], ['b', 'c']])
def test_add_single_edge(self):
self.graph.add_edge(('a', 'b'), ('b', 'c'))
self.assertListEqual(hf.recursive_sorted(self.graph.nodes()),
[['a', 'b'], ['b', 'c']])
self.assertListEqual(sorted([node for edge in self.graph.edges()
for node in edge]),
[('a', 'b'), ('b', 'c')])
def test_add_single_edge_raises_error(self):
self.assertRaises(ValueError, self.graph.add_edge,
('a', 'b'), ('c', 'd'))
def test_add_cyclic_path_raises_error(self):
self.graph.add_edge(('a', 'b'), ('b', 'c'))
self.graph.add_edge(('b', 'c'), ('c', 'd'))
self.assertRaises(ValueError, self.graph.add_edge, ('c', 'd'), ('a', 'b'))
def tearDown(self):
del self.graph
class TestJunctionTreeMethods(unittest.TestCase):
def setUp(self):
self.factor1 = DiscreteFactor(["a", "b"], [2, 2], np.random.rand(4))
self.factor2 = DiscreteFactor(["b", "c"], [2, 2], np.random.rand(4))
self.factor3 = DiscreteFactor(["d", "e"], [2, 2], np.random.rand(4))
self.factor4 = DiscreteFactor(["e", "f"], [2, 2], np.random.rand(4))
self.factor5 = DiscreteFactor(["a", "b", "e"], [2, 2, 2],
np.random.rand(8))
self.graph1 = JunctionTree()
self.graph1.add_edge(("a", "b"), ("b", "c"))
self.graph1.add_factors(self.factor1, self.factor2)
self.graph2 = JunctionTree()
self.graph2.add_nodes_from([("a", "b"), ("b", "c"), ("d", "e")])
self.graph2.add_edge(("a", "b"), ("b", "c"))
self.graph2.add_factors(self.factor1, self.factor2, self.factor3)
self.graph3 = JunctionTree()
self.graph3.add_edges_from([(("a", "b"), ("b", "c")),
(("d", "e"), ("e", "f"))])
self.graph3.add_factors(self.factor1, self.factor2, self.factor3,
self.factor4)
self.graph4 = JunctionTree()
self.graph4.add_edges_from([
(("a", "b", "e"), ("b", "c")),
(("a", "b", "e"), ("e", "f")),
(("d", "e"), ("e", "f")),
])
self.graph4.add_factors(self.factor5, self.factor2, self.factor3,
self.factor4)
def test_check_model(self):
self.assertRaises(ValueError, self.graph2.check_model)
self.assertRaises(ValueError, self.graph3.check_model)
self.assertTrue(self.graph1.check_model())
self.assertTrue(self.graph4.check_model())
def tearDown(self):
del self.factor1
del self.factor2
del self.factor3
del self.factor4
del self.factor5
del self.graph1
del self.graph2
del self.graph3
del self.graph4
class TestJunctionTreeMethods(unittest.TestCase):
def setUp(self):
self.factor1 = DiscreteFactor(['a', 'b'], [2, 2], np.random.rand(4))
self.factor2 = DiscreteFactor(['b', 'c'], [2, 2], np.random.rand(4))
self.factor3 = DiscreteFactor(['d', 'e'], [2, 2], np.random.rand(4))
self.factor4 = DiscreteFactor(['e', 'f'], [2, 2], np.random.rand(4))
self.factor5 = DiscreteFactor(['a', 'b', 'e'], [2, 2, 2],
np.random.rand(8))
self.graph1 = JunctionTree()
self.graph1.add_edge(('a', 'b'), ('b', 'c'))
self.graph1.add_factors(self.factor1, self.factor2)
self.graph2 = JunctionTree()
self.graph2.add_nodes_from([('a', 'b'), ('b', 'c'), ('d', 'e')])
self.graph2.add_edge(('a', 'b'), ('b', 'c'))
self.graph2.add_factors(self.factor1, self.factor2, self.factor3)
self.graph3 = JunctionTree()
self.graph3.add_edges_from([(('a', 'b'), ('b', 'c')),
(('d', 'e'), ('e', 'f'))])
self.graph3.add_factors(self.factor1, self.factor2, self.factor3,
self.factor4)
self.graph4 = JunctionTree()
self.graph4.add_edges_from([(('a', 'b', 'e'), ('b', 'c')),
(('a', 'b', 'e'), ('e', 'f')),
(('d', 'e'), ('e', 'f'))])
self.graph4.add_factors(self.factor5, self.factor2, self.factor3,
self.factor4)
def test_check_model(self):
self.assertRaises(ValueError, self.graph2.check_model)
self.assertRaises(ValueError, self.graph3.check_model)
self.assertTrue(self.graph1.check_model())
self.assertTrue(self.graph4.check_model())
def tearDown(self):
del self.factor1
del self.factor2
del self.factor3
del self.factor4
del self.factor5
del self.graph1
del self.graph2
del self.graph3
del self.graph4
class TestJunctionTreeMethods(unittest.TestCase):
def setUp(self):
self.factor1 = DiscreteFactor(['a', 'b'], [2, 2], np.random.rand(4))
self.factor2 = DiscreteFactor(['b', 'c'], [2, 2], np.random.rand(4))
self.factor3 = DiscreteFactor(['d', 'e'], [2, 2], np.random.rand(4))
self.factor4 = DiscreteFactor(['e', 'f'], [2, 2], np.random.rand(4))
self.factor5 = DiscreteFactor(['a', 'b', 'e'], [2, 2, 2], np.random.rand(8))
self.graph1 = JunctionTree()
self.graph1.add_edge(('a', 'b'), ('b', 'c'))
self.graph1.add_factors(self.factor1, self.factor2)
self.graph2 = JunctionTree()
self.graph2.add_nodes_from([('a', 'b'), ('b', 'c'), ('d', 'e')])
self.graph2.add_edge(('a', 'b'), ('b', 'c'))
self.graph2.add_factors(self.factor1, self.factor2, self.factor3)
self.graph3 = JunctionTree()
self.graph3.add_edges_from([(('a', 'b'), ('b', 'c')), (('d', 'e'), ('e', 'f'))])
self.graph3.add_factors(self.factor1, self.factor2, self.factor3, self.factor4)
self.graph4 = JunctionTree()
self.graph4.add_edges_from([(('a', 'b', 'e'), ('b', 'c')), (('a', 'b', 'e'), ('e', 'f')),
(('d', 'e'), ('e', 'f'))])
self.graph4.add_factors(self.factor5, self.factor2, self.factor3, self.factor4)
def test_check_model(self):
self.assertRaises(ValueError, self.graph2.check_model)
self.assertRaises(ValueError, self.graph3.check_model)
self.assertTrue(self.graph1.check_model())
self.assertTrue(self.graph4.check_model())
def tearDown(self):
del self.factor1
del self.factor2
del self.factor3
del self.factor4
del self.factor5
del self.graph1
del self.graph2
del self.graph3
del self.graph4
class TestJunctionTreeCreation(unittest.TestCase):
def setUp(self):
self.graph = JunctionTree()
def test_add_single_node(self):
self.graph.add_node(("a", "b"))
self.assertListEqual(list(self.graph.nodes()), [("a", "b")])
def test_add_single_node_raises_error(self):
self.assertRaises(TypeError, self.graph.add_node, "a")
def test_add_multiple_nodes(self):
self.graph.add_nodes_from([("a", "b"), ("b", "c")])
self.assertListEqual(hf.recursive_sorted(self.graph.nodes()),
[["a", "b"], ["b", "c"]])
def test_add_single_edge(self):
self.graph.add_edge(("a", "b"), ("b", "c"))
self.assertListEqual(hf.recursive_sorted(self.graph.nodes()),
[["a", "b"], ["b", "c"]])
self.assertListEqual(
sorted([node for edge in self.graph.edges() for node in edge]),
[("a", "b"), ("b", "c")],
)
def test_add_single_edge_raises_error(self):
self.assertRaises(ValueError, self.graph.add_edge, ("a", "b"),
("c", "d"))
def test_add_cyclic_path_raises_error(self):
self.graph.add_edge(("a", "b"), ("b", "c"))
self.graph.add_edge(("b", "c"), ("c", "d"))
self.assertRaises(ValueError, self.graph.add_edge, ("c", "d"),
("a", "b"))
def tearDown(self):
del self.graph
# Firstly import JunctionTree class
from pgmpy.models import JunctionTree
junction_tree = JunctionTree()
# Each node in the junction tree is a cluster of random variables
# represented as a tuple
junction_tree.add_nodes_from([('A', 'B', 'C'), ('C', 'D')])
junction_tree.add_edge(('A', 'B', 'C'), ('C', 'D'))
junction_tree.add_edge(('A', 'B', 'C'), ('D', 'E', 'F'))
class TestJunctionTreeCopy(unittest.TestCase):
def setUp(self):
self.graph = JunctionTree()
def test_copy_with_nodes(self):
self.graph.add_nodes_from([('a', 'b', 'c'), ('a', 'b'), ('a', 'c')])
self.graph.add_edges_from([(('a', 'b', 'c'), ('a', 'b')),
(('a', 'b', 'c'), ('a', 'c'))])
graph_copy = self.graph.copy()
self.graph.remove_edge(('a', 'b', 'c'), ('a', 'c'))
self.assertFalse(self.graph.has_edge(('a', 'b', 'c'), ('a', 'c')))
self.assertTrue(graph_copy.has_edge(('a', 'b', 'c'), ('a', 'c')))
self.graph.remove_node(('a', 'c'))
self.assertFalse(self.graph.has_node(('a', 'c')))
self.assertTrue(graph_copy.has_node(('a', 'c')))
self.graph.add_node(('c', 'd'))
self.assertTrue(self.graph.has_node(('c', 'd')))
self.assertFalse(graph_copy.has_node(('c', 'd')))
def test_copy_with_factors(self):
self.graph.add_edges_from([[('a', 'b'), ('b', 'c')]])
phi1 = Factor(['a', 'b'], [2, 2], np.random.rand(4))
phi2 = Factor(['b', 'c'], [2, 2], np.random.rand(4))
self.graph.add_factors(phi1, phi2)
graph_copy = self.graph.copy()
self.assertIsInstance(graph_copy, JunctionTree)
self.assertIsNot(self.graph, graph_copy)
self.assertEqual(hf.recursive_sorted(self.graph.nodes()),
hf.recursive_sorted(graph_copy.nodes()))
self.assertEqual(hf.recursive_sorted(self.graph.edges()),
hf.recursive_sorted(graph_copy.edges()))
self.assertTrue(graph_copy.check_model())
self.assertEqual(self.graph.get_factors(), graph_copy.get_factors())
self.graph.remove_factors(phi1, phi2)
self.assertTrue(phi1 not in self.graph.factors
and phi2 not in self.graph.factors)
self.assertTrue(phi1 in graph_copy.factors
and phi2 in graph_copy.factors)
self.graph.add_factors(phi1, phi2)
self.graph.factors[0] = Factor(['a', 'b'], [2, 2], np.random.rand(4))
self.assertNotEqual(self.graph.get_factors()[0],
graph_copy.get_factors()[0])
self.assertNotEqual(self.graph.factors, graph_copy.factors)
def test_copy_with_factorchanges(self):
self.graph.add_edges_from([[('a', 'b'), ('b', 'c')]])
phi1 = Factor(['a', 'b'], [2, 2], np.random.rand(4))
phi2 = Factor(['b', 'c'], [2, 2], np.random.rand(4))
self.graph.add_factors(phi1, phi2)
graph_copy = self.graph.copy()
self.graph.factors[0].reduce([('a', 0)])
self.assertNotEqual(self.graph.factors[0].scope(),
graph_copy.factors[0].scope())
self.assertNotEqual(self.graph, graph_copy)
self.graph.factors[1].marginalize(['b'])
self.assertNotEqual(self.graph.factors[1].scope(),
graph_copy.factors[1].scope())
self.assertNotEqual(self.graph, graph_copy)
def tearDown(self):
del self.graph
class TestJunctionTreeCopy(unittest.TestCase):
def setUp(self):
self.graph = JunctionTree()
def test_copy_with_nodes(self):
self.graph.add_nodes_from([('a', 'b', 'c'), ('a', 'b'), ('a', 'c')])
self.graph.add_edges_from([(('a', 'b', 'c'), ('a', 'b')),
(('a', 'b', 'c'), ('a', 'c'))])
graph_copy = self.graph.copy()
self.graph.remove_edge(('a', 'b', 'c'), ('a', 'c'))
self.assertFalse(self.graph.has_edge(('a', 'b', 'c'), ('a', 'c')))
self.assertTrue(graph_copy.has_edge(('a', 'b', 'c'), ('a', 'c')))
self.graph.remove_node(('a', 'c'))
self.assertFalse(self.graph.has_node(('a', 'c')))
self.assertTrue(graph_copy.has_node(('a', 'c')))
self.graph.add_node(('c', 'd'))
self.assertTrue(self.graph.has_node(('c', 'd')))
self.assertFalse(graph_copy.has_node(('c', 'd')))
def test_copy_with_factors(self):
self.graph.add_edges_from([[('a', 'b'), ('b', 'c')]])
phi1 = DiscreteFactor(['a', 'b'], [2, 2], np.random.rand(4))
phi2 = DiscreteFactor(['b', 'c'], [2, 2], np.random.rand(4))
self.graph.add_factors(phi1, phi2)
graph_copy = self.graph.copy()
self.assertIsInstance(graph_copy, JunctionTree)
self.assertIsNot(self.graph, graph_copy)
self.assertEqual(hf.recursive_sorted(self.graph.nodes()),
hf.recursive_sorted(graph_copy.nodes()))
self.assertEqual(hf.recursive_sorted(self.graph.edges()),
hf.recursive_sorted(graph_copy.edges()))
self.assertTrue(graph_copy.check_model())
self.assertEqual(self.graph.get_factors(), graph_copy.get_factors())
self.graph.remove_factors(phi1, phi2)
self.assertTrue(phi1 not in self.graph.factors and phi2 not in self.graph.factors)
self.assertTrue(phi1 in graph_copy.factors and phi2 in graph_copy.factors)
self.graph.add_factors(phi1, phi2)
self.graph.factors[0] = DiscreteFactor(['a', 'b'], [2, 2], np.random.rand(4))
self.assertNotEqual(self.graph.get_factors()[0], graph_copy.get_factors()[0])
self.assertNotEqual(self.graph.factors, graph_copy.factors)
def test_copy_with_factorchanges(self):
self.graph.add_edges_from([[('a', 'b'), ('b', 'c')]])
phi1 = DiscreteFactor(['a', 'b'], [2, 2], np.random.rand(4))
phi2 = DiscreteFactor(['b', 'c'], [2, 2], np.random.rand(4))
self.graph.add_factors(phi1, phi2)
graph_copy = self.graph.copy()
self.graph.factors[0].reduce([('a', 0)])
self.assertNotEqual(self.graph.factors[0].scope(), graph_copy.factors[0].scope())
self.assertNotEqual(self.graph, graph_copy)
self.graph.factors[1].marginalize(['b'])
self.assertNotEqual(self.graph.factors[1].scope(), graph_copy.factors[1].scope())
self.assertNotEqual(self.graph, graph_copy)
def tearDown(self):
del self.graph
