Dynamic Weighting A* Search-Based MAP Algorithm for Bayesian Networks
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.
Cite
Text
Sun et al. "Dynamic Weighting A* Search-Based MAP Algorithm for Bayesian Networks." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Sun et al. "Dynamic Weighting A* Search-Based MAP Algorithm for Bayesian Networks." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/sun2007ijcai-dynamic/)BibTeX
@inproceedings{sun2007ijcai-dynamic,
title = {{Dynamic Weighting A* Search-Based MAP Algorithm for Bayesian Networks}},
author = {Sun, Xiaoxun and Druzdzel, Marek J. and Yuan, Changhe},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {2385-2390},
url = {https://mlanthology.org/ijcai/2007/sun2007ijcai-dynamic/}
}