论文信息 - On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks

On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks

We introduce a new heuristic algorithm for the problem of finding minimum size loop cutsets in multiply connected belief networks. We compare this algorithm to that proposed in [Suemmondt and Cooper, 1988]. We provide lower bounds on the performance of these algorithms with respect to one another and with respect to optimal. We demonstrate that no heuristic algorithm for this problem cam be guaranteed to produce loop cutsets within a constant difference from optimal. We discuss experimental results based on randomly generated networks, and discuss future work and open questions.

Jonathan Stillman | J. Stillman

[1] A. Hasman,et al. Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .

[2] S. Wright. The Method of Path Coefficients , 1934 .

[3] Nicholas Rescher,et al. Plausible reasoning , 1976 .

[4] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[5] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[6] J. L. O'Neill. Plausible Reasoning , 1987, Aust. Comput. J..

[7] Behzad Parviz,et al. On heuristics for finding loop cutsets in multiply-connected belief networks , 1990, UAI.