Anytime Approximation in Probabilistic Databases via Scaled Dissociations

Maarten Van den Heuvel
Maarten Van den Heuvel
Peter Ivanov
Peter Ivanov
Wolfgang Gatterbauer
Wolfgang Gatterbauer
Martin Theobald
Martin Theobald

Proceedings of the 2019 International Conference on Management of Data, pp. 1295-1312, 2019.

Cited by: 2|Bibtex|Views7|Links
EI
Keywords:
anytime algorithms approximate inference probabilistic databases query processing

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments