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

Attribute-Aware Graph Aggregation for Sequential Recommendation

Author

Listed:
  • Yiming Qu

    (National Key Laboratory of Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China)

  • Yang Fang

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Zhen Tan

    (National Key Laboratory of Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China)

  • Weidong Xiao

    (National Key Laboratory of Information Systems Engineering Laboratory, National University of Defense Technology, Changsha 410073, China)

Abstract

In this paper, we address the challenge of dynamic evolution of user preferences and propose an attribute-sequence-based recommendation model to improve the accuracy and interpretability of recommendation systems. Traditional approaches usually rely on item sequences to model user behavior, but ignore the potential value of attributes shared among different items for preference characterization. To this end, this paper innovatively replaces items in user interaction sequences with attributes, constructs attribute sequences to capture fine-grained preference changes, and reinforces the prioritization of current interests by maintaining the latest state of attributes. Meanwhile, the item–attribute relationship is modeled using LightGCN and a variant of GAT, fusing multi-level features using gated attention mechanism, and introducing rotary encoding to enhance the flexibility of sequence modeling. Experiments on four real datasets (Beauty, Video Games, Men, and Fashion) showed that the model in this paper significantly outperformed the benchmark model in both NDCG@10 and Hit Ratio@10 metrics, with a highest improvement of 6.435% and 3.613%, respectively. The ablation experiments further validated the key role of attribute aggregation and sequence modeling in capturing user preference dynamics. This work provides a new concept for recommender systems that balances fine-grained preference evolution with efficient sequence modeling.

Suggested Citation

  • Yiming Qu & Yang Fang & Zhen Tan & Weidong Xiao, 2025. "Attribute-Aware Graph Aggregation for Sequential Recommendation," Mathematics, MDPI, vol. 13(9), pages 1-13, April.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:9:p:1386-:d:1641253
    as

    Download full text from publisher

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

    File URL: https://www.mdpi.com/2227-7390/13/9/1386/
    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:9:p:1386-:d:1641253. 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.