Computer Science – Databases
Scientific paper
2011-04-16
Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 6, pp. 373-384 (2011)
Computer Science
Databases
VLDB2011
Scientific paper
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 wide-spread 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.
Doan AnHai
Niu Feng
Re Christopher
Shavlik Jude
No associations
LandOfFree
Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-347000