KGBoost: A Classification-based Knowledge Base Completion Method with Negative Sampling
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationKnowledge Base CompletionKnowledge GraphsLink PredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
CoDEx: A Comprehensive Knowledge Graph Completion Benchmark
We present CoDEx, a set of knowledge graph completion datasets extracted from Wikidata and Wikipedia that improve upon existing knowledge graph completion benchmarks in scope and level of difficulty. In terms of scope, C…
BenchmarkingKnowledge Graph CompletionKnowledge GraphsLink Prediction+1Revisiting Evaluation of Knowledge Base Completion Models
Representing knowledge graphs (KGs) by learning embeddings for entities and relations has led to accurate models for existing KG completion benchmarks. However, due to the open-world assumption of existing KGs, evaluatio…
Knowledge Base CompletionKnowledge Graph CompletionKnowledge GraphsTriple ClassificationKnowledge Graph Completion with Pre-trained Multimodal Transformer and Twins Negative Sampling
Knowledge graphs (KGs) that modelings the world knowledge as structural triples are inevitably incomplete. Such problems still exist for multimodal knowledge graphs (MMKGs). Thus, knowledge graph completion (KGC) is of g…
Knowledge Graph CompletionKnowledge GraphsLink PredictionWorld KnowledgeKG-NSF: Knowledge Graph Completion with a Negative-Sample-Free Approach
Knowledge Graph (KG) completion is an important task that greatly benefits knowledge discovery in many fields (e.g. biomedical research). In recent years, learning KG embeddings to perform this task has received consider…
Knowledge Graph CompletionLink PredictionDistributional Negative Sampling for Knowledge Base Completion
State-of-the-art approaches for Knowledge Base Completion (KBC) exploit deep neural networks trained with both false and true assertions: positive assertions are explicitly taken from the knowledge base, whereas negative…
Knowledge Base Completion