Randomized Algorithms for the Loop Cutset Problem

Journal of Artificial Intelligence Research

Volumn 12, Issue , 2000, Pages 219-

  Becker, Ann ^a   Bar Yehuda, Reuven ^a   Geiger, Dan ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14344273985     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.638     Document Type: Article

References (32)

1. Bafna, V., Berman, P., & Fujito, T. (1995). Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In Proceedings of the Sixth Annual Symposium on Algorithms and Computation (ISAAC95), pp. 142-151.
2. Bar-Yehuda, R., Geiger, D., Naor, J., & Roth, R. (1994). Approximation algorithms for the feedback vertex set problems with applications to constraint satisfaction and Bayesian inference. In Proceedings of the 5th Annual ACM-Siam Symposium On Discrete Algorithms, pp. 344-354.
3. Becker, A., & Geiger, D. (1994). Approximation algorithms for the loop cutset problem. In Proceedings of the 10th conference on Uncertainty in Artificial Intelligence, pp. 60-68.
4. Becker, A., & Geiger, D. (1996). Optimization of pearl's method of conditioning and greedy-like approximation algorithms for the feedback vertex set problem. Artificial Intelligence, 83, 167-188.
5. Becker, A., Geiger, D., & Schaffer, A. (1998). Automatic selection of loop breakers for genetic linkage analysis. Human Heredity, 48, 47-60.
6. Bodlaender, H. (1990). On disjoint cycles. International Journal of Foundations of Computer Science (IJFCS), 5, 59-68.
7. Breese, J., & Horvitz, E. (1990). Ideal reformulation of belief netwroks. In Proceedings of the 6th conference on Uncertainty in Artificial Intelligence, pp. 64-72.
8. Darwiche, A. (1994). c-bounded conditioning: A method for the approximate updating of causal networks. Research note, Rockwell Science Center.
9. Dechter, R. (1990). Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artificial Intelligence, 41, 273-312.
10. Dechter, R. (1999). Bucket elimination: A unifying framework for structure-driven inference. Artificial Intelligence, To appear.
11. Downey, R., & Fellows, M. (1995a). Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24(4), 873-921.
12. Downey, R., & Fellows, M. (1995b). Parameterized computational feasibility. In P. Clote, . J. R. (Ed.), Feasible Mathematics II, pp. 219-244. Birkhauser, Boston.
13. Fujito, T. (1996). A note on approximation of the vertex cover and feedback vertex set problems - unified approach. Information Processing Letters, 59, 59-63.
14. Garey, M., & Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, California.
15. Geiger, D., & Pearl, J. (1990). On the logic of causal models. In Uncertainty in Artificial Intelligence 4, pp. 3-14 New York. North-Holland.
16. Geiger, D., Verma, T., & Pearl, J. (1990). Identifying independence in bayesian networks. Networks, 20, 507-534.
17. Horvitz, E. J. (1990). Computation and action under bounded resources. Ph.D dissertation, Stanford university.
18. Horvitz, E. J., Suermondt, H. J., & Cooper, G. H. (1989). Bounded conditioning: Flexible inference for decisions under scarce resources. In Proceedings of 5th conference on Uncertainty in Artificial Intelligence, pp. 182-193. Morgan Kaufmann.
19. Jensen, F., Lauritzen, S. L., & Olsen, K. (1990a). Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quarterly, 4, 269-282.
20. Jensen, F., Olsen, K., & Andersen, S. (1990b). An algebra of bayesian belief universes for knowledge-based systems. Networks, 20, 637-659.
21. Kim, H., & Pearl, J. (1983). A computational model for combined causal and diagnostic reasoning in inference systems. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence (IJCAI83), pp. 190-193.
22. Lang, K. (1997). Mathematical and statistical methods for genetic analysis. Springer.
23. Lange, K., & Elston, R. (1975). Extensions to pedigree analysis. I. likelihood calculation for simple and complex pedigrees. Human Heredity, 25, 95-105.
24. Lauritzen, S., & Spiegelhalter, D. (1988). Local computations with probabilities on graphical structures and their application to expert systems (with discussion). Journal Royal Statistical Society, B, 50, 157-224.
25. Ott, J. (1991). Analysis of human genetic linkage (revised edition). The Johns Hopkins University Press.
26. Pearl, J. (1986). Fusion, propagation and structuring in belief networks. Artificial Intelligence, 29, 241-288.
27. Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Mateo, California.
28. Peot, M., & Shachter, R. (1991). Fusion and propagation with multiple observations in belief networks. Artificial Intelligence, 48, 299-318.
29. Shachter, R., Andersen, S., & Szolovits, P. (1994). Global conditioning for probabilistic inference in belief networks. In Proceedings of the tenth conference on Uncertainty in Artificial Intelligence, pp. 514-522. Morgan Kaufmann.
30. Suermondt, H., & Cooper, G. (1990). Probabilistic inference in multiply connected belief networks using loop cutsets. International Journal of Approximate Reasoning, 4, 283-306.
31. Verma, T., & Pearl, J. (1988). Causal networks: Semantics and expressiveness. In Proceedings of 4th Workshop on Uncertainty in Artificial Intelligence, pp. 352-359.
32. Voss, H. (1968). Some properties of graphs containing k independent circuits. In Proceedings of Colloquium Tihany, pp. 321-334 New York. Academic Press.