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

Knowledge Graph Embedding for Hierarchical Entities Based on Auto-Embedding Size

Author

Listed:
  • Pengfei Zhang

    (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China)

  • Xiaoxue Zhang

    (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China)

  • Yang Fang

    (College of Information and Communication, National University of Defense Technology, Changsha 410073, China)

  • Jinzhi Liao

    (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China)

  • Wubin Ma

    (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China)

  • Zhen Tan

    (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China)

  • Weidong Xiao

    (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China)

Abstract

Knowledge graph embedding represents entities and relations as low-dimensional continuous vectors. Recently, researchers have attempted to leverage the potential semantic connections between entities with hierarchical relationships in the knowledge graph. However, existing knowledge embedding methods that model entity hierarchical structures face the following challenges: (1) Setting the same embedding dimension for entities at different hierarchical levels can lead to overfitting issues and the waste of storage and computational resources; (2) Manually searching the embedding dimension in discrete space makes it easy to miss the optimal parameters and increases training costs. Therefore, we propose a knowledge embedding method, HEAES, that automatically learns the embedding dimensions for entities based on their hierarchical structure. Specifically, we first propose a new modeling method to capture the hierarchical relationships of entities, and we then train the model on a triple classification task. Then, we adaptively learn the pruning threshold to trim the embedding vectors, automatically learning different embedding dimensions for entities at different hierarchical levels. Experiments on the YAGO26K and DB111K datasets verify that introducing entity hierarchical information helps boost the model performance.

Suggested Citation

  • Pengfei Zhang & Xiaoxue Zhang & Yang Fang & Jinzhi Liao & Wubin Ma & Zhen Tan & Weidong Xiao, 2024. "Knowledge Graph Embedding for Hierarchical Entities Based on Auto-Embedding Size," Mathematics, MDPI, vol. 12(20), pages 1-19, October.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:20:p:3237-:d:1500029
    as

    Download full text from publisher

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

    File URL: https://www.mdpi.com/2227-7390/12/20/3237/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Pengfei Zhang & Dong Chen & Yang Fang & Xiang Zhao & Weidong Xiao, 2022. "CIST: Differentiating Concepts and Instances Based on Spatial Transformation for Knowledge Graph Embedding," Mathematics, MDPI, vol. 10(17), pages 1-16, September.
    Full references (including those not matched with items on IDEAS)

    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. 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.

    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:12:y:2024:i:20:p:3237-:d:1500029. 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.