Complexity Results and Approximation Strategies for MAP Explanations
暂无分享,去创建一个
[1] Michael Luby,et al. An Optimal Approximation Algorithm for Bayesian Inference , 1997, Artif. Intell..
[2] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..
[3] Seinosuke Toda,et al. PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..
[4] Rina Dechter,et al. Mini-buckets: a general scheme for approximating inference , 2002 .
[5] Adnan Darwiche,et al. Inference in belief networks: A procedural guide , 1996, Int. J. Approx. Reason..
[6] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[7] Adnan Darwiche,et al. Recursive conditioning , 2001, Artif. Intell..
[8] Adnan Darwiche,et al. A differential semantics for jointree algorithms , 2002, Artif. Intell..
[9] Toniann Pitassi,et al. Stochastic Boolean Satisfiability , 2001, Journal of Automated Reasoning.
[10] Adnan Darwiche,et al. A differential approach to inference in Bayesian networks , 2000, JACM.
[11] Rina Dechter,et al. Stochastic local search for Bayesian network , 1999, AISTATS.
[12] José A. Gámez,et al. Partial abductive inference in Bayesian belief networks using a genetic algorithm , 1999, Pattern Recognit. Lett..
[13] R. Dechter,et al. Stochastic Local Search for Bayesian Networks , 1999 .
[14] Rina Dechter,et al. Bucket elimination: A unifying framework for probabilistic inference , 1996, UAI.
[15] Michael L. Littman,et al. The Computational Complexity of Probabilistic Planning , 1998, J. Artif. Intell. Res..
[16] Dan Roth,et al. On the Hardness of Approximate Reasoning , 1993, IJCAI.
[17] Michael I. Jordan,et al. Loopy Belief Propagation for Approximate Inference: An Empirical Study , 1999, UAI.
[18] Prakash P. Shenoy,et al. Propagating Belief Functions with Local Computations , 1986, IEEE Expert.
[19] Solomon Eyal Shimony,et al. Finding MAPs for Belief Networks is NP-Hard , 1994, Artif. Intell..
[20] D. C. Wilkins,et al. Stochastic Greedy Search: Efficiently Computing a Most Probable Explanation in Bayesian Networks , 2000 .
[21] Uue Kjjrull. Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .
[22] Michael L. Littman,et al. Initial Experiments in Stochastic Satisfiability , 1999, AAAI/IAAI.
[23] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .
[24] W. Freeman,et al. Generalized Belief Propagation , 2000, NIPS.