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

Relational Structure-Aware Knowledge Graph Representation in Complex Space

Author

Listed:
  • Ke Sun

    (School of Software, Dalian University of Technology, Dalian 116620, China)

  • Shuo Yu

    (School of Software, Dalian University of Technology, Dalian 116620, China)

  • Ciyuan Peng

    (Institute of Innovation, Science and Sustainability, Federation University Australia, Ballarat, VIC 3353, Australia)

  • Yueru Wang

    (Department of Mathematics, National Tsing Hua University, Hsinchu 30013, Taiwan)

  • Osama Alfarraj

    (Computer Science Department, Community College, King Saud University, Riyadh 11437, Saudi Arabia)

  • Amr Tolba

    (Computer Science Department, Community College, King Saud University, Riyadh 11437, Saudi Arabia)

  • Feng Xia

    (Institute of Innovation, Science and Sustainability, Federation University Australia, Ballarat, VIC 3353, Australia)

Abstract

Relations in knowledge graphs have rich relational structures and various binary relational patterns. Various relation modelling strategies are proposed for embedding knowledge graphs, but they fail to fully capture both features of relations, rich relational structures and various binary relational patterns. To address the problem of insufficient embedding due to the complexity of the relations, we propose a novel knowledge graph representation model in complex space, namely MARS, to exploit complex relations to embed knowledge graphs. MARS takes the mechanisms of complex numbers and message-passing and then embeds triplets into relation-specific complex hyperplanes. Thus, MARS can well preserve various relation patterns, as well as structural information in knowledge graphs. In addition, we find that the scores generated from the score function approximate a Gaussian distribution. The scores in the tail cannot effectively represent triplets. To address this particular issue and improve the precision of embeddings, we use the standard deviation to limit the dispersion of the score distribution, resulting in more accurate embeddings of triplets. Comprehensive experiments on multiple benchmarks demonstrate that our model significantly outperforms existing state-of-the-art models for link prediction and triple classification.

Suggested Citation

  • Ke Sun & Shuo Yu & Ciyuan Peng & Yueru Wang & Osama Alfarraj & Amr Tolba & Feng Xia, 2022. "Relational Structure-Aware Knowledge Graph Representation in Complex Space," Mathematics, MDPI, vol. 10(11), pages 1-16, June.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:11:p:1930-:d:831550
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/11/1930/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/11/1930/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Qi Lin & Shuo Yu & Ke Sun & Wenhong Zhao & Osama Alfarraj & Amr Tolba & Feng Xia, 2022. "Robust Graph Neural Networks via Ensemble Learning," Mathematics, MDPI, vol. 10(8), pages 1-14, April.
    2. Hui Fang & Chongcheng Chen & Yunfei Long & Ge Xu & Yongqiang Xiao, 2022. "DTCRSKG: A Deep Travel Conversational Recommender System Incorporating Knowledge Graph," Mathematics, MDPI, vol. 10(9), pages 1-16, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Xuechen Zhao & Jinfeng Miao & Fuqiang Yang & Shengnan Pang, 2024. "Geometry Interaction Embeddings for Interpolation Temporal Knowledge Graph Completion," Mathematics, MDPI, vol. 12(13), pages 1-15, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kleyton da Costa, 2023. "Anomaly Detection in Global Financial Markets with Graph Neural Networks and Nonextensive Entropy," Papers 2308.02914, arXiv.org, revised Aug 2023.
    2. Jiacheng Hou & Tianhao Tao & Haoye Lu & Amiya Nayak, 2023. "Intelligent Caching with Graph Neural Network-Based Deep Reinforcement Learning on SDN-Based ICN," Future Internet, MDPI, vol. 15(8), pages 1-20, July.

    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:10:y:2022:i:11:p:1930-:d:831550. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.