IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v14y2022i12p376-d1001788.html
   My bibliography  Save this article

ERGCN: Enhanced Relational Graph Convolution Network, an Optimization for Entity Prediction Tasks on Temporal Knowledge Graphs

Author

Listed:
  • Yinglin Wang

    (School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai 200433, China
    These authors contributed equally to this work.)

  • Xinyu Xu

    (School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai 200433, China
    These authors contributed equally to this work.)

Abstract

Reasoning on temporal knowledge graphs, which aims to infer new facts from existing knowledge, has attracted extensive attention and in-depth research recently. One of the important tasks of reasoning on temporal knowledge graphs is entity prediction, which focuses on predicting the missing objects in facts at current time step when relevant histories are known. The problem is that, for entity prediction task on temporal knowledge graphs, most previous studies pay attention to aggregating various semantic information from entities but ignore the impact of semantic information from relation types. We believe that relation types is a good supplement for our task and making full use of semantic information of facts can promote the results. Therefore, a framework of Enhanced Relational Graph Convolution Network (ERGCN) is put forward in this paper. Rather than only considering representations of entities, the context semantic information of both relations and entities is considered and merged together in this framework. Experimental results show that the proposed approach outperforms the state-of-the-art methods.

Suggested Citation

  • Yinglin Wang & Xinyu Xu, 2022. "ERGCN: Enhanced Relational Graph Convolution Network, an Optimization for Entity Prediction Tasks on Temporal Knowledge Graphs," Future Internet, MDPI, vol. 14(12), pages 1-12, December.
  • Handle: RePEc:gam:jftint:v:14:y:2022:i:12:p:376-:d:1001788
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/14/12/376/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/14/12/376/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:14:y:2022:i:12:p:376-:d:1001788. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.