When triangulating a belief network we aim to obtain a junction tree of minimum state space. Searching for the optimal triangulation can be cast as a search over all the permutations of the network's vaeriables. Our approach is to embed the discrete set of permutations in a convex continuous domain D. By suitably extending the cost function over D and solving the continous nonlinear optimization task we hope to obtain a good triangulation with respect to the aformentioned cost. In this paper we introduce an upper bound to the total junction tree weight as the cost function. The appropriatedness of this choice is discussed and explored by simulations. Then we present two ways of embedding the new objective function into continuous domains and show that they perform well compared to the best known heuristic.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/7176 |
| Date | 01 March 1997 |
| Creators | Meila, Marina, Jordan, Michael I. |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 6 p., 1326120 bytes, 3467744 bytes, application/postscript, application/pdf |
| Relation | AIM-1605, CBCL-146 |
Page generated in 0.1983 seconds