Tree clustering for constraint networks (research note)
Artificial Intelligence
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Valuation-based systems for discrete optimisation
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
A differential approach to inference in Bayesian networks
Journal of the ACM (JACM)
A differential semantics for jointree algorithms
Artificial Intelligence
Inference in the Promedas Medical Expert System
AIME '07 Proceedings of the 11th conference on Artificial Intelligence in Medicine
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Lattice duality: The origin of probability and entropy
Neurocomputing
Loopy belief propagation for approximate inference: an empirical study
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Constructing free-energy approximations and generalized belief propagation algorithms
IEEE Transactions on Information Theory
GraphChi: large-scale graph computation on just a PC
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Hi-index | 0.00 |
In this paper, we consider the inclusion-exclusion rule - a known yet seldom used rule of probabilistic inference. Unlike the widely used sum rule which requires easy access to all joint probability values, the inclusion-exclusion rule requires easy access to several marginal probability values. We therefore develop a new representation of the joint distribution that is amenable to the inclusion-exclusion rule. We compare the relative strengths and weaknesses of the inclusion-exclusion rule with the sum rule and develop a hybrid rule called the inclusion-exclusion-sum (IES) rule, which combines their power. We apply the IES rule to junction trees, treating the latter as a target for knowledge compilation and show that in many cases it greatly reduces the time required to answer queries. Our experiments demonstrate the power of our approach. In particular, at query time, on several networks, our new scheme was an order of magnitude faster than the junction tree algorithm.