TY - GEN
T1 - Temporal Augmented Graph Neural Networks for Session-Based Recommendations
AU - Zhou, Huachi
AU - Tan, Qiaoyu
AU - Huang, Xiao
AU - Zhou, Kaixiong
AU - Wang, Xiaoling
N1 - Funding Information:
This work is jointly supported by PolyU (UGC) Start-up Fund (#P0033934) and NSFC grants (No. 61972155), Zhejiang Lab under No.2019KB0AB04.
Publisher Copyright:
© 2021 ACM.
PY - 2021/7/11
Y1 - 2021/7/11
N2 - Session-based recommendation aims to predict the next item that is most likely to be clicked by an anonymous user, based on his/her clicking sequence within one visit. It becomes an essential function of many recommender systems since it protects privacy. However, as the accumulated session records keep increasing, it becomes challenging to model the user interests since they would drift when the time span is large. Efforts have been devoted to handling dynamic user interests by modeling all historical sessions at one time or conducting offline retraining regularly. These solutions are far from practical requirements in terms of efficiency and capturing timely user interests. To this end, we propose a memory-efficient framework - TASRec. It constructs a graph for each day to model the relations among items. Thus, the same item on different days could have different neighbors, corresponding to the drifting user interests. We design a tailored graph neural network to embed this dynamic graph of items and learn temporal augmented item representations. Based on this, we leverage a sequential neural architecture to predict the next item of a given sequence. Experiments on real-world datasets demonstrate that TASRec outperforms state-of-the-art session-based recommendation methods.
AB - Session-based recommendation aims to predict the next item that is most likely to be clicked by an anonymous user, based on his/her clicking sequence within one visit. It becomes an essential function of many recommender systems since it protects privacy. However, as the accumulated session records keep increasing, it becomes challenging to model the user interests since they would drift when the time span is large. Efforts have been devoted to handling dynamic user interests by modeling all historical sessions at one time or conducting offline retraining regularly. These solutions are far from practical requirements in terms of efficiency and capturing timely user interests. To this end, we propose a memory-efficient framework - TASRec. It constructs a graph for each day to model the relations among items. Thus, the same item on different days could have different neighbors, corresponding to the drifting user interests. We design a tailored graph neural network to embed this dynamic graph of items and learn temporal augmented item representations. Based on this, we leverage a sequential neural architecture to predict the next item of a given sequence. Experiments on real-world datasets demonstrate that TASRec outperforms state-of-the-art session-based recommendation methods.
KW - dynamic user interests
KW - graph neural networks
KW - session-based recommendations
UR - http://www.scopus.com/inward/record.url?scp=85111644977&partnerID=8YFLogxK
U2 - 10.1145/3404835.3463112
DO - 10.1145/3404835.3463112
M3 - Conference article published in proceeding or book
T3 - SIGIR 2021 - Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval
SP - 1798
EP - 1802
BT - SIGIR 2021 - Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval
T2 - 44th International ACM SIGIR Conference on Research and Development in Information Retrieval
Y2 - 11 July 2021 through 15 July 2021
ER -