Quantifying Similarity between Relations with Fact Distribution

by   Weize Chen, et al.
Tsinghua University
Carnegie Mellon University

We introduce a conceptually simple and effective method to quantify the similarity between relations in knowledge bases. Specifically, our approach is based on the divergence between the conditional probability distributions over entity pairs. In this paper, these distributions are parameterized by a very simple neural network. Although computing the exact similarity is in-tractable, we provide a sampling-based method to get a good approximation. We empirically show the outputs of our approach significantly correlate with human judgments. By applying our method to various tasks, we also find that (1) our approach could effectively detect redundant relations extracted by open information extraction (Open IE) models, that (2) even the most competitive models for relational classification still make mistakes among very similar relations, and that (3) our approach could be incorporated into negative sampling and softmax classification to alleviate these mistakes. The source code and experiment details of this paper can be obtained from https://github.com/thunlp/relation-similarity.


page 1

page 2

page 3

page 4


A Simple but Effective Bidirectional Extraction Framework for Relational Triple Extraction

Tagging based relational triple extraction methods are attracting growin...

UniRel: Unified Representation and Interaction for Joint Relational Triple Extraction

Relational triple extraction is challenging for its difficulty in captur...

A Comprehensive Study on Knowledge Graph Embedding over Relational Patterns Based on Rule Learning

Knowledge Graph Embedding (KGE) has proven to be an effective approach t...

Exploiting Non-Taxonomic Relations for Measuring Semantic Similarity and Relatedness in WordNet

Various applications in the areas of computational linguistics and artif...

Maximally Consistent Sampling and the Jaccard Index of Probability Distributions

We introduce simple, efficient algorithms for computing a MinHash of a p...

Integrating Relation Constraints with Neural Relation Extractors

Recent years have seen rapid progress in identifying predefined relation...

PADS: Policy-Adapted Sampling for Visual Similarity Learning

Learning visual similarity requires to learn relations, typically betwee...

Please sign up or login with your details

Forgot password? Click here to reset