Corpus ID: 1027634

Random Algorithms for the Loop Cutset Problem

@article{Becker1999RandomAF,
  title={Random Algorithms for the Loop Cutset Problem},
  author={Ann Becker and Reuven Bar-Yehuda and Dan Geiger},
  journal={ArXiv},
  year={1999},
  volume={abs/1408.1483}
}
  • Ann Becker, Reuven Bar-Yehuda, Dan Geiger
  • Published in UAI 1999
  • Mathematics, Computer Science
  • ArXiv
  • We show how to find a minimum loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in Pearl's method of conditioning for inference. Our random algorithm for finding a loop cutset, called REPEATEDWGUESSI, out - puts a minimum loop cutset, after O(c.6kkn) steps, with probability at least 1 - (1 - 1/6k)c6k, where c > 1 is a constant specified by the user, k is the size of a minimum weight loop cutset, and n is the number of vertices. We also show… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 23 CITATIONS

    Bayesian Networks

    • Adnan Darwiche
    • Mathematics, Computer Science
    • Handbook of Knowledge Representation
    • 2008
    VIEW 1 EXCERPT
    CITES BACKGROUND

    Cutset Sampling for Bayesian Networks

    VIEW 1 EXCERPT
    CITES METHODS

    Faster algorithms for feedback vertex set

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES

    Schaffer -!"- · ft:. · Au ­ tomatic selection of loop breakers for genettc lmkage analysis

    • A. Becker, D. Geiger
    • Human Heredity
    • 1998

    A note on approximation of the ver­ tex cover and feedback vertex set problems - Unified approach, Information

    • T. to
    • Processing Letters,
    • 1996

    A note on approximation of the ver ­ tex cover and feedback vertex set problems - Unified approach

    • R. Downey, M. Fellows
    • Parameterized Computational Feasibility
    • 1995