Search Algorithms for M Best Solutions for Graphical Models

Proceedings of the 26th AAAI Conference on Artificial Intelligence, AAAI 2012

Volumn , Issue , 2012, Pages 1895-1901

  Dechter, Rina ^a   Flerova, Natalia ^a   Marinescu, Radu ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM RESEARCH   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; CONSTRAINT SATISFACTION PROBLEMS; GRAPHIC METHODS;

BRANCH AND BOUND SEARCH; BRANCH AND BOUNDS; COMBINATORIAL OPTIMIZATION PROBLEMS; DEPTH FIRST; GRAPHICAL MODEL; MEMORY EFFICIENT; MEMORY PROBLEMS; OPTIMAL EFFICIENCY; PROPERTY; SEARCH ALGORITHMS;

BAYESIAN NETWORKS;

EID: 85167403242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Aljazzar, H., and Leue, S. 2011. K: A heuristic search algorithm for finding the k shortest paths. Artificial Intelligence 175(18):2129-2154.
2. Charniak, E., and Shimony, S. 1994. Cost-based abduction and map explanation. Artificial Intelligence 66(2):345-374.
3. Dechter, R., and Mateescu, R. 2007. AND/OR search spaces for graphical models. Artificial Intelligence 171(2-3):73-106.
4. Dechter, R., and Pearl, J. 1985. Generalized best-first search strategies and the optimality of A*. Journal of the ACM 32:506-536.
5. Dechter, R., and Rish, I. 2003. Mini-buckets: A general scheme for bounded inference. Journal of the ACM 50(2):107-153.
6. Elliott, P. 2007. Extracting the K Best Solutions from a Valued And-Or Acyclic Graph. Master's thesis, Massachusetts Institute of Technology.
7. Flerova, N.; Dechter, R.; and Rollon, E. 2011. Bucket and mini-bucket schemes for m best solutions over graphical models. In Graph structures for knowledge representation and reasoning workshop.
8. Kask, K., and Dechter, R. 2001. A general scheme for automatic search heuristics from specification dependencies. Artificial Intelligence 129(1-2):91-131.
9. Kask, K.; Gefland, A.; Otten, L.; and Dechter, R. 2011. Pushing the power of stochastic greedy ordering schemes for inference in graphical models. In 25th Conference on Artificial Intelligence (AAAI), 54-60.
10. Lawler, E. 1972. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science 18(7):401-405.
11. Marinescu, R., and Dechter, R. 2009a. AND/OR Branch- and-Bound search for combinatorial optimization in graphical models. Artificial Intelligence 173(16-17):1457-1491.
12. Marinescu, R., and Dechter, R. 2009b. Memory intensive AND/OR search for combinatorial optimization in graphical models. Artificial Intelligence 173(16-17):1492-1524.
13. Nillson, N. J. 1980. Principles of Artificial Intelligence. Tioga, Palo Alto, CA.
14. Nilsson, D. 1998. An efficient algorithm for finding the M most probable configurations in probabilistic expert systems. Statistics and Computing 8(2):159-173.
15. Pearl, J., and Korf, R. 1987. Search techniques. Annual Reviews of Computer Science 2:451-467.
16. Schiex, T. 2000. Arc consistency for soft constraints. International Conference on Principles and Practice of Constraint Programming (CP) 411-424.
17. Seroussi, B., and Golmard, J. 1994. An algorithm directly finding the K most probable configurations in Bayesian networks. International Journal of Approximate Reasoning 11(3):205-233.
18. Yanover, C., and Weiss, Y. 2004. Finding the M Most Probable Configurations Using Loopy Belief Propagation. In Advances in Neural Information Processing Systems 16. The MIT Press.