|
Understanding Similarity Metrics in Neighbour-based Recommender Systems| old_uid | 12858 |
|---|
| title | Understanding Similarity Metrics in Neighbour-based Recommender Systems |
|---|
| start_date | 2013/10/10 |
|---|
| schedule | 15h45-16h30 |
|---|
| online | no |
|---|
| location_info | bat. 105, salle 26:00-105 |
|---|
| summary | Recommender systems aim to predict the content that a user would like based on observations of the online behaviour of its users. Research in the CWI Information Access group addresses different aspects of this problem, varying from how to measure recommendation results, how recommender systems relate to information retrieval models, and how to build effective recommender systems (note: we won the ACM RecSys 2013 News Recommender Systems challenge!). We would like to develop a general methodology to diagnose weaknesses and strengths of recommender systems. In this talk, I discuss the initial results of an analysis of the core component of collaborative filtering recommenders: the similarity metric used to find the most similar users (neighbours) that will provide the basis for the recommendation to be made. The purpose is to shed light on the question why certain user similarity metrics have been found to perform better than others. We have studied statistics computed over the distance distribution in the neighbourhood as well as properties of the nearest neighbour graph. The features identified correlate strongly with measured prediction performance - however, we have not yet discovered how to deploy this knowledge to actually improve recommendations made. |
|---|
| responsibles | Piwowarski |
|---|
| |
|