Approximation Algorithms for the Loop Cutset Problem
Ann Becker, Dan Geiger
Abstract:
We show how to find a small loop curser in a Bayesian network. Finding such a loop cutset is the first step in the method of conditioning for inference. Our algorithm for finding a loop cutset, called MGA, finds a loop cutset which is guaranteed in the worst case to contain less than twice the number of variables contained in a minimum loop cutset. We test MGA on randomly generated graphs and find that the average ratio between the number of instances associated with the algorithms' output and the number of instances associated with a minimum solution is 1.22.
Keywords:
Pages: 6068
PS Link:
PDF Link: /papers/94/p60becker.pdf
BibTex:
@INPROCEEDINGS{Becker94,
AUTHOR = "Ann Becker
and Dan Geiger",
TITLE = "Approximation Algorithms for the Loop Cutset Problem",
BOOKTITLE = "Proceedings of the Tenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI94)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1994",
PAGES = "6068"
}

