Dynamic weighting A* search-based MAP algorithm for Bayesian networks

Authors:
Xiaoxun Sun;Marek J. Druzdzel;Changhe Yuan
Affiliations:
Computer Science Department, University of Southern California, Los Angeles, CA;Decision Systems Laboratory, School of Information Sciences & University of Pittsburgh, Pittsburgh, PA;Department of Computer Science and Engineering, Mississippi State University, MS
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 6
Cited 4

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Decision-theoretic troubleshooting

Communications of the ACM
Approximating MAP using Local Search

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Annealed MAP

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
MAP complexity results and approximation methods

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Solving MAP exactly using systematic search

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence

Finding Minimum Data Requirements Using Pseudo-independence

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Simple optimization techniques for A*-based search

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Efficient computation of jointree bounds for systematic MAP search

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A markov random field framework for protein side-chain resonance assignment

RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose the Dynamic Weighting A* (DWA*) search algorithm for solving MAP problems in Bayesian networks. By exploiting asymmetries in the distribution of MAP variables, the algorithm is able to greatly reduce the search space and offer excellent performance both in terms of accuracy and efficiency.