Abstract
Recommender constantly suffers from the problems of data sparsity and cold-start. As suggested by social theories, people often alter their ways of behaving and thinking to cater to social environments, especially their friends. For this reason, prior studies have integrated social relations into recommender systems to help infer user preference when there are few available data, which is known as social recommendation. However, explicit social relations are also sparse and meanwhile are usually noisy. To enhance social recommendation, a few studies identify more reliable implicit relations for each user over the user-item and user-user networks. Among these research efforts, meta-paths guided search shows state-of-the-art performance. However, designing meta-paths requires prior knowledge from domain experts, which may hinder the applicability of this line of research. In this work, we propose a novel social recommendation model (JUST-BPR) with a meta-path-free strategy to search for implicit friends. Concretely, We adopt the idea of ’Jump and Stay’, which is a heterogeneous random walk technique, to social recommendation. Based on this idea, we manage to bypass the design of meta-paths and obtain high-quality implicit relations in a more efficient way. Then we integrate these implicit relations into an augmented social Bayesian Personalized Ranking model for top-N recommendation. Experiments on two real-world datasets show the superiority of the proposed method and demonstrate the differences between implicit friends discovered by meta-paths and JUST-BPR, respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
References
Cialdini, R.B., Goldstein, N.J.: Social influence: compliance and conformity. Annu. Rev. Psychol. 55, 591–621 (2004)
Dong, Y., Chawla, N.V., Swami, A.: metapath2vec: scalable representation learning for heterogeneous networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 135–144. ACM (2017)
Hussein, R., Yang, D., Cudré-Mauroux, P.: Are meta-paths necessary?: Revisiting heterogeneous graph embeddings. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 437–446. ACM (2018)
Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 135–142. ACM (2010)
Ma, H.: An experimental study on implicit social recommendation. In: International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 73–82 (2013)
Ma, H., King, I., Lyu, M.R.: Learning to recommend with social trust ensemble. In: Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 203–210. ACM (2009)
Ma, H., Yang, H., Lyu, M.R., King, I.: SoRec: social recommendation using probabilistic matrix factorization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 931–940. ACM (2008)
Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)
Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, pp. 3111–3119 (2013)
Onnela, J.P., et al.: Structure and tie strengths in mobile communication networks. Proc. Nat. Acad. Sci. 104(18), 7332–7336 (2007)
Rendle, S., Freudenthaler, C., Gantner, Z., Schmidt-Thieme, L.: BPR: Bayesian personalized ranking from implicit feedback. In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, pp. 452–461. AUAI Press (2009)
Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: PathSim: meta path-based top-K similarity search in heterogeneous information networks. Proc. VLDB Endowment 4(11), 992–1003 (2011)
Wang, M., Zheng, X., Yang, Y., Zhang, K.: Collaborative filtering with social exposure: a modular approach to social recommendation. arXiv preprint arXiv:1711.11458 (2017)
Wang, X., Hoi, S.C., Ester, M., Bu, J., Chen, C.: Learning personalized preference of strong and weak ties for social recommendation. In: Proceedings of the 26th International Conference on World Wide Web, International World Wide Web Conferences Steering Committee, pp. 1601–1610 (2017)
Wu, L., Sun, P., Hong, R., Fu, Y., Wang, X., Wang, M.: SocialGCN: an efficient graph convolutional network based model for social recommendation. arXiv preprint arXiv:1811.02815 (2018)
Yu, J., Gao, M., Li, J., Yin, H., Liu, H.: Adaptive implicit friends identification over heterogeneous network for social recommendation. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 357–366. ACM (2018)
Yu, J., Gao, M., Yin, H., Li, J., Gao, C., Wang, Q.: Generating reliable friends via adversarial training to improve social recommendation. In: 2019 IEEE International Conference on Data Mining (ICDM), pp. 768–777. IEEE (2019)
Yu, J., Yin, H., Li, J., Gao, M., Huang, Z., Cui, L.: Enhance social recommendation with adversarial graph convolutional networks. arXiv preprint arXiv:2004.02340 (2020)
Zhang, C., Yu, L., Wang, Y., Shah, C., Zhang, X.: Collaborative user network embedding for social recommender systems. In: Proceedings of the 2017 SIAM International Conference on Data Mining, pp. 381–389. SIAM (2017)
Zhao, T., McAuley, J., King, I.: Leveraging social connections to improve personalized ranking for collaborative filtering. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 261–270. ACM (2014)
Acknowledgements
This study was supported by the National Key Research and Development Program of China (2018YFF0214706), the Natural Science Foundation of Chongqing, China (cstc2020jcyj-msxmX0690), the Graduate Student Research Innovation Project (CYS19052), the Fundamental Research Funds for the Central Universities of Chongqing University (2020CDJ-LHZZ-039), the Key Research Program of Chongqing Technology Innovation and Application Development (cstc2019jscx-fxydX0012), and the Key Research Program of Chongqing Science & Technology Commission(cstc2019jscx-zdztzxX0031).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, R., Gao, M., Zhang, J., Zhao, Q. (2020). JUST-BPR: Identify Implicit Friends with Jump and Stay for Social Recommendation. In: Yang, H., Pasupa, K., Leung, A.CS., Kwok, J.T., Chan, J.H., King, I. (eds) Neural Information Processing. ICONIP 2020. Lecture Notes in Computer Science(), vol 12534. Springer, Cham. https://doi.org/10.1007/978-3-030-63836-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-63836-8_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-63835-1
Online ISBN: 978-3-030-63836-8
eBook Packages: Computer ScienceComputer Science (R0)