In order to model the evolution of user preference, we should learn user/item embeddings based on time-ordered item purchasing sequences, which is defined as Sequential Recommendation (SR) problem. Existing methods leverage sequential patterns to model item transitions. However, most of them ignore crucial temporal collaborative signals, which are latent in evolving user-item interactions and coexist with sequential patterns. Therefore, we propose to unify sequential patterns and temporal collaborative signals to improve the quality of recommendation, which is rather challenging. Firstly, it is hard to simultaneously encode sequential patterns and collaborative signals. Secondly, it is non-trivial to express the temporal effects of collaborative signals. Hence, we design a new framework Temporal Graph Sequential Recommender (TGSRec) upon our defined continuous-time bi-partite graph. We propose a novel Temporal Collaborative Trans-former (TCT) layer in TGSRec, which advances the self-attention mechanism by adopting a novel collaborative attention. TCT layer can simultaneously capture collaborative signals from both users and items, as well as considering temporal dynamics inside sequential patterns. We propagate the information learned fromTCTlayerover the temporal graph to unify sequential patterns and temporal collaborative signals. Empirical results on five datasets show that TGSRec significantly outperforms other baselines, in average up to 22.5% and 22.1%absolute improvements in Recall@10and MRR, respectively.
翻译:为了模拟用户偏好的变化,我们应学习基于时间顺序项目采购序列的用户/项目嵌入,这被定义为序列建议(SR)问题。现有方法利用顺序模式来模拟项目过渡。然而,大多数方法忽略关键的时间协作信号,这些信号在用户-项目互动的演变中潜伏,并与相继模式共存。因此,我们提议统一顺序模式和时间合作信号,以提高建议的质量,这是相当具有挑战性。首先,很难同时编码顺序模式和协作信号。第二,表达协作信号的时间效应是非三进制的。因此,我们设计一个新的框架“时间图序列建议”(TGSRec)用于模拟项目过渡。但是,我们提议在TGSRec 中建立一个新型的“时间-项目合作互换(TCTT)”图层,通过采用新的协作关注来提高自我保存机制的质量。TCT10层可以同时从用户和项目中获取协作信号,并考虑连续模式中的时间动态。因此,我们设计了一个新的框架“时间表”序列建议(TGS)建议(TGS Rec)建议(TGS) (TGS) (TGS) (TGS) (TGS) (TGS) (TRC) (Tr) (T) (T) (Tr) (Tr) (O) (O) (O) (O) (B) (B) (B) (O) (O) (O) (B) (B) (M) (O) (B) (M) (B) (M) (B) (M) (B) (B) (B) (B) (B) (B) (B) (B) (B) (B) (B) (B) (B) (B) (B) (B) (B) (B) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T) (T