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

Complex Knowledge Graph Embeddings Based on Convolution and Translation

Author

Listed:
  • Lin Shi

    (College of Artificial Intelligence, North China University of Science and Technology, Tangshan 063210, China)

  • Zhao Yang

    (College of Artificial Intelligence, North China University of Science and Technology, Tangshan 063210, China)

  • Zhanlin Ji

    (College of Artificial Intelligence, North China University of Science and Technology, Tangshan 063210, China
    Telecommunications Research Centre (TRC), University of Limerick, V94 T9PX Limerick, Ireland)

  • Ivan Ganchev

    (Telecommunications Research Centre (TRC), University of Limerick, V94 T9PX Limerick, Ireland
    Department of Computer Systems, University of Plovdiv “Paisii Hilendarski”, 4000 Plovdiv, Bulgaria
    Institute of Mathematics and Informatics—Bulgarian Academy of Sciences, 1040 Sofia, Bulgaria)

Abstract

Link prediction involves the use of entities and relations that already exist in a knowledge graph to reason about missing entities or relations. Different approaches have been proposed to date for performing this task. This paper proposes a combined use of the translation-based approach with the Convolutional Neural Network (CNN)-based approach, resulting in a novel model, called ConCMH. In the proposed model, first, entities and relations are embedded into the complex space, followed by a vector multiplication of entity embeddings and relational embeddings and taking the real part of the results to generate a feature matrix of their interaction. Next, a 2D convolution is used to extract features from this matrix and generate feature maps. Finally, the feature vectors are transformed into predicted entity embeddings by obtaining the inner product of the feature mapping and the entity embedding matrix. The proposed ConCMH model is compared against state-of-the-art models on the four most commonly used benchmark datasets and the obtained experimental results confirm its superiority in the majority of cases.

Suggested Citation

  • Lin Shi & Zhao Yang & Zhanlin Ji & Ivan Ganchev, 2023. "Complex Knowledge Graph Embeddings Based on Convolution and Translation," Mathematics, MDPI, vol. 11(12), pages 1-14, June.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:12:p:2627-:d:1166987
    as

    Download full text from publisher

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

    File URL: https://www.mdpi.com/2227-7390/11/12/2627/
    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:jmathe:v:11:y:2023:i:12:p:2627-:d:1166987. 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.