skip to main content
10.1145/1806338.1806406acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiiwasConference Proceedingsconference-collections
short-paper

Collaborative filtering based on an iterative prediction method to alleviate the sparsity problem

Published: 14 December 2009 Publication History

Abstract

Collaborative filtering (CF) is one of the most popular recommender system technologies. It tries to identify users that have relevant interests and preferences by calculating similarities among user profiles. The idea behind this method is that, it may be of benefit to one's search for information to consult the preferences of other users who share the same or relevant interests and whose opinion can be trusted. However, the applicability of CF is limited due to the sparsity and cold-start problems. The sparsity problem occurs when available data are insufficient for identifying similar users (neighbors) and it is a major issue that limits the quality of recommendations and the applicability of CF in general. Additionally, the cold-start problem occurs when dealing with new users and new or updated items in web environments. Therefore, we propose an efficient iterative prediction technique to convert user-item sparse matrix to dense one and overcome the cold-start problem. Our experiments with MovieLens and book-crossing data sets indicate substantial and consistent improvements in recommendations accuracy compared with item-based collaborative filtering, singular value decomposition (SVD)-based collaborative filtering and semi explicit rating collaborative filtering.

References

[1]
Adomavicius, G.; Tuzhilin, A. 2005. Toward the Next generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions. In proceeding of IEEE Transactions on Knowledge and Data Engineering, 17, 6, 734--749.
[2]
Emmanouil Vozalis, Konstantinos G. Margaritis. 2003. Analysis of Recommender Systems' Algorithms. The 6th Hellenic European Conference on Computer Mathematics & its Applications (HERCMA), Athens, Greece.
[3]
Nichols, D. 1998. Implicit rating and filtering. In Proceedings of the fifth DELOS workshop on filtering and collaborative filtering, 31--36.
[4]
Grcar, M., Mladenic, D., Fortuna, B., & Grobelnik, M. 2006. Data sparsity issues in the collaborative filtering framework. Advances in Web Mining and Web Usage Analysis (LNAI. 4198), 58--76.
[5]
Schein, A. I., Popescul, A., Ungar, L. H. 2002. Methods and Metrics for Cold-Start Recommendations. In proceeding of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.
[6]
Breese, J. S., Heckerman, D., and Kadie, C. 1998. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI-98), 43--52.
[7]
Herlocker, J. L., Konstan, J. A., Terveen, L. G., & Riedl, J. T. 2004. Item-based top-n recommendation algorithms. ACM Transactions on Information Systems, 22, 1, 5--53.
[8]
Dr. A. C. Pugh, Keith Bradley, Barry Smyth. 2000. Automated Collaborative Filtering Applications for Online Recruitment Services. In proceeding of the International conference on Adaptive Hypermedia and Adaptive Web-based Systems.
[9]
Goldbergh, K., Roeder, T., Gupta, D., and Perkins, C. 2001. Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval. 4, 2, 133--151.
[10]
Sarwar, B. M., Karypis, G., Konstan, J. A., and Riedl, J. 2000. Application of Dimensionality Reduction in Recommender System---A Case Study. ACM WebKDD workshop.
[11]
Billsus, D., and Pazzani, M. J. 1998. Learning collaborative information filters. In proceeding of the 15th International Conference on Machine Learning, 46--54.
[12]
Huang, Z., Chen, H., Zeng, D. 2004. Applying Associative Retrieval Techniques to Alleviate the Sparsity Problem in Collaborative Filtering. ACM Transactions on Information Systems. 22, 1, 2004
[13]
Sarwar, B. M., Karypis, G., Konstan, J. A., & Reidl, J. 2001. Item-based collaborative filtering recommendation algorithms. In Proceedings of the 10th international conference on world wide web. 285--295.
[14]
Popescul, A., Ungar, L. H., Pennock, D. M., Lawrence, S. 2001. Probabilistic Models for Unified Collaborative and Content-Based Recommendation in Sparse-Data Environments. In proceeding of Uncertainty in Artificial Intelligence (UAI).
[15]
Chong-Ben Huang, Song-Jie Gong. 2008. Employing Rough Set Theory to Alleviate the Sparsity Issue in Recommender System. In proceedings of the Seventh International Conference on Machine Learning and Cybernetics, Kunming.
[16]
M. Papagelis, D. Plexousakis, and T. Kutsuras. 2005. Alleviating the Sparsity Problem of Collaborative Filtering using Trust Inferences. In Proceedings of Proceedings of the 3rd International Conference on Trust Management (iTrust 2005).
[17]
Andrew Y Ng, Michael I Jordan, Yair Weiss. 2001. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems. 14, 849--856.
[18]
Donghui Yan, Ling Huang, Michael I. Jordan. 2009. Fast Approximate Spectral Clustering. In Proceedings of the 15th ACM Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France.
[19]
Ziegler, C.-N., McNee, S. M., Konstan, J. A., & Lausen, G. 2005. Improving recommendation lists through topic diversification. In Proceedings of the 14th international world wide web conference (WWW'05). 22--32.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
iiWAS '09: Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
December 2009
763 pages
ISBN:9781605586601
DOI:10.1145/1806338
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • Johannes Kepler University

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 December 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. cold-start problem
  2. collaborative filtering
  3. explicit ratings
  4. item-based collaborative filtering
  5. memory-based approach
  6. recommender systems
  7. sparsity
  8. user-based collaborative filtering

Qualifiers

  • Short-paper

Conference

iiWAS '09
Sponsor:

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)0
Reflects downloads up to 06 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media