Skip to main content

A New Criteria for Selecting Neighborhood in Memory-Based Recommender Systems

  • Conference paper
Advances in Artificial Intelligence (CAEPIA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7023))

Included in the following conference series:

Abstract

In this paper a new proposal for memory-based Collaborative Filtering algorithms is presented. In order to compute its recommendations, a first step in memory-based methods is to find the neighborhood for the active user. Typically, this process is carried out by considering a vector-based similarity measure over the users’ ratings. This paper presents a new similarity criteria between users that could be used to both neighborhood selection and prediction processes. This criteria is based on the idea that if a user was good predicting the past ratings for the active user, then his/her predictions will be also valid in the future. Thus, instead of considering a vector-based measure between given ratings, this paper shows that it is possible to consider a distance between the real ratings (given by the active user in the past) and the ones predicted by a candidate neighbor. This distance measures the quality of each candidate neighbor at predicting the past ratings. The best-N predictors will be selected as the neighborhood.

This work has been jointly supported by the Spanish Ministerio de Ciencia e Innovación, under project TIN2008-06566-C04-01, and the Consejeria de Innovacion, Ciencia y Empresa de la Junta de Andalucia under project P09-TIC-4526.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge and Data Engineering 17(6), 734–749 (2005)

    Article  Google Scholar 

  2. Ahn, H.J.: A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem. Inf. Sci. 178(1), 37–51 (2008)

    Article  Google Scholar 

  3. Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering, pp. 43–52. Morgan Kaufmann (1998)

    Google Scholar 

  4. Deshpande, M., Karypis, G.: Item-based top-n recommendation algorithms. ACM Trans. Inf. Syst. 22(1), 143–177 (2004)

    Article  Google Scholar 

  5. Desrosiers, C., Karypis, G.: A comprehensive survey of neighborhood-based recommendation methods. In: Recommender Systems Handbook, pp. 107–144 (2011)

    Google Scholar 

  6. Goldberg, D., Nichols, D.A., Oki, B.M., Terry, D.B.: Using collaborative filtering to weave an information tapestry. Commun. ACM 35(12), 61–70 (1992)

    Article  Google Scholar 

  7. Herlocker, J., Konstan, J.A., Riedl, J.: An empirical analysis of design choices in neighborhood-based collaborative filtering algorithms. Inf. Retr. 5, 287–310 (2002)

    Article  Google Scholar 

  8. Herlocker, J.L., Konstan, J.A., Borchers, A., Riedl, J.: An algorithmic framework for performing collaborative filtering. In: SIGIR, pp. 230–237 (1999)

    Google Scholar 

  9. Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22, 5–53 (2004)

    Article  Google Scholar 

  10. Howe, A.E., Forbes, R.D.: Re-considering neighborhood-based collaborative filtering parameters in the context of new data. In: Proceeding of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, pp. 1481–1482. ACM, New York (2008)

    Google Scholar 

  11. Linden, G., Smith, B., York, J.: Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Computing 7(1), 76–80 (2003)

    Article  Google Scholar 

  12. Movielens: Data sets, http://www.grouplens.org/

  13. Resnick, P., Varian, H.R.: Recommender systems. Commun. ACM 40, 56–58 (1997)

    Article  Google Scholar 

  14. Sarwar, B., Karypis, G., Konstan, J., Reidl, J.: Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th International Conference on World Wide Web, WWW 2001, pp. 285–295. ACM, New York (2001)

    Google Scholar 

  15. Shardanand, U., Maes, P.: Social information filtering: Algorithms for automating ”word of mouth”, pp. 210–217. ACM Press (1995)

    Google Scholar 

  16. Wang, J., de Vries, A.P., Reinders, M.J.T.: Unified relevance models for rating prediction in collaborative filtering. ACM Trans. Inf. Syst. 26, 16:1–16:42 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cleger-Tamayo, S., Fernández-Luna, J.M., Huete, J.F. (2011). A New Criteria for Selecting Neighborhood in Memory-Based Recommender Systems. In: Lozano, J.A., Gámez, J.A., Moreno, J.A. (eds) Advances in Artificial Intelligence. CAEPIA 2011. Lecture Notes in Computer Science(), vol 7023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25274-7_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25274-7_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25273-0

  • Online ISBN: 978-3-642-25274-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics