A Reliable Solution for Sparsity Problem in Collaborative Filtering Using Demographic Approach
DOI:
https://doi.org/10.26438/ijcse/v7i9.5459Keywords:
Recommender systems, Collaborative filtering, prediction, reliability, locationAbstract
Now a day’s online resources are increasing very rapidly like amazon and flipchart, eBay etc. The main role of recommendation systems is to provide recommendations based upon the ratings given by the users.it suffers from the sparsity to reduce that we are going to introduce a reliable solution that motives to perform better results using a demographic approach. Each prediction consorts with a reliability measure. Reliability is a measure of how liable a prediction is. So each recommendation for a user is associated with a pair of values those are Prediction and reliability. Quality of reliability is also discussed. Experimental results show that our proposed reliable solution using demographic approach has increased the overall recommendation and reduced the sparsity.
References
[1] G. Adomavicius, A. Tuzhilin, Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions, IEEE.
[2] S. Alonso, E. Herrera-Viedma, F. Chiclana, F. Herrera, A web based consensus support system for group decision making problems and incomplete preferences, Information Sciences 180 (23) (2010) 4477–4495.
[3] N. Antonopoulus, J. Salter, Cinema screen recommender agent: combining collaborative and content-based filtering, IEEE Intelligent Systems (2006) 35–41.
[4] A. Barragáns-Martínez, E. Costa-Montenegro, J. Burguillo, M. Rey-López, F. Mikic-Fonte, A. Peleteiro, A hybrid content-based and item-based collaborative filtering approach to recommend tv programs enhanced with singular value decomposition, Inform. Sci. 180 (22) (2010) 4290–4311.
[5]S. Zhang, W. Wang, J. Ford, F. Makedon, Learning from incomplete ratings using non-negative matrix factorization, in: SDM, SIAM, 2006, pp.549–553.
[6] G. Beliakov, G. Li, Improving the speed and stability of the k-nearest neighbors method, Pattern Recognition Letters 33 (2012) 1296–1301.
[7] J. Bobadilla, F. Ortega, A. Hernando, A. Gutiérrez, Recommender systems survey, Knowledge-Based Systems 46 (2013) 109–132.
[8] P. Resnick, H.R. Varian, Recommender systems, Communications of the ACM 40 (1997) 56–58.
[9]S.AmerYahia,S.B.Roy,A.Chawlat,G.Das,C.Yu,Group recommendation : semantics and efficiency ,in: Proceedings of the 35th International Conference on Very Large DataBases,2009,pp.754–765.
[10]B.Sarwar,G.Karypis,J.Konstan,J.Riedl,Item-based collaborative filtering recommendation algorithms, in: Proceedings of the 10th International Conference on World Wide Web, WWW`01, ACM, NewYork, NY, USA, 2001, pp. 285–295.
[11] K. Ali and W. van Stam, “TiVo: Making show recommendations using a distributed collaborative filtering architecture,” in ACM KDD ’04, pp. 394–401, ACM, 2004.
[12] X. Amatriain, J. Pujol, and N. Oliver, “I like it. . . I like it not: Evaluating user ratings noise in recommender systems,” in UMAP 2009, vol. 5535 of LectureNotes in Computer Science, pp. 247–258, Springer, 2009.
[13] X. Amatriain, J. M. Pujol, N. Tintarev, and N. Oliver, “Rate it again:Increasing recommendation accuracy by user re-rating,” in ACM RecSys ’09,pp. 173–180, ACM, 2009.
[14] C. De Rosa, J. Cantrell, A. Havens, J. Hawk, L. Jenkins, B. Gauder, R. Limes, D. Cellentani, and OCLC,Sharing, privacy and trust in our networked world: A report to the OCLC membership. OCLC, 2007.
[15] X. Zhou, Y. Xu, Y. Li, A. Josang, and C. Cox, “The state-of-the-art in personalized recommender systems.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
