KGBoost: A Classification-based Knowledge Base Completion Method with Negative Sampling
Not on the map. Why?
Abstract (arXiv)
Knowledge base completion is formulated as a binary classification problem in this work, where an XGBoost binary classifier is trained for each relation using relevant links in knowledge graphs (KGs). The new method, named KGBoost, adopts a modularized design and attempts to find hard negative samples so as to train a powerful classifier for missing link prediction. We conduct experiments on multiple benchmark datasets, and demonstrate that KGBoost outperforms state-of-the-art methods across most datasets. Furthermore, as compared with models trained by end-to-end optimization, KGBoost works well under the low-dimensional setting so as to allow a smaller model size.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 14 of its 29 references that are in the map. First posted on arXiv 17 Dec 2021.
Builds on
14 of 29 references.
References · 14
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 932
- 2016Complex Embeddings for Simple Link Predictioncited by 902
- 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 898
- 2017Convolutional 2D Knowledge Graph Embeddingscited by 730
- 2020A Survey on Knowledge Graphs: Representation, Acquisition and Applicationscited by 643
- 2019Quaternion Knowledge Graph Embeddingscited by 175
- 2018End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completioncited by 136
- 2017KBGAN: Adversarial Learning for Knowledge Graph Embeddingscited by 62
- 2013A Semantic Matching Energy Function for Learning with Multi-relational Datacited by 61
- 2019InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactionscited by 58
- 2019Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embeddingcited by 38
2 more
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 3; 2025: 0; 2026: 1.
10 papers.
- 2022Green Learning: Introduction, Examples and Outlookcited by 30
- 2023An Overview on Language Models: Recent Developments and Outlookcited by 22
- 2024Time Sensitive Knowledge Editing through Efficient Finetuningcited by 14
- 2021CORE: A Knowledge Graph Entity Type Prediction Method via Complex Space Regression and Embeddingcited by 10
- 2022CompoundE: Knowledge Graph Embedding with Translation, Rotation and Scaling Compound Operationscited by 10
- 2022GreenKGC: A Lightweight Knowledge Graph Completion Methodcited by 9
- 2024Negative Sampling in Knowledge Graph Representation Learning: A Reviewcited by 9
- 2023Knowledge Graph Embedding with 3D Compound Geometric Transformationscited by 3
- 2024Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Modelscited by 0
- 2026Plausibility-Driven Prioritization of Candidate Biomedical Annotationscited by 0
- 2026Plausibility-Driven Prioritization of Candidate Biomedical Annotations22 Jul 2026
- 2024Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models22 Nov 2024
- 2024Time Sensitive Knowledge Editing through Efficient Finetuning6 Jun 2024
- 2024Negative Sampling in Knowledge Graph Representation Learning: A Review29 Feb 2024
- 2023Knowledge Graph Embedding with 3D Compound Geometric Transformations1 Apr 2023
- 2023An Overview on Language Models: Recent Developments and Outlook10 Mar 2023
- 2022Green Learning: Introduction, Examples and Outlook3 Oct 2022
- 2022GreenKGC: A Lightweight Knowledge Graph Completion Method19 Aug 2022
- 2022CompoundE: Knowledge Graph Embedding with Translation, Rotation and Scaling Compound Operations12 Jul 2022
- 2021CORE: A Knowledge Graph Entity Type Prediction Method via Complex Space Regression and Embedding19 Dec 2021