Temporal Item Embedding with Static Similarity Regularization for Sequential Recommendation

Recommender systems have attracted a significant amount of research interests in recent years. Traditional methods such as content-based approaches and collaborative filtering approaches mainly focus on modeling the general user preference by using the user's whole purchase history. However, except for user preference, the sequential information should also be considered because human behavior exhibits sequential patterns. The methods considering both sequential item relationship and user preference are called sequential recommendation methods, which are mostly base on Markov Chains. Due to the difficulty of parameter estimation, most prior work only considers the latest interaction, which is insufficient according to our observations. To that end, in this paper, we propose a temporal item embedding method based on word2vec framework to model long purchase history, with each purchased item regarded as a word in sentence. Meanwhile, inspired by the collaborative filtering in traditional recommendations, we assume that similar items should have similar embeddings and propose static similarity regularization (SSR) in recommendation. The regularized item embedding can capture user preference and sequential item relationship simultaneously. Experiments on real-world datasets show that the proposed approach outperforms a spectrum of state-of-the-art algorithms.

[1]  Julian J. McAuley,et al.  Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendation , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).

[2]  Chuanren Liu,et al.  A Unified View of Social and Temporal Modeling for B2B Marketing Campaign Recommendation , 2018, IEEE Transactions on Knowledge and Data Engineering.

[3]  Alejandro Bellogín,et al.  Collaborative filtering based on subsequence matching: A new approach , 2017, Inf. Sci..

[4]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..

[5]  Jeffrey Dean,et al.  Distributed Representations of Words and Phrases and their Compositionality , 2013, NIPS.

[6]  Patrick Seemann,et al.  Matrix Factorization Techniques for Recommender Systems , 2014 .

[7]  Julian J. McAuley,et al.  Translation-based Recommendation , 2017, RecSys.

[8]  Jian Wang,et al.  Utilizing related products for post-purchase recommendation in e-commerce , 2011, RecSys '11.

[9]  George Karypis,et al.  FISM: factored item similarity models for top-N recommender systems , 2013, KDD.

[10]  Quoc V. Le,et al.  Distributed Representations of Sentences and Documents , 2014, ICML.

[11]  George Karypis,et al.  SLIM: Sparse Linear Methods for Top-N Recommender Systems , 2011, 2011 IEEE 11th International Conference on Data Mining.

[12]  Lina Yao,et al.  Unified Collaborative and Content-Based Web Service Recommendation , 2015, IEEE Transactions on Services Computing.

[13]  Xin Liu,et al.  Exploring the Context of Locations for Personalized Location Recommendations , 2016, IJCAI.

[14]  Lars Schmidt-Thieme,et al.  BPR: Bayesian Personalized Ranking from Implicit Feedback , 2009, UAI.

[15]  Julian J. McAuley,et al.  SPMC: Socially-Aware Personalized Markov Chains for Sparse Sequential Recommendation , 2017, IJCAI.

[16]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[17]  Michael R. Lyu,et al.  Geo-Teaser: Geo-Temporal Sequential Embedding Rank for POI Recommendation , 2018 .

[18]  Lars Schmidt-Thieme,et al.  Factorizing personalized Markov chains for next-basket recommendation , 2010, WWW '10.

[19]  Greg Linden,et al.  Amazon . com Recommendations Item-to-Item Collaborative Filtering , 2001 .

[20]  Loriene Roy,et al.  Content-based book recommending using learning for text categorization , 1999, DL '00.

[21]  Chong Wang,et al.  Collaborative topic modeling for recommending scientific articles , 2011, KDD.

[22]  Mingzhe Wang,et al.  LINE: Large-scale Information Network Embedding , 2015, WWW.