paper-with-me

홈 › Papers

Prior Bilinear Based Models for Knowledge Graph Completion

2023-09-25 · Jiayi Li, Ruilin Luo, Jiaqi Sun, Jing Xiao, Yujiu Yang

Bilinear based models are powerful and widely used approaches for Knowledge Graphs Completion (KGC). Although bilinear based models have achieved significant advances, these studies mainly concentrate on posterior properties (based on evidence, e.g. symmetry pattern) while neglecting the prior properties. In this paper, we find a prior property named "the law of identity" that cannot be captured by bilinear based models, which hinders them from comprehensively modeling the characteristics of KGs. To address this issue, we introduce a solution called Unit Ball Bilinear Model (UniBi). This model not only achieves theoretical superiority but also offers enhanced interpretability and performance by minimizing ineffective learning through minimal constraints. Experiments demonstrate that UniBi models the prior property and verify its interpretability and performance.

📄 PDF Abstract BibTeX arXiv:2309.13834

Code (1)

lrlbbzl/unibi_ogb 공식 구현 pytorch

Tasks

Knowledge Graph CompletionKnowledge Graphs

Similar Papers 제목 키워드 기반

ProjB: An Improved Bilinear Biased ProjE model for Knowledge Graph Completion

2022-08-15 · Mojtaba Moattari, Sahar Vahdati, Farhana Zulkernine

Knowledge Graph Embedding (KGE) methods have gained enormous attention from a wide range of AI communities including Natural Language Processing (NLP) for text generation, classification and context induction. Embedding …

Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge Graphs+1

On Multi-Relational Link Prediction with Bilinear Models

2017-09-14 · Yanjie Wang, Rainer Gemulla, Hui Li

We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train an…

Knowledge Graph CompletionLink PredictionPrediction

LowFER: Low-rank Bilinear Pooling for Link Prediction

2020-08-25 · ICML 2020 1 · Saadullah Amin, Stalin Varanasi, Katherine Ann Dunfield, Günter Neumann

Knowledge graphs are incomplete by nature, with only a limited number of observed facts from the world knowledge being represented as structured relations between entities. To partly address this issue, an important task…

Knowledge Graph CompletionKnowledge GraphsLink PredictionPrediction+2

HyperKG: Hyperbolic Knowledge Graph Embeddings for Knowledge Base Completion

2019-08-14 · Prodromos Kolyvakis, Alexandros Kalousis, Dimitris Kiritsis

Learning embeddings of entities and relations existing in knowledge bases allows the discovery of hidden patterns in data. In this work, we examine the geometrical space's contribution to the task of knowledge base compl…

Knowledge Base CompletionKnowledge Graph EmbeddingsLink Prediction

Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets

2019-10-25 · IJCNLP 2019 11 · Esma Balkir, Masha Naslidnyk, Dave Palfrey, Arpit Mittal

Bilinear models such as DistMult and ComplEx are effective methods for knowledge graph (KG) completion. However, they require large batch sizes, which becomes a performance bottleneck when training on large scale dataset…

Knowledge Graph CompletionLink Prediction