{"title":"Combining association-rule-guided sequence augmentation with listwise contrastive learning for session-based recommendation","authors":"Xiangkui Lu , Jun Wu","doi":"10.1016/j.ipm.2024.103999","DOIUrl":null,"url":null,"abstract":"<div><div>Sequence augmentation based contrastive learning (SACL) plays a critical role in user behavior modeling towards sequential recommendation tasks. However, SACL cannot work well in the scenario of session-based recommendation (SBR), where the anonymous user behavior sequences (known as sessions) are very short (e.g., with no more than 5 interactions), making most augmentation techniques ineffective. In this paper, we propose a novel method named LCAA (<strong>L</strong>istwise <strong>C</strong>ontrastive learning with <strong>A</strong>ssociation-rule-based sequence <strong>A</strong>ugmentation), which lengthens the current session with association rules to create an augmented session, and then leverages a corresponding listwise contrastive loss to maximize the agreement of two recommendation lists generated from the original session and its augmentation. Remarkably, LCAA is a model-agnostic method that can be easily plugged into a wide range of existing SBR models towards better accuracy. To evaluate the effectiveness of LCAA, we implement it with five SBR models utilizing various deep learning techniques (NARM, STAMP, SRGNN, CORE, and ATTMIX) and then compare the performance of each SBR baseline with its LCAA-modified version. Extensive experiments on three datasets (Diginetica, Nowplaying, and Tmall) demonstrate that LCAA yields the average improvement of around 5% on the complete testing sets and around 3% on the short session testing sets in terms of HR and MRR metrics. The code is publicly available.<span><span><sup>1</sup></span></span></div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 3","pages":"Article 103999"},"PeriodicalIF":6.9000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324003583","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/12/10 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Sequence augmentation based contrastive learning (SACL) plays a critical role in user behavior modeling towards sequential recommendation tasks. However, SACL cannot work well in the scenario of session-based recommendation (SBR), where the anonymous user behavior sequences (known as sessions) are very short (e.g., with no more than 5 interactions), making most augmentation techniques ineffective. In this paper, we propose a novel method named LCAA (Listwise Contrastive learning with Association-rule-based sequence Augmentation), which lengthens the current session with association rules to create an augmented session, and then leverages a corresponding listwise contrastive loss to maximize the agreement of two recommendation lists generated from the original session and its augmentation. Remarkably, LCAA is a model-agnostic method that can be easily plugged into a wide range of existing SBR models towards better accuracy. To evaluate the effectiveness of LCAA, we implement it with five SBR models utilizing various deep learning techniques (NARM, STAMP, SRGNN, CORE, and ATTMIX) and then compare the performance of each SBR baseline with its LCAA-modified version. Extensive experiments on three datasets (Diginetica, Nowplaying, and Tmall) demonstrate that LCAA yields the average improvement of around 5% on the complete testing sets and around 3% on the short session testing sets in terms of HR and MRR metrics. The code is publicly available.1
基于序列增强的对比学习(SACL)在序列推荐任务的用户行为建模中起着至关重要的作用。然而,SACL在基于会话的推荐(SBR)场景中不能很好地工作,其中匿名用户行为序列(称为会话)非常短(例如,不超过5个交互),使得大多数增强技术无效。在本文中,我们提出了一种名为LCAA (Listwise contrast learning with association -rule-based sequence Augmentation)的新方法,该方法使用关联规则延长当前会话以创建增强会话,然后利用相应的列表对比损失来最大化由原始会话及其增强生成的两个推荐列表的一致性。值得注意的是,LCAA是一种与模型无关的方法,可以很容易地插入到广泛的现有SBR模型中,以提高准确性。为了评估LCAA的有效性,我们利用各种深度学习技术(NARM、STAMP、SRGNN、CORE和ATTMIX)实现了五个SBR模型,然后将每个SBR基线的性能与其LCAA修改版本进行了比较。在三个数据集(Diginetica、Nowplaying和Tmall)上进行的广泛实验表明,LCAA在完整测试集上的平均改进约为5%,在HR和MRR指标方面的短会话测试集上的平均改进约为3%。代码是公开的
期刊介绍:
Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing.
We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.