Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
Jiewen Huang , Oxford University Computing Laboratory, OX1 3QD, UK
Dan Olteanu , Oxford University Computing Laboratory, OX1 3QD, UK
This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variables. The algorithm is based on an incremental compilation of formulas into decision diagrams using three types of decompositions: Shannon expansion, independence partitioning, and product factorization. With each decomposition step, lower and upper bounds on the probability of the partially compiled formula can be quickly computed and checked against the allowed error.
Jiewen Huang, Dan Olteanu, "Approximate confidence computation in probabilistic databases", ICDE, 2010, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013 IEEE 29th International Conference on Data Engineering (ICDE) 2010, pp. 145-156, doi:10.1109/ICDE.2010.5447826