Analogical Inference for Multi-Relational Embeddings
arXiv:1705.02426
Abstract
Large-scale multi-relational embedding refers to the task of learning the latent representations for entities and relations in large knowledge graphs. An effective and scalable solution for this problem is crucial for the true success of knowledge-based inference in a broad range of applications. This paper proposes a novel framework for optimizing the latent representations with respect to the \textit{analogical} properties of the embedded entities and relations. By formulating the learning objective in a differentiable fashion, our model enjoys both theoretical power and computational scalability, and significantly outperformed a large number of representative baseline methods on benchmark datasets. Furthermore, the model offers an elegant unification of several well-known methods in multi-relational embedding, which can be proven to be special instantiations of our framework.
References in corpus (2)
Cited by in corpus (41)
- A Survey on Knowledge Graphs: Representation, Acquisition and Applications
- A Benchmarking Study of Embedding-based Entity Alignment for Knowledge Graphs
- Hypernetwork Knowledge Graph Embeddings
- Knowledge Graph Augmented Network Towards Multiview Representation Learning for Aspect-based Sentiment Analysis
- Representation Learning for Dynamic Graphs: A Survey
- Relation Embedding with Dihedral Group in Knowledge Graph
- Recommender systems based on graph embedding techniques: A comprehensive review
- Ultrahyperbolic Knowledge Graph Embeddings
- Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction
- Knowledge Representation Learning: A Quantitative Review
- Faithful Embeddings for Knowledge Base Queries
- HyperKG: Hyperbolic Knowledge Graph Embeddings for Knowledge Base Completion
- Dynamic Parameter Allocation in Parameter Servers
- Knowledge Graph Embedding with Entity Neighbors and Deep Memory Network
- Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction
- Knowledge Graph Embeddings and Explainable AI
- Interpreting Embedding Models of Knowledge Bases: A Pedagogical Approach
- Logic Attention Based Neighborhood Aggregation for Inductive Knowledge Graph Embedding
- AutoSF: Searching Scoring Functions for Knowledge Graph Embedding
- Adaptive Attentional Network for Few-Shot Knowledge Graph Completion
- On Evaluating Embedding Models for Knowledge Base Completion
- Joint Embedding Learning of Educational Knowledge Graphs
- A Re-evaluation of Knowledge Graph Completion Methods
- On the Ambiguity of Rank-Based Evaluation of Entity Alignment or Link Prediction Methods
- A Survey of Knowledge Graph Embedding and Their Applications
- WikiDataSets: Standardized sub-graphs from Wikidata
- Relation Adversarial Network for Low Resource Knowledge Graph Completion
- SCEF: A Support-Confidence-aware Embedding Framework for Knowledge Graph Refinement
- Searching to Sparsify Tensor Decomposition for N-ary Relational Data
- Path-based knowledge reasoning with textual semantic information for medical knowledge graph completion
- Binarized Knowledge Graph Embeddings
- Beyond Markov Logic: Efficient Mining of Prediction Rules in Large Graphs
- Neural Latent Relational Analysis to Capture Lexical Semantic Relations in a Vector Space
- Good Intentions: Adaptive Parameter Management via Intent Signaling
- Text-guided Legal Knowledge Graph Reasoning
- MOHONE: Modeling Higher Order Network Effects in KnowledgeGraphs via Network Infused Embeddings
- Leveraging Semantics for Incremental Learning in Multi-Relational Embeddings
- Learning Embeddings that Capture Spatial Semantics for Indoor Navigation
- A Non-commutative Bilinear Model for Answering Path Queries in Knowledge Graphs
- A Literature Review of Recent Graph Embedding Techniques for Biomedical Data
- A Knowledge Enhanced Learning and Semantic Composition Model for Multi-Claim Fact Checking