DeepAssociate: A deep learning model exploring sequential influence and history-candidate association for sequence recommendation

被引:17
作者
Ma, Yingxue [1 ]
Gan, Mingxin [1 ]
机构
[1] Univ Sci & Technol Beijing, Sch Econ & Management, Dept Management Sci & Engn, Beijing 100083, Peoples R China
基金
中国国家自然科学基金;
关键词
Sequential recommendation; User preference; Deep learning; Attention mechanism; Recurrent neural network; GATED RECURRENT UNITS; NEURAL-NETWORK;
D O I
10.1016/j.eswa.2021.115587
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A remarkable progress in sequential recommendation field lies on deep learning techniques, where deep learning was widely used to capture user preference from behavior records. However, researchers usually place emphasis on sequential change while ignore the correlation between user's historical behaviors and candidate item's characteristics (history-candidate association), which leads to the inaccurate matching between target users and candidate items. In this paper, we proposed a deep learning model to explore both sequential influence and history-candidate association in sequential recommendation, namely DeepAssociate. First, we considered the history-candidate association in user preference representation and obtained it by two steps, including sequential influence extraction and association feature extraction. Then, by defining a weighted objective function, we introduced an integrated framework which makes a combination of sequential and association features extraction and prediction module to enhance recommendation performance. Experimental results on four real-world datasets demonstrated that DeepAssociate model outperformed state-of-the-art methods on recommendation performance. Furthermore, a series of extensive experiments indicated the benefit of utilizing history-candidate association feature in reducing model complexity and accelerating model convergence.
引用
收藏
页数:15
相关论文
共 48 条
[1]   A review on deep learning for recommender systems: challenges and remedies [J].
Batmaz, Zeynep ;
Yurekli, Ali ;
Bilge, Alper ;
Kaleli, Cihan .
ARTIFICIAL INTELLIGENCE REVIEW, 2019, 52 (01) :1-37
[2]   A Session-Based Customer Preference Learning Method by Using the Gated Recurrent Units With Attention Function [J].
Chen, Jenhui ;
Abdul, Ashu .
IEEE ACCESS, 2019, 7 :17750-17759
[3]  
Chen T., 2019, ARXIV191102752CS
[4]   MV-RNN: A Multi-View Recurrent Neural Network for Sequential Recommendation [J].
Cui, Qiang ;
Wu, Shu ;
Liu, Qiang ;
Zhong, Wen ;
Wang, Liang .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2020, 32 (02) :317-331
[5]   Exploring user movie interest space: A deep learning based dynamic recommendation model [J].
Gan, Mingxin ;
Cui, Hongfei .
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 173
[6]  
Gan MX, 2019, PROCEEDINGS OF THE 52ND ANNUAL HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, P1126
[7]   COUSIN: A network-based regression model for personalized recommendations [J].
Gan, Mingxin .
DECISION SUPPORT SYSTEMS, 2016, 82 :58-68
[8]   ROUND: Walking on an object-user heterogeneous network for personalized recommendations [J].
Gan, Mingxin ;
Jiang, Rui .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (22) :8791-8804
[9]   Improving accuracy and diversity of personalized recommendation through power law adjustments of user similarities [J].
Gan, Mingxin ;
Jiang, Rui .
DECISION SUPPORT SYSTEMS, 2013, 55 (03) :811-821
[10]   Constructing a user similarity network to remove adverse influence of popular objects for personalized recommendation [J].
Gan, Mingxin ;
Jiang, Rui .
EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (10) :4044-4053