Offering collaborative-like recommendations when data is sparse: The case of attraction-weighted information filtering

Arnaud De Bruyn, C. Lee Giles, David M. Pennock

Research output: Contribution to journalArticle

5 Scopus citations

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 book-seller 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.

Original languageEnglish (US)
Pages (from-to)393-396
Number of pages4
JournalLecture Notes in Computer Science
Volume3137
StatePublished - 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Offering collaborative-like recommendations when data is sparse: The case of attraction-weighted information filtering'. Together they form a unique fingerprint.

  • Cite this