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

HyperCLR: A Personalized Sequential Recommendation Algorithm Based on Hypergraph and Contrastive Learning

Author

Listed:
  • Ruiqi Zhang

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China)

  • Haitao Wang

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China)

  • Jianfeng He

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650504, China)

Abstract

Sequential recommendations aim to predict users’ next interactions by modeling their interaction sequences. Most existing work concentrates on user preferences within these sequences, overlooking the complex item relationships across sequences. Additionally, these studies often fail to address the diversity of user interests, thus not capturing their varied latent preferences effectively. To tackle these problems, this paper develops a novel recommendation algorithm based on hypergraphs and contrastive learning named HyperCLR. It dynamically incorporates the time and location embeddings of items to model high-order relationships in user preferences. Moreover, we developed a graph construction approach named IFDG, which utilizes global item visit frequencies and spatial distances to discern item relevancy. By sampling subgraphs from IFDG, HyperCLR can align the representations of identical interaction sequences closely while distinguishing them from the broader global context on IFDG. This approach enhances the accuracy of sequential recommendations. Furthermore, a gating mechanism is designed to tailor the global context information to individual user preferences. Extensive experiments on Taobao, Books and Games datasets have shown that HyperCLR consistently surpasses baselines, demonstrating the effectiveness of the method. In particular, in comparison to the best baseline methods, HyperCLR demonstrated a 29.1% improvement in performance on the Taobao dataset.

Suggested Citation

  • Ruiqi Zhang & Haitao Wang & Jianfeng He, 2024. "HyperCLR: A Personalized Sequential Recommendation Algorithm Based on Hypergraph and Contrastive Learning," Mathematics, MDPI, vol. 12(18), pages 1-18, September.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2887-:d:1479096
    as

    Download full text from publisher

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

    File URL: https://www.mdpi.com/2227-7390/12/18/2887/
    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:12:y:2024:i:18:p:2887-:d:1479096. 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.