IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i3p775-d1056673.html
   My bibliography  Save this article

Embedding Uncertain Temporal Knowledge Graphs

Author

Listed:
  • Tongxin Li

    (School of Systems Engineering, National University of Defense Technology, Changsha 410000, China)

  • Weiping Wang

    (School of Systems Engineering, National University of Defense Technology, Changsha 410000, China)

  • Xiaobo Li

    (School of Systems Engineering, National University of Defense Technology, Changsha 410000, China)

  • Tao Wang

    (School of Systems Engineering, National University of Defense Technology, Changsha 410000, China)

  • Xin Zhou

    (School of Systems Engineering, National University of Defense Technology, Changsha 410000, China)

  • Meigen Huang

    (School of Systems Engineering, National University of Defense Technology, Changsha 410000, China)

Abstract

Knowledge graph (KG) embedding for predicting missing relation facts in incomplete knowledge graphs (KGs) has been widely explored. In addition to the benchmark triple structural information such as head entities, tail entities, and the relations between them, there is a large amount of uncertain and temporal information, which is difficult to be exploited in KG embeddings, and there are some embedding models specifically for uncertain KGs and temporal KGs. However, these models either only utilize uncertain information or only temporal information, without integrating both kinds of information into the underlying model that utilizes triple structural information. In this paper, we propose an embedding model for uncertain temporal KGs called the confidence score, time, and ranking information embedded jointly model (CTRIEJ), which aims to preserve the uncertainty, temporal and structural information of relation facts in the embedding space. To further enhance the precision of the CTRIEJ model, we also introduce a self-adversarial negative sampling technique to generate negative samples. We use the embedding vectors obtained from our model to complete the missing relation facts and predict their corresponding confidence scores. Experiments are conducted on an uncertain temporal KG extracted from Wikidata via three tasks, i.e., confidence prediction, link prediction, and relation fact classification. The CTRIEJ model shows effectiveness in capturing uncertain and temporal knowledge by achieving promising results, and it consistently outperforms baselines on the three downstream experimental tasks.

Suggested Citation

  • Tongxin Li & Weiping Wang & Xiaobo Li & Tao Wang & Xin Zhou & Meigen Huang, 2023. "Embedding Uncertain Temporal Knowledge Graphs," Mathematics, MDPI, vol. 11(3), pages 1-16, February.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:3:p:775-:d:1056673
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/3/775/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/3/775/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Weihua Ou & Jianping Gou & Shaoning Zeng & Lan Du, 2023. "Preface to the Special Issue “Advancement of Mathematical Methods in Feature Representation Learning for Artificial Intelligence, Data Mining and Robotics”—Special Issue Book," Mathematics, MDPI, vol. 11(4), pages 1-4, February.

    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:jmathe:v:11:y:2023:i:3:p:775-:d:1056673. 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.