Two-stage Learning for Multi-behavior Recommendation

被引:0
|
作者
Yan M.-S. [1 ]
Cheng Z.-Y. [2 ]
Sun J. [1 ]
Wang F.-S. [1 ]
Sun F.-M. [1 ]
机构
[1] School of Information and Communication Engineering, Dalian Minzu University, Dalian
[2] Shandong Artificial Intelligence Institute, Jinan
来源
Ruan Jian Xue Bao/Journal of Software | 2024年 / 35卷 / 05期
关键词
collaborative filtering; graph convolutional network (GCN); multi-behavior recommendation; multi-task learning; two-stage strategy;
D O I
10.13328/j.cnki.jos.006897
中图分类号
学科分类号
摘要
Multi-behavior recommendation aims to utilize interactive data from multiple behaviors of users to improve recommendation performance. Existing multi-behavior recommendation methods generally directly exploit the multi-behavior data for the shared initialized user representations and involve the mining of user preferences and modeling of relationships among different behaviors in the tasks. However, these methods ignore the data imbalance under different interactive behaviors (the amount of interactive data varies greatly among different behaviors) and the information loss caused by the adaptation to the above two tasks. User preferences refer to the interests that users exhibit in different behaviors (e.g., browsing preferences), and the relationship among behaviors indicates a potential conversion from one behavior to another behavior (e.g., the conversion from browsing to purchasing). In multi-behavior recommendation, the mining of user preferences and the modeling of relationships among different behaviors can be regarded as a two-stage task. On the basis of the above considerations, the model of two-stage learning for multi-behavior recommendation (TSL-MBR for short) is proposed, which decouples the above two tasks with a two-stage strategy. In particular, the model retains the end-to-end structure and learns the two tasks by alternating training with fixed parameters. The first stage is to model user preferences under different behaviors. In this stage, the interactive data from all behaviors (without distinction as to behavior type) are first used to model the global preferences of users to alleviate the problem of data sparsity to the greatest extent. Then, the interactive data of each behavior are used to refine the behavior-specific user preference (local preference) and thus lessen the influence of the data imbalance among different behaviors. The second stage is to model the relationships among different behaviors. In this stage, the mining of user preferences and modeling of relationships among different behaviors are decoupled to relieve the information loss problem caused by adaptation to the two tasks. This two-stage model significantly improves the system’s ability to predict target behaviors. Extensive experimental results show that TSL-MBR can substantially outperform the state-of-the-art baseline models, achieving 103.01% and 33.87% of relative gains on average over the best baseline on the Tmall and Beibei datasets, respectively. © 2024 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:2446 / 2465
页数:19
相关论文
共 44 条
  • [1] Chen BY, Huang L, Wang CD, Jing LP., Explicit and implicit feedback based collaborative filtering algorithm, Ruan Jian Xue Bao/Journal of Software, 31, 3, pp. 794-805, (2020)
  • [2] Tian Z, Pan LM, Yin P, Wang R., Deep matrix factorization recommendation algorithm, Ruan Jian Xue Bao/Journal of Software, 32, 12, pp. 3917-3928, (2021)
  • [3] Kabbur S, Ning X, Karypis G., FISM: Factored item similarity models for top-N recommender systems, Proc. of the 19th ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, pp. 659-667, (2013)
  • [4] Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L., BPR: Bayesian personalized ranking from implicit feedback, Proc. of the 25th Int’l Conf. on Uncertainty in Artificial Intelligence, pp. 452-461, (2009)
  • [5] Sarwar B, Karypis G, Konstan J, Riedl J., Item-based collaborative filtering recommendation algorithms, Proc. of the 10th Int’l Conf. on World Wide Web, pp. 285-295, (2001)
  • [6] Ning X, Karypis G., SLIM: Sparse linear methods for top-N recommender systems, Proc. of the 11th IEEE Int’l Conf. on Data Mining, pp. 497-506, (2011)
  • [7] Koren Y., Factorization meets the neighborhood: A multifaceted collaborative filtering model, Proc. of the 14th ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, pp. 426-434, (2008)
  • [8] Koren Y, Bell R, Volinsky C., Matrix factorization techniques for recommender systems, Computer, 42, 8, pp. 30-37, (2009)
  • [9] Salakhutdinov R, Mnih A., Probabilistic matrix factorization, Proc. of the 20th Int’l Conf. on Neural Information Processing Systems, pp. 1257-1264, (2007)
  • [10] He XN, Liao LZ, Zhang HW, Nie LQ, Hu X, Chua TS., Neural collaborative filtering, Proc. of the 26th Int’l Conf. on World Wide Web, pp. 173-182, (2017)