about
When are recommender systems useful? (arxiv.org)
2 points by auferstehung on Mar 12, 2008 | hide | past | pdf | discuss on HN

In plain words: Two recommendation approaches were tested on rating datasets, keeping inactive users and time order to see when sophisticated prediction helps. When users' similarity scores cluster tightly, simple averages work nearly as well as advanced ones; recommenders gain most when tastes form without outside influence.

Abstract

Recommender systems are crucial tools to overcome the information overload brought about by the Internet. Rigorous tests are needed to establish to what extent sophisticated methods can improve the quality of the predictions. Here we analyse a refined correlation-based collaborative filtering algorithm and compare it with a novel spectral method for recommending. We test them on two databases that bear different statistical properties (MovieLens and Jester) without filtering out the less active users and ordering the opinions in time, whenever possible. We find that, when the distribution of user-user correlations is narrow, simple averages work nearly as well as advanced methods. Recommender systems can, on the other hand, exploit a great deal of additional information in systems where external influence is negligible and peoples' tastes emerge entirely. These findings are validated by simulations with artificially generated data.

Marcel Blattner, Alexander Hunziker, Paolo Laureti
arXiv:0709.2562 · cs.IR, cs.CY, cs.DL, cs.DS, physics.data-an, physics.soc-ph · submitted Sep 17, 2007
abstract · pdf · html

add comment on HN