Aggregating neighborhood information for negative sampling for knowledge graph embedding

Hai Liu, Kairong Hu, Fu Lee Wang, Tianyong Hao

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


Knowledge graphs, as linked data, can be extracted from texts in triple form that illustrate the structure of “entity–relation–entity.” Knowledge graph embedding (KGE) models are used to map entities and relations into a continuous vector space with semantic constraints so as to learn a knowledge graph with fact triples. In the KGE model training process, both positive and negative triples are necessarily provided. Thus, negative sampling methods are meaningful in generating negative samples based on the representations of entities and relations. This paper proposes an innovative neighborhood knowledge selective adversarial network (NKSGAN), which leverages the representation of aggregating neighborhood information to generate high-quality negative samples for enhancing the performances of the discriminator. Experiments are conducted on widely used standard datasets such as FB15k, FB15k-237, WN18 and WN18RR to evaluate our model for link prediction task. The results present the superiority of our proposed NKSGAN than other baseline methods, indicating that the negative sampling process in NKSGAN is effective in generating high-quality negative samples for boosting KGE models.

Original languageEnglish
Pages (from-to)17637-17653
Number of pages17
JournalNeural Computing and Applications
Issue number23
Publication statusPublished - Dec 2020


  • Knowledge graph
  • Link prediction
  • Negative sampling
  • Neighborhood


Dive into the research topics of 'Aggregating neighborhood information for negative sampling for knowledge graph embedding'. Together they form a unique fingerprint.

Cite this