Temporal Matrix Factorization for Tracking Concept Drift in Individual User Preferences

被引:37
作者
Lo, Yung-Yin [1 ]
Liao, Wanjiun [1 ]
Chang, Cheng-Shang [2 ]
Lee, Ying-Chin [2 ]
机构
[1] Natl Taiwan Univ, Dept Elect Engn, Taipei 10617, Taiwan
[2] Natl Tsing Hua Univ, Inst Commun Engn, Hsinchu 300, Taiwan
关键词
Concept drift; matrix factorization (MF); rating prediction; recommender systems; temporal dynamics;
D O I
10.1109/TCSS.2017.2772295
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The matrix factorization (MF) technique has been widely adopted for solving the rating prediction problem in recommender systems. The MF technique utilizes the latent factor model to obtain static user preferences (user latent vectors) and item characteristics (item latent vectors) based on historical rating data. However, in the real world, user preferences are not static but full of dynamics. Though there are several previous works that addressed this time-varying issue of user preferences, it seems (to the best of our knowledge) that none of them are specifically designed for tracking concept drift in individual user preferences. Motivated by this, we develop a temporal MF approach for tracking concept drift in each individual user latent vector. There are two key innovative steps in our approach: 1) we develop a modified stochastic gradient descent method to learn an individual user latent vector at each time step and 2) by Lasso regression, we learn a linear model for the transition of the individual user latent vectors. We test our method on a synthetic data set and several real data sets. In comparison with the original MF, our experimental results show that our temporal method is able to achieve lower root mean square errors (RMSEs) for both the synthetic and real data sets. One interesting finding is that the performance gain in RMSE is mostly from those users who indeed have concept drift in their user latent vectors at the time of prediction. In particular, for the synthetic data set and the Ciao data set, there are quite a few users with that property and the performance gains for these two data sets are roughly 20% and 5%, respectively.
引用
收藏
页码:156 / 168
页数:13
相关论文
共 31 条
[1]  
[Anonymous], 2006, Netflix update: Try this at home
[2]  
[Anonymous], 2010, P ACM WSDM
[3]  
[Anonymous], 2009, Proceedings of the Twenty-sixth International Conference on Machine Learning
[4]  
[Anonymous], 2013, ACM SIGKDD EXPLORATI
[5]  
[Anonymous], 2010, PROC SIAM INT C DATA, DOI DOI 10.1137/1.9781611972801.19
[6]   A Learning-Rate Schedule for Stochastic Gradient Methods to Matrix Factorization [J].
Chin, Wei-Sheng ;
Zhuang, Yong ;
Juan, Yu-Chin ;
Lin, Chih-Jen .
ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PART I, 2015, 9077 :442-455
[7]   A Fast Parallel Stochastic Gradient Method for Matrix Factorization in Shared Memory Systems [J].
Chin, Wei-Sheng ;
Zhuang, Yong ;
Juan, Yu-Chin ;
Lin, Chih-Jen .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2015, 6 (01)
[8]  
Ding Y, 2005, Proceedings of the 14th ACM international conference on Information and knowledge management, P485, DOI DOI 10.1145/1099554.1099689
[9]   Temporal Link Prediction Using Matrix and Tensor Factorizations [J].
Dunlavy, Daniel M. ;
Kolda, Tamara G. ;
Acar, Evrim .
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2011, 5 (02)
[10]   A Collaborative Kalman Filter for Time-Evolving Dyadic Processes [J].
Gultekin, San ;
Paisley, John .
2014 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2014, :140-149