Sequential ensemble learning for next item recommendation

被引:3
作者
Du, Yingpeng [1 ]
Liu, Hongzhi [1 ]
Song, Yang [2 ]
Wang, Zekai [2 ]
Wu, Zhonghai [3 ]
机构
[1] Peking Univ, Sch Software & Microelect, Beijing 102600, Peoples R China
[2] BOSS Zhipin, Beijing 100028, Peoples R China
[3] Peking Univ, Natl Engn Ctr Software Engn, Beijing 100871, Peoples R China
关键词
Next-item recommendation; Ensemble learning; Dynamic weights; Diversity measure;
D O I
10.1016/j.knosys.2023.110809
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Predicting the next item that users may engage in is a key task of recommender systems, and many methods have been proposed to deal with this task from different aspects. Theoretically, the proper ensemble of multiple different methods (a.k.a. base models) can make more accurate and stable recommendations. However, most of the existing ensemble methods rely on static aggregation strategies, which fail to capture base models' dynamic predictive abilities for each user over time. In addition, most of the existing diversity measures used in regression or classification ensemble methods rely on a distance metric of base models' outputs, which makes it intractably apply for next-item recommendation whose base models output sequential ranking lists. To solve the above problems, we propose a Sequential Ensemble Method, named SEM, to aggregate different base models for next-item recommendation. We assume users' concentration and base models' expertise can be inferred from users' sequential behaviors and base models' prediction results. Therefore, we propose to explicitly model base models' dynamic predictive abilities on different users over time based on users' concentration and base models' expertise. In addition, we propose a new diversity measure for sequential ranking ensemble, which can perform diversity-based learning over time for better performance of next-item recommendation. Extensive experiments on six real-world data sets show that our method consistently outperforms state-of-the-art methods.& COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文
共 55 条
[1]  
[Anonymous], 2012, Advances in Neural Information Processing Systems
[2]  
[Anonymous], 2010, P 19 INT C WORLD WID, DOI DOI 10.1145/1772690.1772773
[3]  
Aslam J. A., 2001, SIGIR Forum, P276
[4]   An Attribute-aware Neural Attentive Model for Next Basket Recommendation [J].
Bai, Ting ;
Nie, Jian-Yun ;
Zhao, Wayne Xin ;
Zhu, Yutao ;
Du, Pan ;
Wen, Ji-Rong .
ACM/SIGIR PROCEEDINGS 2018, 2018, :1201-1204
[5]   LETOR Methods for Unsupervised Rank Aggregation [J].
Bhowmik, Avradeep ;
Ghosh, Joydeep .
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, :1331-1340
[6]  
Breiman L, 1996, MACH LEARN, V24, P123, DOI 10.1007/BF00058655
[7]  
Brown G., 2005, Information Fusion, V6, P5, DOI 10.1016/j.inffus.2004.04.004
[8]   Attentive Collaborative Filtering: Multimedia Recommendation with Item- and Component-Level Attention [J].
Chen, Jingyuan ;
Zhang, Hanwang ;
He, Xiangnan ;
Nie, Liqiang ;
Liu, Wei ;
Chua, Tat-Seng .
SIGIR'17: PROCEEDINGS OF THE 40TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2017, :335-344
[9]   AIR: Attentional Intention-Aware Recommender Systems [J].
Chen, Tong ;
Yin, Hongzhi ;
Chen, Hongxu ;
Yan, Rui ;
Quoc Viet Hung Nguyen ;
Li, Xue .
2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, :304-315
[10]   Reciprocal Rank Fusion outperforms Condorcet and Individual Rank Learning Methods [J].
Cormack, Gordon V. ;
Clarke, Charles L. A. ;
Buettcher, Stefan .
PROCEEDINGS 32ND ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2009, :758-759