Joint rating and trust prediction based on collective matrix factorization

被引:0
作者
Zhang W.-Y. [1 ,2 ]
Wu B. [1 ]
Geng Y.-S. [2 ]
Zhu J. [1 ]
机构
[1] Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, Beijing
[2] School of Information, Qilu University of Technology, Jinan, 250353, Shandong
来源
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2016年 / 44卷 / 07期
关键词
Probabilistic matrix factorization; Recommendation algorithms; Social rating networks; Trust prediction;
D O I
10.3969/j.issn.0372-2112.2016.07.009
中图分类号
学科分类号
摘要
Trust prediction and information item rating are two fundamental tasks for social rating network systems. In response to data sparsity of trust relation and rating information encountered when improving the accuracy of predicting the two basic problems, we present a joint model of rating and trust prediction based on collective matrix factorization. In our model, trust relation matrix and information rating matrix are factorized into latent features matrixes collectively. We can make full use of correspondence among users and information items by sharing latent user feature. Moreover, our model can capture the data dependent effect of trust domains and rating domain separately. By using those learned latent features matrixes multiplication, we can obtain predictions of trust and rating. Experimental results on two real network data demonstrate that our model is more accurate than other state-of-the-art methods. © 2016, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码:1581 / 1586
页数:5
相关论文
共 14 条
[1]  
Liben Nowell D., Kleinberg J., The link-prediction problem for social networks, Journal of the American Society for Information Science and Technology, 58, 7, pp. 1019-1031, (2007)
[2]  
Guha R., Kumar R., Raghavan P., Et al., Propagation of trust and distrust, Proceedings of the 13th International Conference on World Wide Web, pp. 403-412, (2004)
[3]  
Tang J., Gao H., Hu X., Et al., Exploiting homophily effect for trust prediction, Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 53-62, (2013)
[4]  
Liu H., Lim E.P., Lauw H.W., Et al., Predicting trusts among users of online communities: an epinions case study, Proceedings of the 9th ACM Conference on Electronic Commerce, pp. 310-319, (2008)
[5]  
Tang J., Gao H., Liu H., mTrust: discerning multi-faceted trust in a connected world, Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, pp. 93-102, (2012)
[6]  
Lee D.D., Seung H.S., Algorithms for non-negative matrix factorization, Proceedings of Advances in Neural Information Processing Systems, pp. 556-562, (2001)
[7]  
Luo X., Zhou M., Et al., An efficient non-negative matrix-factorization-based approach to collaborative filtering for recommender systems, IEEE Transactions on Industrial Informatics, 10, 2, pp. 1273-1284, (2014)
[8]  
Mnih A., Salakhutdinov R., Probabilistic matrix factorization, Proceedings of Advances in Neural Information Processing Systems 2007, pp. 1257-1264
[9]  
Singh A.P., Gordon G.J., Relational learning via collective matrix factorization, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 650-658, (2008)
[10]  
Pan W., Yang Q., Transfer learning in heterogeneous collaborative filtering domains, Artificial Intelligence, 197, pp. 39-55, (2013)