Skip to main content

Offering Collaborative-Like Recommendations When Data Is Sparse: The Case of Attraction-Weighted Information Filtering

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3137))

Abstract

We propose a low-dimensional weighting scheme to map information filtering recommendations into more relevant, collaborative filtering-like recommendations. Similarly to content-based systems, the closest (most similar) items are recommended, but distances between items are weighted by attraction indexes representing existing customers’ preferences. Hence, the most preferred items are closer to all the other points in the space, and consequently more likely to be recommended. The approach is especially suitable when data is sparse, since attraction weights need only be computed across items, rather than for all user-item pairs. A first study conducted with consumers within an online bookseller context, indicates that our approach has merits: recommendations made by our attraction-weighted information filtering recommender system significantly outperform pure information filtering recommendations, and favorably compare to data-hungry collaborative filtering systems.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Resnick, P., Varian, H.R.: Recommender systems. Communications of the ACM 40(3), 56–58 (1997)

    Article  Google Scholar 

  2. Balabanovic, M., Shoham, Y.: Fab: Content-Based and Collaborative Recommendations. Communications of the ACM 40(3), 66–72 (1997)

    Article  Google Scholar 

  3. Basu, C., Hirsh, H., Cohen, W.: Recommendation as Classification: Combining Social and Content-Based Information in Recommendation. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence: AAAI (1998)

    Google Scholar 

  4. Good, N., Ben Schafer, J., Konstan, J.A., Borchers, A., Sarwar, B., Herlocker, J., Riedl, J.: Combining Collaborative Filtering with Personal Agents for Better Recommendations (1999)

    Google Scholar 

  5. Popescul, A., Ungar, L.H., Pennock, D.M., Lawrence, S.: Probabilistic Models for Unified Collaborative and Content-Based Recommendation in Sparse-Data Environments. In: Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  6. Claypool, M., Gokhale, A., Miranda, T., Murnikov, P., Netes, D., Sartin, M.: Combining Content-Based and Collaborative Filters in an Online Newspaper. In: Proceedings of ACM SIGIR Workshop on Recommender (1999)

    Google Scholar 

  7. Salton, G.: Developments in Automatic Text Retrieval. Science 253, 974–979 (1991)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Bruyn, A., Giles, C.L., Pennock, D.M. (2004). Offering Collaborative-Like Recommendations When Data Is Sparse: The Case of Attraction-Weighted Information Filtering. In: De Bra, P.M.E., Nejdl, W. (eds) Adaptive Hypermedia and Adaptive Web-Based Systems. AH 2004. Lecture Notes in Computer Science, vol 3137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27780-4_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27780-4_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22895-0

  • Online ISBN: 978-3-540-27780-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics