Abstract
Recommendation systems have received great attention for their commercial value in today’s online business world. Although matrix factorization is one of the most popular and most effective recommendation methods in recent years, it also encounters the data sparsity problem and the cold-start problem, which leads it is very difficult problem to further improve recommendation accuracy. In this paper, we propose a novel factor analysis approach to solve this hard problem by incorporating additional sources of information about the users and items into recommendation systems. Firstly, it introduces some unreasonable prior hypothesises to the features while using probabilistic matrix factorization algorithm (PMF). Then, it points out that it is neccesary to give two new hypothesises about conditional probability distribution of user and item feature and buliding some concepts such as social relation, social reliable similarity propagation metrics, and social reliable similarity propagation algorithm (SRSP). Finally, a kind of a novel recommendation algorithm is proposed based on SRSP and probabilistic matrix factorization (SRSP-PMF). The experimental results show that our method performs much better than the state-of-the-art approaches to long tail recommendation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ma, H., Yang, H., Lyu, M.R., et al.: Sorec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 931–940. ACM (2008)
Iwata, T., Takeuchi, K.: Cross-domain recommendation without shared users or items by sharing latent vector distributions. In: Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, pp. 379–387 (2015)
Ma, H., Lyu, M.R., King, I.: Learning to recommend with trust and distrust relationships. In: Proceedings of the Third ACM Conference on Recommender Systems, pp. 189–196. ACM (2009)
Jiang, M., Cui, P., Wang, F., et al.: Scalable recommendation with social contextual information. IEEE Trans. Knowl. Data Eng. 26(11), 2789–2802 (2014)
Severinski, C., Salakhutdinov, R.: Bayesian Probabilistic Matrix Factorization: A User Frequency Analysis. arXiv preprint arXiv:1407.7840 (2014)
O’Donovan, P., Agarwala, A., Hertzmann, A.: Collaborative filtering of color aesthetics. In: Proceedings of the Workshop on Computational Aesthetics, pp. 33–40. ACM (2014)
Yu, L., Pan, R., Li, Z.: Adaptive social similarities for recommender systems. In: Proceedings of the fifth ACM Conference on Recommender Systems, pp. 257–260. ACM (2011)
Li, Q., Zheng, Y., Xie, X., et al.: Mining user similarity based on location history. In: Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, p. 34. ACM (2008)
Ying, J.J.C., Lu E.H.C., Lee, W.C., et al.: Mining user similarity from semantic trajectories. In: Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Location Based Social Networks, pp. 19–26. ACM (2010)
Zhao, Q.-Q., Lu, K., Wang, B.: SPCF: a memory based collaborative filtering algorithm via propagation. Chin. J. Comput. 36(3), 671–676 (2013)
Hu, F.-H., Zheng, X.-L., Gan, H.-H.: Collaborative filtering algorithm based on similarity propagation. Comput. Eng. 37(10), 50–51 (2011)
Ma, H., Yang, H., Lyu, M.R., et al.: Sorec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 931–940. ACM (2008)
Yang, X., Steck, H., Liu, Y.: Circle-based recommendation in online social networks. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1267–1275. ACM (2012)
Guo, L., Ma, J., Chen, Z., et al.: Learning to recommend with social relation ensemble. In: Proceedings of the 21st ACM international conference on Information and knowledge management, 2599–2602. ACM (2012)
Bhuiyan, T.: A survey on the relationship between trust and interest similarity in online social networks. J. Emerg. Technol. Web Intell. 2(4), 291–299 (2010)
Yu, Y., Qiu, G.: Research on collaborative filtering recommendation algorithm by fusing social network. New Technol. Libr. Inf. Serv. 006, 54–59 (2012)
Acknowledgment
This work is supported by the Humanities and Social Science Research Projects of the Ministry of Education of P.R.C (11YJA860028).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Xiao, R., Li, Y., Chen, H., Ni, Y., Du, X. (2015). SRSP-PMF: A Novel Probabilistic Matrix Factorization Recommendation Algorithm Using Social Reliable Similarity Propagation. In: Huang, DS., Jo, KH., Hussain, A. (eds) Intelligent Computing Theories and Methodologies. ICIC 2015. Lecture Notes in Computer Science(), vol 9226. Springer, Cham. https://doi.org/10.1007/978-3-319-22186-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-22186-1_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22185-4
Online ISBN: 978-3-319-22186-1
eBook Packages: Computer ScienceComputer Science (R0)