Knowledge graphs are large, useful, but incomplete knowledge repositories. They encode knowledge through entities and relations which define each other through the connective structure of the graph. This has inspired methods for the joint embedding of entities and relations in continuous low-dimensional vector spaces, that can be used to induce new edges in the graph, i.e., link prediction in knowledge graphs. Learning these representations relies on contrasting positive instances with negative ones. Knowledge graphs include only positive relation instances, leaving the door open for a variety of methods for selecting negative examples. In this paper we present an empirical study on the impact of negative sampling on the learned embeddings, assessed through the task of link prediction. We use state-of-the-art knowledge graph embeddings -Rescal , TransE, DistMult and ComplEX -and evaluate on benchmark datasets -FB15k and WN18. We compare well known methods for negative sampling and additionally propose embedding based sampling methods. We note a marked difference in the impact of these sampling methods on the two datasets, with the "traditional" corrupting positives method leading to best results on WN18, while embedding based methods benefiting the task on FB15k. KEYWORDS knowledge graphs, negative sampling, embedding models, link prediction Knowledge graphs KG = (E, R) contain knowledge in the form of relation triples (s, r, t), where s, t ∈ E are entities, and r ∈ R is a relation. These knowledge graphs are not complete, and additional links (facts) can be inferred, based on the idea that similar nodes have similar relations -e.g. all countries have a capital city. The KG
In REF the authors present an empirical study on the impact of Negative Sampling on the learned embeddings, assessed through the task of link prediction.
Analysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs
ArXiv
ArXiv
Computer Science