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 datasets due to memory constraints. In this paper we use occurrences of entity-relation pairs in the dataset to construct a joint learning model and to increase the quality of sampled negatives during training. We show on three standard datasets that when these two techniques are combined, they give a significant improvement in performance, especially when the batch size and the number of generated negative examples are low relative to the size of the dataset. We then apply our techniques to a dataset containing 2 million entities and demonstrate that our model outperforms the baseline by 2.8% absolute on hits@1.

📄 PDF Abstract BibTeX arXiv:1910.11583

Code (0)

등록된 구현이 없습니다.

Tasks

Knowledge Graph Completion Link Prediction

Higher order co-occurrence tensors for hypergraphs via face-splitting

2020-02-15 · Bryan Bischof

A popular trick for computing a pairwise co-occurrence matrix is the product of an incidence matrix and its transpose. We present an analog for higher order tuple co-occurrences using the face-splitting product, or alter…

Pairwise Causality Guided Transformers for Event Sequences

2023-09-21 · NeurIPS 2023 11

Although pairwise causal relations have been extensively studied in observational longitudinal analyses across many disciplines, incorporating knowledge of causal pairs into deep learning models for temporal event sequen…

Keyphrase Extraction Using Neighborhood Knowledge Based on Word Embeddings

2021-11-13 · Yuchen Liang, Mohammed J. Zaki

Keyphrase extraction is the task of finding several interesting phrases in a text document, which provide a list of the main topics within the document. Most existing graph-based models use co-occurrence links as cohesio…

Keyphrase Extraction Word Embeddings

Table Integration in Data Lakes Unleashed: Pairwise Integrability Judgment, Integrable Set Discovery, and Multi-Tuple Conflict Resolution

2024-11-30 · Daomin Ji, Hui Luo, Zhifeng Bao, Shane Culpepper

Table integration aims to create a comprehensive table by consolidating tuples containing relevant information. In this work, we investigate the challenge of integrating multiple tables from a data lake, focusing on thre…

Community Detection Contrastive Learning Data Augmentation In-Context Learning

Node Co-occurrence based Graph Neural Networks for Knowledge Graph Link Prediction

2021-04-15 · Dai Quoc Nguyen, Vinh Tong, Dinh Phung, Dat Quoc Nguyen

We introduce a novel embedding model, named NoGE, which aims to integrate co-occurrence among entities and relations into graph neural networks to improve knowledge graph completion (i.e., link prediction). Given a knowl…