ACM Home Page
Please provide us with feedback. Feedback
Avoiding monotony: improving the diversity of recommendation lists
Full text PdfPdf (368 KB)
Source
ACM Conference On Recommender Systems archive
Proceedings of the 2008 ACM conference on Recommender systems table of contents
Lausanne, Switzerland
SESSION: Recommender challenges table of contents
Pages 123-130  
Year of Publication: 2008
ISBN:978-1-60558-093-7
Authors
Mi Zhang  University College Dublin, Dublin, Ireland and Fudan University, China
Neil Hurley  University College Dublin, Dublin, Ireland
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 31,   Downloads (12 Months): 376,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1454008.1454030
What is a DOI?

ABSTRACT

The primary premise upon which top-N recommender systems operate is that similar users are likely to have similar tastes with regard to their product choices. For this reason, recommender algorithms depend deeply on similarity metrics to build the recommendation lists for end-users.

However, it has been noted that the products offered on recommendation lists are often too similar to each other and attention has been paid towards the goal of improving diversity to avoid monotonous recommendations.

Noting that the retrieval of a set of items matching a user query is a common problem across many applications of information retrieval, we model the competing goals of maximizing the diversity of the retrieved list while maintaining adequate similarity to the user query as a binary optimization problem. We explore a solution strategy to this optimization problem by relaxing it to a trust-region problem.This leads to a parameterized eigenvalue problem whose solution is finally quantized to the required binary solution. We apply this approach to the top-N prediction problem, evaluate the system performance on the Movielens dataset and compare it with a standard item-based top-N algorithm. A new evaluation metric ItemNovelty is proposed in this work. Improvements on both diversity and accuracy are obtained compared to the benchmark algorithm.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
 
5
L. McGinty and B. Smyth. On the role of diversity in conversational recommender systems. In Workshop Proceedings of the Fifth International Conference on Case-Based Reasoning(ICCBR 2003), page 1065, 2003.
 
6
7
 
8
K. Nehring and C. Puppe. A theory of diversity. Econometrica, 70(3):1155--1198, May 2002.
 
9
C. Olsson, A. P. Eriksson, and F. Kahl. Solving large scale binary quadratic problems: Spectral methods vs. semidefinite programming. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition(CVPR '07), pages 1--8, 2007.
 
10
G. P. Patil and C. Taillie. Diversity as a concept and its measurement. Journal of the American Statistical Association, 77(379):548--561, Sep. 1982.
 
11
D. Reynolds. Comparison of background normalization methods for text-independent speaker verification. In Fifth European Conference on Speech Communication and Technology, 1997.
 
12
13
14
 
15
 
16
L. N. Vicente, J. J. Judice, and P. M. Pardalos. Parametric linear programming techniques for the indefinite quadratic programming problem. IMA Journal of Management Mathematics, 4(4):343--349, 1992.
17