Solving MAP Exactly using Systematic Search

@inproceedings{Park2003SolvingME,
  title={Solving MAP Exactly using Systematic Search},
  author={James D. Park and Adnan Darwiche},
  booktitle={UAI},
  year={2003}
}
MAP is the problem of finding a most probable instantiation of a set of variables in a Bayesian network, given some partial evidence about the complement of that set. Unlike posterior probabilities, or MPE (a special case of MAP), the time and space complexity of structure–based algorithms for MAP are not only exponential in the network treewidth, but in a larger parameter known as the constrained treewidth. In practice, this means that computing MAP can be orders of magnitude more expensive… CONTINUE READING
Highly Cited
This paper has 75 citations. REVIEW CITATIONS
51 Citations
10 References
Similar Papers

Citations

Publications citing this paper.

75 Citations

051015'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 75 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…