A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks
[article]
2013
arXiv
pre-print
Preserved Fulltext
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
arXiv:1304.1113v1
fatcat:dhp6qcdzubcbdderzcfb3sxz3e