Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2365952.2365992acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
abstract

Recommendation challenges in web media settings

Published: 09 September 2012 Publication History

Abstract

This paper calls out several research challenges in the art of recommendation technology as applied in Web media sites. One particular characteristic of such recommendation settings is the relative low cost of falsely recommending an irrelevant item, which means that recommendation schemes can be less conservative and more exploratory. This also creates opportunities for better item cold-start handling. Other technical difficulties include analyzing offline data that is heavily biased by the site's appearance, and in a related vein -- once a recommendation module's appearance has been designed -- defining the correct metrics by which to measure it. Also called out are tradeoffs between personalization and contextualization, as are novel schemes that aim at recommending sets and sequences of items.

References

[1]
D. Agarwal, B.-C. Chen, and P. Elango. Explore/exploit schemes for web content optimization. In Proc. Ninth IEEE International Conference on Data Mining (ICDM'2009), pages 1--10, 2009.
[2]
R. Agrawal, S. Gollapudi, A. Halverson, and S. Leong. Diversifying search results. In Proc. 2rd ACM Conference on Web Search and Data Mining (WSDM'2009), pages 5--14, February 2009.
[3]
M. Aharon, A. Kagian, Y. Koren, and R. Lempel. Dynamic personalized recommendation of comment-eliciting stories. In Proc. 6th ACM Conference on Recommender Systems (RecSys'2012), September 2012.
[4]
N. Aizenberg, Y. Koren, and O. Somekh. Build your own music recommender by modeling internet radio streams. In Proc. 21st International World Wide Web Conference (WWW'2012), pages 1--10, April 2012.
[5]
S. Chen, J. Moore, D. Turnbull, and T. Joachims. Playlist prediction via metric embedding. In Proc. 18th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'2012), August 2012.
[6]
N. Golbandi, Y. Koren, and R. Lempel. Adaptive bootstrapping of recommender systems using decision trees. In Proc. 4rd ACM Conference on Web Search and Data Mining (WSDM'2011), pages 595--604, February 2011.
[7]
T. Joachims. Optimizing search engines using clickthrough data. In Proc. 8th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'2002), pages 133--142, July 2002.
[8]
A. Karatzoglou, X. Amatriain, L. Baltrunas, and N. Oliver. Multiverse recommendation: N-dimensional tensor factorization for context-aware collaborative filtering. In Proc. 4th ACM Conference on Recommender Systems (RecSys'2010), September 2010.
[9]
Y. Koren, R. M. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, 42(8):30--37, 2009.
[10]
L. Li, W. Chu, J. Langford, and R. E. Schapire. A contextual-bandit approach to personalized news article recommendation. In Proc. 19th International World Wide Web Conference (WWW'2010), pages 781--792, April 2010.
[11]
S. Pandey, S. Roy, C. Olston, J. Cho, and S. Chakrabarti. Shuffling a stacked deck: The case for partially randomized ranking of search engine results. In Proc. 31st International Conference on Very Large Databases (VLDB'2005), pages 781--792, August 2005.

Cited By

View all
  • (2015)Alleviating the cold-start problem by incorporating movies facebook pagesCluster Computing10.1007/s10586-014-0355-218:1(187-197)Online publication date: 1-Mar-2015
  • (2014)Explore-exploit in top-N recommender systems via Gaussian processesProceedings of the 8th ACM Conference on Recommender systems10.1145/2645710.2645733(225-232)Online publication date: 6-Oct-2014

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
RecSys '12: Proceedings of the sixth ACM conference on Recommender systems
September 2012
376 pages
ISBN:9781450312707
DOI:10.1145/2365952
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 September 2012

Check for updates

Author Tags

  1. constrained recommendation
  2. contextualization
  3. exploration
  4. personalization
  5. presentation bias
  6. web media sites

Qualifiers

  • Abstract

Conference

RecSys '12
Sponsor:
RecSys '12: Sixth ACM Conference on Recommender Systems
September 9 - 13, 2012
Dublin, Ireland

Acceptance Rates

RecSys '12 Paper Acceptance Rate 24 of 119 submissions, 20%;
Overall Acceptance Rate 254 of 1,295 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 23 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2015)Alleviating the cold-start problem by incorporating movies facebook pagesCluster Computing10.1007/s10586-014-0355-218:1(187-197)Online publication date: 1-Mar-2015
  • (2014)Explore-exploit in top-N recommender systems via Gaussian processesProceedings of the 8th ACM Conference on Recommender systems10.1145/2645710.2645733(225-232)Online publication date: 6-Oct-2014

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media