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

The Graph Attention Recommendation Method for Enhancing User Features Based on Knowledge Graphs

Author

Listed:
  • Hui Wang

    (School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, China)

  • Qin Li

    (School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, China)

  • Huilan Luo

    (School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, China)

  • Yanfei Tang

    (School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, China)

Abstract

Knowledge graphs have shown great potential in alleviating the data sparsity problem in recommendation systems. However, existing graph-attention-based recommendation methods primarily focus on user–item–entity interactions, overlooking potential relationships between users while introducing noisy entities and redundant high-order information. To address these challenges, this paper proposes a graph-attention-based recommendation method that enhances user features using knowledge graphs (KGAEUF). This method models user relationships through collaborative propagation, links entities via similar user entities, and filters highly relevant entities from both user–entity and user–relation perspectives to reduce noise interference. In multi-layer propagation, a distance-aware weight allocation mechanism is introduced to optimize high-order information aggregation. Experimental results demonstrate that KGAEUF outperforms existing methods on AUC and F1 metrics on the Last.FM and Book-Crossing datasets, validating the model’s effectiveness.

Suggested Citation

  • Hui Wang & Qin Li & Huilan Luo & Yanfei Tang, 2025. "The Graph Attention Recommendation Method for Enhancing User Features Based on Knowledge Graphs," Mathematics, MDPI, vol. 13(3), pages 1-20, January.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:3:p:390-:d:1576499
    as

    Download full text from publisher

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

    File URL: https://www.mdpi.com/2227-7390/13/3/390/
    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:13:y:2025:i:3:p:390-:d:1576499. 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.