Feng Niu, Christopher Re, AnHai Doan & Jude Shavlik (2011).
Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS. Proceedings of the 37th International Conference on Very Large Data Bases (VLDB 2011), Seattle, Washington.
Slides (PPTX).

This publication is available in PDF.

The slides for this publication are available in Microsoft PowerPoint.

Abstract:

Markov Logic Networks (MLNs) have emerged as a powerful framework that combines statistical and logical reasoning; they have been applied to many data intensive problems including information extraction, entity resolution, and text mining. Current implementations of MLNs do not scale to large real-world data sets, which is preventing their widespread adoption. We present Tuffy that achieves scalability via three novel contributions: (1) a bottom-up approach to grounding that allows us to leverage the full power of the relational optimizer, (2) a novel hybrid architecture that allows us to perform AI-style local search efficiently using an RDBMS, and (3) a theoretical insight that shows when one can (exponentially) improve the efficiency of stochastic local search. We leverage (3) to build novel partitioning, loading, and parallel algorithms. We show that our approach outperforms state-of-the-art implementations in both quality and speed on several publicly available datasets.

Return to the publications of the Univ. of Wisconsin Machine Learning Research Group.