Discriminator-based adversarial networks for knowledge graph completion

Tubaishat, Abdallah, Zia, Tehseen ORCID logoORCID: https://orcid.org/0000-0001-8176-3373, Faiz, Rehana, Al Obediat, Feras, Shah, Babar and Windridge, David ORCID logoORCID: https://orcid.org/0000-0001-5507-8516 (2022) Discriminator-based adversarial networks for knowledge graph completion. Neural Computing and Applications . ISSN 0941-0643 [Article] (Published online first) (doi:10.1007/s00521-022-07680-w)

[img] PDF - Final accepted version (with author's formatting)
Restricted to Repository staff and depositor only until 10 August 2023.

Download (1MB) |

Abstract

Knowledge graphs (KGs) inherently lack reasoning ability which limits their effectiveness for tasks such as question-answering and query expansion. KG embedding (KGE) is a predominant approach where proximity between relations and entities in the embedding space is used for reasoning over KGs. Most existing KGE approaches use structural information of triplets and disregard contextual information which could be crucial to learning long-term relations between entities. Moreover, KGE approaches mostly use discriminative models which require both positive and negative samples to learn a decision boundary. KGs, by contrast, contain only positive samples, necessitating that negative samples are generated by replacing the head/tail of predicates with randomly-chosen entities. They are thus usually irrational and easily discriminable from positive samples, which can prevent the learning of sufficiently robust classifiers. To address the shortcomings, we propose to learn contextualized KGE using pretrained adversarial networks. We assume multi-hop relational paths(mh-RPs) as textual sequences for competitively learning discriminator-based KGE against the negative mh-RP generator. We use a pre-trained ELECTRA model and feed it with relational paths. We employ a generator to corrupt randomly-chosen entities with plausible alternatives and a discriminator to predict whether an entity is corrupted or not. We perform experiments on multiple benchmark knowledge graphs and the results show that our proposed KG-ELECTRA model outperforms BERT in link prediction.

Item Type: Article
Sustainable Development Goals:
Theme:
Keywords (uncontrolled): Knowledge Graph Completion; Pretrained Language Model; Transformer Model
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 35651
Notes on copyright: This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s00521-022-07680-w
Useful Links:
Depositing User: David Windridge
Date Deposited: 23 Aug 2022 13:26
Last Modified: 18 Oct 2022 11:27
URI: https://eprints.mdx.ac.uk/id/eprint/35651

Actions (login required)

View Item View Item

Statistics

Activity Overview
6 month trend
0Downloads
6 month trend
0Hits

Additional statistics are available via IRStats2.