Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

Computer Engineering ›› 2026, Vol. 52 ›› Issue (7): 94-106. doi: 10.19678/j.issn.1000-3428.0070584

• Computational Intelligence and Pattern Recognition • Previous Articles     Next Articles

Sequential Recommendation Algorithm Based on Data Augmentation and Integrated Self-Attention

LI Zhongwei1, LI Keyi2, LIU Xin2,*()   

  1. 1. College of Oceanography and Space Information, China University of Petroleum (East China), Qingdao 266580, Shandong, China
    2. Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, Shandong, China
  • Received:2024-11-06 Revised:2025-02-11 Online:2026-07-15 Published:2025-03-25
  • Contact: LIU Xin

基于数据增强和融合自注意力的序列推荐算法

李忠伟1, 李可一2, 刘昕2,*()   

  1. 1. 中国石油大学(华东)海洋与空间信息学院, 山东 青岛 266580
    2. 中国石油大学(华东)青岛软件学院、计算机科学与技术学院, 山东 青岛 266580
  • 通讯作者: 刘昕
  • 作者简介:

    李忠伟(CCF会员),男,教授、博士,主研方向为人工智能算法及应用

    李可一,硕士研究生

    刘昕(通信作者),副教授、博士

  • 基金资助:
    国家自然科学基金(62071491); 国家重点研发计划(2018YFC1406204); 山东省重点研发计划(2023RKL01004)

Abstract:

In recommender systems, sequential recommendations aim to predict the future interests of a user based on historical interaction sequences. However, existing deep learning models typically focus on capturing users' long-term behavior patterns while neglecting the fine-grained modeling of temporal information, which limits improvements in recommendation performance. To address this issue, this study proposes a method that combines the global and local self-attention mechanisms. This method processes user interaction sequences in chunks and introduces a weight decay mechanism that assigns differentiated weights to different sequence blocks based on temporal distance, thereby capturing changes in users' short- and long-term interests more accurately. However, this approach introduces additional parameters, thereby increasing the model complexity. While Stochastic Shared Embedding (SSE) technology can reduce the parameter count and mitigate overfitting, its random embedding approach may introduce noisy data, affecting the accuracy of the recommendations. To solve this problem, this study proposes a strategy that combines a Generative Adversarial Network (GAN) with SSE. By using GAN to generate high-quality interaction data that align with user interest distributions and combining this with the random replacement mechanism in SSE for data augmentation, the data are enhanced by randomly selecting generated data, thus reducing the risk of noise introduction while retaining SSE's advantage in reducing overfitting. Experiments are conducted on three public datasets: MovieLens-1M, Amazon Beauty, and Yahoo Music. The results show that the proposed method performs well in terms of Normalized Discounted Cumulative Gain (NDCG), Hit Rate (HR), and Mean Reciprocal Rank (MRR).

Key words: recommendation system, sequential recommendation, Generative Adversarial Network (GAN), data augmentation, attention mechanism

摘要:

在推荐系统中, 序列推荐旨在通过用户的历史交互序列来预测其未来兴趣。然而, 现有深度学习模型通常侧重于捕捉用户的长期行为模式, 而对时间信息的细粒度建模有所忽视, 从而限制了推荐效果的提升。为了解决这一问题, 提出一种结合全局与局部自注意力机制的方法, 通过分块处理用户交互序列并引入权重衰减机制, 根据时序距离为不同序列块分配差异化权重, 从而更精确地捕捉用户长短期兴趣的变化。然而, 这种方法会引入更多的参数, 增加模型的复杂度。虽然随机共享嵌入(SSE)技术能够减少参数量并缓解过拟合, 但其随机嵌入方式可能会引入噪声数据, 影响推荐结果的准确性。针对此问题, 提出一种结合生成对抗网络(GAN)与SSE技术的策略, 通过GAN生成符合用户兴趣分布的高质量交互数据, 并结合SSE中的随机替换机制进行数据增强, 在随机选择生成的数据时, 增加由GAN生成的高质量数据, 从而降低噪声引入的风险, 同时保留SSE技术在降低过拟合方面的优势。在MovieLens-1M、Amazon Beauty和Yahoo Music 3个公开数据集上进行实验, 结果表明, 所提出的方法在归一化折损累计增益(NDCG)、命中率(HR)以及平均倒数排名(MRR)指标上表现优异。

关键词: 推荐系统, 序列推荐, 生成对抗网络, 数据增强, 注意力机制