2013/03/27 by Solomon Eyal Shimony, Shimony, Solomon Eyal, Eugene Charniak +1 · 1 citation
Computer Science · #Bayesian Modeling and Causal Inference #Logic, Reasoning, and Knowledge #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.1304.1093
We present a new algorithm for finding maximum a-posterior) (MAP) assignments of values to belief networks. The belief network is compiled into a network consisting only of nodes with boolean (i.e. only 0 or 1) conditional probabilities. The MAP assignment is then found using a best-first search on the resulting network. We argue that, as one would anticipate, the algorithm is exponential for the general case, but only linear in the size of the network for poly trees.