.png){kind=icon}
.png){kind=icon}
Return
Adversarial Knowledge Representation Learning Without External Model
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2889481.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Knowledge representation learning, which embeds entities and relations of knowledge graph into low-dimensional vectors, is effficient for predicting missing facts. Knowledge graph datasets only store positive triplets. Nevertheless, negative cases are similarly crucial in knowledge representation learning. Conventionally, corrupted triplets are uniformly generated as negative cases, but actually, these corrupted triplets are heterogeneous. The majority of corrupted triplets are trivial, and they have limited influence on learning. Regarding the large number of corrupted triplet candidates, it is not effficient to train the model by uniformly generated corrupted triplets. Generative adversarial network (GAN)-inspired approaches are proposed to remit easily discriminated negative training examples, enabling faster and better convergence of the embedding models. Pre-trained external sampling models are required in these approaches. In this paper, we introduce a simple but strong negative sampling approach for adversarial knowledge representation learning, named loss adaptive sampling mechanism, which is effficient without an external sampling model. Furthermore, false negative cases are always over-trained in the training stage with effficient negative sampling approaches. We propose a push-up mechanism and verify whether it is feasible to alleviate these over-trained false negative cases. The experimental results show that our adversarial knowledge representation learning approach outperforms the GAN-based sampling method-KBGAN.
Keywords:
Knowledge graph
knowledge representation learning
link prediction
adversarial learning
negative sampling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.