Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Optimization
Cost-based abduction and MAP explanation
Artificial Intelligence
Advances in knowledge discovery and data mining
Advances in knowledge discovery and data mining
A new admissible heuristic for minimal-cost proofs
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
An alternative Markov property for chain graphs
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
FlexiMine – A Flexible Platform for KDD Research and Application Development
Annals of Mathematics and Artificial Intelligence
Set-structured and cost-sharing heuristics for classical planning
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
Bayesian knowledge bases (BKBs) are a generalization of Bayes networks and weighted proof graphs (WAODAGs), that allow cycles in the causal graph. Reasoning in BKBs requires finding the most probable inferences consistent with the evidence. The costsharing heuristic for finding least-cost explanations in WAODAGs was presented and shown to be effective by Charniak and Husain. However, the cycles in BKBs would make the definition of cost-sharing cyclic as well, if applied directly to BKBs. By treating the defining equations of cost-sharing as a system of equations, one can properly define an admissible cost-sharing heuristic for BKBs. Empirical evaluation shows that costsharing improves performance significantly when applied to BKBs.