ACM Home Page
Please provide us with feedback. Feedback
Getting recommender systems to think outside the box
Full text PdfPdf (398 KB)
Source
ACM Conference On Recommender Systems archive
Proceedings of the third ACM conference on Recommender systems table of contents
New York, New York, USA
SESSION: Short papers table of contents
Pages 285-288  
Year of Publication: 2009
ISBN:978-1-60558-435-5
Authors
Zeinab Abbassi  University of British Columbia, Vancouver, BC, Canada
Sihem Amer-Yahia  Yahoo! Research, New York, NY, USA
Laks V.S. Lakshmanan  University of British Columbia, Vancouver, BC, Canada
Sergei Vassilvitskii  Yahoo! Research, New York, NY, USA
Cong Yu  Yahoo! Research, New York, NY, USA
Sponsor
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 17,   Citation Count: 0
Additional Information:

abstract   references   index terms  

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/1639714.1639769
What is a DOI?

ABSTRACT

We examine the case of over-specialization in recommender systems, which results from returning items that are too similar to those previously rated by the user. We propose Outside-The-Box (otb) recommendation, which takes some risk to help users make fresh discoveries, while maintaining high relevance. The proposed formalization relies on item regions and attempts to identify regions that are under-exposed to the user. We develop a recommendation algorithm which achieves a compromise between relevance and risk to find otb items. We evaluate this approach on the MovieLens data set and compare our otb recommendations against conventional recommendation strategies.


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
G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng., 17(6), 2005.
 
2
R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, 1994.
 
3
S. Amer-Yahia, L. Lakshmanan, and C. Yu. Socialscope: Enabling information discovery on social content sites. In CIDR, 2009.
 
4
D. Arthur and S. Vassilvitskii. K-Means++: the advantages of careful seeding. In SODA, 2007.
 
5
D. Billsus and M. Pazzani. User modeling for adaptive news access. In User Modeling and User-Adapted Interaction. 10:2/3. 147--180, 2000.
 
6
R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
 
7
GroupLens at University of Minnesota. http://www.grouplens.org/node/73.
 
8
K. Jarvelin and K. Kekalainen. Cumulated gain-based evaluation of ir techniques. ACM TOIS, 20(4), 2002.
 
9
J. A. Konstan. Introduction to recommender systems. In SIGIR, 2007.
 
10
S. McNee, J. Riedl, and J. A. Konstan. Being accurate is not enough: How accuracy metrics have hurt recommender systems. In CHI, 2006.
 
11
S. A. Munson, D. X. Zhou, and P. Resnick. Sidelines: An algorithm for increasing diversity in news and opinion aggregators. In AAAI, 2009.
 
12
C.-N. Ziegler, S. M. McNee, J. A. Konstan, and G. Lausen. Improving recommendation lists through topic diversification. In WWW, 2005.