A General Framework for Anytime Approximation in Probabilistic Databases
arXiv: Databases, Volume abs/1806.10078, 2018.
Anytime approximation algorithms that compute the probabilities of queries over probabilistic databases can be of great use to statistical learning tasks. Those approaches have been based so far on either (i) sampling or (ii) branch-and-bound with model-based bounds. We present here a more general branch-and-bound framework that extends t...More
Full Text (Upload PDF)
PPT (Upload PPT)