Anytime Approximation in Probabilistic Databases via Scaled Dissociations
Proceedings of the 2019 International Conference on Management of Data, pp. 1295-1312, 2019.
anytime algorithms approximate inference probabilistic databases query processing
Speeding up probabilistic inference remains a key challenge in probabilistic databases (PDBs) and the related area of statistical relational learning (SRL). Since computing probabilities for query answers is #P-hard, even for fairly simple conjunctive queries, both the PDB and SRL communities have proposed a number of approximation techni...More
Full Text (Upload PDF)
PPT (Upload PPT)