Skip to main content

IRFCF: Iterative Rating Filling Collaborative Filtering Algorithm

  • Conference paper
Frontiers of WWW Research and Development - APWeb 2006 (APWeb 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3841))

Included in the following conference series:

Abstract

The aim of collaborative filtering is to make predictions for active user by utilizing the rating information of likeminded users in a historical database. But previous methods suffered from problems: sparsity, scalability, rating bias etc. To alleviate those problems, this paper presents a novel approach—Iterative Rating Filling Collaborative Filtering algorithm (IRFCF). Firstly, based on the idea of iterative reinforcement process, object-pair similarity is computed iteratively, and average rating and rating range are introduced to normalize ratings in order to alleviate rating bias problem. Then missing ratings are filled from user and item clusters through iterative clustering process to solve the sparsity and scalability problems. Finally, the nearest neighbors in the set of top clusters are selected to generate predictions for active user. Experimental results have shown that our proposed collaborative filtering approach can provide better performance than other collaborative filtering algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Breese, J.S., Heckerman, D., Kadie, C.: Empirical Analysis of Predictive Algorithms for Collaborative Filtering. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 43–52 (1998)

    Google Scholar 

  2. Sarwar, B.M., Karypis, G., Konstan, J.A., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th International World Wide Web Conference, Hong Kong (2001)

    Google Scholar 

  3. Wang, J.D., Zeng, H.J., Chen, Z., Lu, H.J., Tao, L., Ma, W.-Y.: ReCoM: reinforcement clustering of multi-type interrelated data objects. In: Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, July 2003, pp. 274–281 (2003)

    Google Scholar 

  4. Xue, G.R., Lin, C.X., Yang, Q., Xi, W.: Scalable Collaborative Filtering Using Cluster-based Smoothing. In: To appear in the Proceedings of the 2005 ACM SIGIR Conference, Brazil (August 2005)

    Google Scholar 

  5. Jeh, J., Widom, J.: SimRank: a measure of structural-context similarity. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, Edmonton, Alberta, Canada, July 23-26, pp. 538–543 (2002)

    Google Scholar 

  6. Jin, R., Si, L.: A Study of Methods for Normalizing User Ratings in Collaborative Filtering. In: The 27th Annual International ACM SIGIR Conference, Sheffield, UK, July 25-29 (2004)

    Google Scholar 

  7. MovieRating, http://www.cs.usyd.edu.au/~irena/movie_data.zip

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shen, J., Lin, Y., Xue, GR., Zhu, FD., Yao, AG. (2006). IRFCF: Iterative Rating Filling Collaborative Filtering Algorithm. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds) Frontiers of WWW Research and Development - APWeb 2006. APWeb 2006. Lecture Notes in Computer Science, vol 3841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610113_86

Download citation

  • DOI: https://doi.org/10.1007/11610113_86

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31142-3

  • Online ISBN: 978-3-540-32437-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics