Social Recommendation System for Real World Online Application

Miss. Pranali M. Sonawane, Sir Visvesvaraya Institute Of Technology,Chincholi Sinnar; Prof. S. M. Rokade ,Sir Visvesvaraya Institute Of Technology,Chincholi Sinnar

Online Social Recommendation, User Preference Learning, Low Rank

Social recommendation system has attracted a lot of attention recently in the research communities of information retrieval, machine learning and data mining. Traditional social recommendation algorithms are often based on batch machine learning methods which suffer from several critical limitations, e.g., extremely expensive model retraining cost whenever new user ratings arrive, unable to capture the change of user preferences over time. Therefore, it is important to make social recommendation system suitable for real world online applications where data often arrives sequentially and user preferences may change dynamically and rapidly. In this paper, we present a new framework of online social recommendation from the viewpoint of online graph regularized user preference learning (OGRPL), which incorporates both collaborative user-item relationship as well as item content features into an unified preference learning process. I further develop an efficient iterative procedure, OGRPL-FW which utilizes the Frank-Wolfe algorithm, to solve the proposed online optimization problem.
    [1] J. Abernethy, K. Canini, J. Langford, and A. Simma. Online collaborative filtering. University of California at Berkeley, Tech. Rep, 2007. [2] M. Belkin, P. Niyogi, and V. Sindhwani. Manifold regularization: Ageometric framework for learning from labeled and unlabelled examples. The Journal of Machine Learning Research, 7:2399–2434, 2006. [3] M. Blondel, Y. Kubo, and U. Naonori. Online passive-aggressive algorithms for non-negative matrix factorization and completion. In Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, pages 96–104, 2014. [4] E. J. Candes and Y. Plan. Matrix completion with noise. Proceedings of the IEEE, 98(6):925–936, 2010. [5] K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer. Online passive-aggressive algorithms. The Journal of Machine Learning Research, 7:551–585, 2006. [6] X. Ding, X. Jin, Y. Li, and L. Li. Celebrity recommendation with collaborative social topic regression. In Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, pages 2612 2618. AAAI Press, 2013. [7] M. Ester. Recommendation in social networks. In RecSys, pages 491–492, 2013. [8] W. Feng and J. Wang. Incorporating heterogeneous information for personalized tag recommendation in social tagging systems. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1276–1284. ACM, 2012. [9] P. Forbes and M. Zhu. Content-boosted matrix factorization for recommender systems: experiments with recipe recommendation. In Proceedings of the fifth ACM conference on Recommender systems, pages 261–264. ACM, 2011. [10] H. Gao, J. Tang, X. Hu, and H. Liu. Exploring temporal effects for location recommendation on location-based social networks. In Proceedings of the 7th ACM conference on Recommender systems, pages93–100. ACM, 2013. [11] H. Gao, J. Tang, X. Hu, and H. Liu. Content-aware point of interest recommendation on location-based social networks. AAAI, 2015. [12] N. Guan, D. Tao, Z. Luo, and B. Yuan. Online nonnegative matrix factorization with robust stochastic approximation. Neural Networks and Learning Systems, IEEE Transactions on, 23(7):1087–1099, 2012. [13] E. Hazan and S. Kale. Projection-free online learning. arXiv preprintarXiv:1206.4657, 2012. [14] G.-N. Hu, X.-Y. Dai, Y. Song, S.-J. Huang, and J.-J. Chen. A synthetic approach for recommendation: Combining ratings, social relations, and reviews. [15] M. Jaggi. Revisiting frank-Wolfe: Projection-free sparse convex optimization. In Proceedings of the 30th International Conference on Machine Learning (ICML-13), pages 427–435, 2013. [16] M. Jaggi, M. Sulovsk, et al. A simple algorithm for nuclear norm regularized problems. In Proceedings of the 27th International Conference on Machine Learning (ICML-10), pages 471–478, 2010. [17] S. Ji and J. Ye. An accelerated gradient method for trace norm minimization.In Proceedings of the 26th Annual International Conferenceon Machine Learning, pages 457–464. ACM, 2009. [18] M. Jiang, P. Cui, F. Wang, W. Zhu, and S. Yang. Scalable recommendation with social contextual information. Knowledge and Data Engineering, IEEE Transactions on.
Paper ID: GRDJEV02I070093
Published in: Volume : 2, Issue : 7
Publication Date: 2017-07-01
Page(s): 109 - 113