Probabilistic Similarity Logic

Abstract

Many machine learning applications require the ability to learn from and reason about noisy multi-relational data. To address this, several effective representations have been developed that provide both a language for expressing the structural regularities of a domain, and principled support for probabilistic inference. In addition to these two aspects, however, many applications also involve a third aspect-the need to reason about similarities-which has not been directly supported in existing frameworks. This paper introduces probabilistic similarity logic (PSL), a general-purpose framework for joint reasoning about similarity in relational domains that incorporates probabilistic reasoning about similarities and relational structure in a principled way. PSL can integrate any existing domain-specific similarity measures and also supports reasoning about similarities between sets of entities. We provide efficient inference and learning techniques for PSL and demonstrate its effectiveness both in common relational tasks and in settings that require reasoning about similarity.

Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)

References in corpus (2)

• Bayesian Logic Programs
• Improving the Accuracy and Efficiency of MAP Inference for Markov Logic

Cited by in corpus (19)

• Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning
• Hinge-loss Markov Random Fields: Convex Inference for Structured Prediction
• kLog: A Language for Logical and Relational Learning with Kernels
• 'Beating the news' with EMBERS: Forecasting Civil Unrest using Open Source Indicators
• TensorLog: Deep Learning Meets Probabilistic DBs
• Estimating Accuracy from Unlabeled Data: A Probabilistic Logic Approach
• Logic Rules Powered Knowledge Graph Embedding
• Neural Graph Embedding Methods for Natural Language Processing
• Reasoning about Unmodelled Concepts - Incorporating Class Taxonomies in Probabilistic Relational Models
• Enriching a Model's Notion of Belief using a Persistent Memory
• Representing Meaning with a Combination of Logical and Distributional Models
• Tuning Fuzzy Logic Programs with Symbolic Execution
• Non-Parametric Learning of Gaifman Models
• On the Semantic Relationship between Probabilistic Soft Logic and Markov Logic
• Growing a Tree in the Forest: Constructing Folksonomies by Integrating Structured Metadata
• KGEval: Estimating Accuracy of Automatically Constructed Knowledge Graphs
• Modeling Drug-Disease Relations with Linguistic and Knowledge Graph Constraints
• DomiKnowS: A Library for Integration of Symbolic Domain Knowledge in Deep Learning
• Measuring Asymmetric Opinions on Online Social Interrelationship with Language and Network Features