Abstract
The overabundance of information and the related difficulty to discover interesting content has complicated the selection process for endusers. Recommender systems try to assist in this content-selection process by using intelligent personalisation techniques which filter the information. Most commonly-used recommendation algorithms are based on Collaborative Filtering (CF). However, present-day CF techniques are optimized for suggesting provider-generated content and partially lose their effectiveness when recommending user-generated content. Therefore, we propose an advanced CF algorithm which considers the specific characteristics of user-generated content (like the sparsity of the data matrix). To alleviate this sparsity problem, profiles are extended with probable future consumptions. These extended profiles increase the profile overlap probability, thereby increasing the number of neighbours used for calculating the recommendations. This way, the recommendations become more precise and diverse compared to traditional CF recommendations. This paper explains the proposed algorithm in detail and demonstrates the improvements on standard CF.
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
Preview
Unable to display preview. Download preview PDF.
References
Bell, R.M., Koren, Y.: Lessons from the netflix prize challenge. SIGKDD Explor. Newsl. 9(2), 75–79 (2007)
Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering, pp. 43–52. Morgan Kaufmann, San Francisco (1998)
Campochiaro, E., Casatta, R., Cremonesi, P., Turrin, R.: Do metrics make recommender algorithms? In: International Conference on Advanced Information Networking and Applications Workshops, pp. 648–653 (2009)
Celma, O., Cano, P.: From hits to niches?: or how popular artists can bias music recommendation and discovery. In: NETFLIX 2008: Proceedings of the 2nd KDD Workshop on Large-Scale Recommender Systems and the Netflix Prize Competition, pp. 1–8. ACM, New York (2008)
Cha, M., Kwak, H., Rodriguez, P., Ahn, Y.Y., Moon, S.: I tube, you tube, everybody tubes: analyzing the world’s largest user generated content video system. In: IMC 2007: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, pp. 1–14. ACM, New York (2007)
Davidson, J., Liebald, B., Liu, J., Nandy, P., Van Vleet, T., Gargi, U., Gupta, S., He, Y., Lambert, M., Livingston, B., Sampath, D.: The youtube video recommendation system. In: RecSys 2010: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 293–296. ACM, New York (2010)
Evain, J.P., MartÃnez, J.M.: Tv-anytime phase 1 and mpeg-7. J. Am. Soc. Inf. Sci. Technol. 58(9), 1367–1373 (2007)
Hayes, C., Massa, P., Avesani, P., Cunningham, P.: An on-line evaluation framework for recommender systems. In: Workshop on Personalization and Recommendation in E-Commerce. Springer, Malaga (2002)
Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: SIGIR 1999: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 230–237. ACM, New York (1999)
Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22(1), 5–53 (2004)
Huang, Z., Zeng, D., Chen, H.: A link analysis approach to recommendation with sparse data. In: AMCIS 2004: Americas Conference on Information Systems, New York, NY, USA (2004)
Huang, Z., Chen, H., Zeng, D.: Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Trans. Inf. Syst. 22(1), 116–142 (2004)
Karypis, G.: Evaluation of item-based top-n recommendation algorithms. In: CIKM 2001: Proceedings of the Tenth International Conference on Information and Knowledge Management, pp. 247–254. ACM, New York (2001)
Linden, G., Smith, B., York, J.: Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Computing 7(1), 76–80 (2003), http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1167344
McNee, S.M., Riedl, J., Konstan, J.A.: Being accurate is not enough: how accuracy metrics have hurt recommender systems. In: CHI 2006: extended abstracts on Human Factors in Computing Systems, pp. 1097–1101. ACM, New York (2006)
Papagelis, M., Plexousakis, D., Kutsuras, T.: Trust Management. Springer, Heidelberg (2005)
Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of recommendation algorithms for e-commerce. In: EC 2000: Proceedings of the 2nd ACM Conference on Electronic Commerce, pp. 158–167. ACM, New York (2000)
Segaran, T.: Programming collective intelligence. O’Reilly, Sebastopol (2007)
Shani, G.: Tutorial on evaluating recommender systems. In: RecSys 2010: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 1–1. ACM, New York (2010)
Weng, J., Miao, C., Goh, A., Shen, Z., Gay, R.: Trust-based agent community for collaborative recommendation. In: AAMAS 2006: Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1260–1262. ACM, New York (2006)
Yu, Z., Zhou, X.: Tv3p: an adaptive assistant for personalized tv. IEEE Transactions on Consumer Electronics 50(1), 393–399 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Pessemier, T., Vanhecke, K., Dooms, S., Deryckere, T., Martens, L. (2011). Extending User Profiles in Collaborative Filtering Algorithms to Alleviate the Sparsity Problem. In: Filipe, J., Cordeiro, J. (eds) Web Information Systems and Technologies. WEBIST 2010. Lecture Notes in Business Information Processing, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22810-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-22810-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22809-4
Online ISBN: 978-3-642-22810-0
eBook Packages: Computer ScienceComputer Science (R0)