[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2020408.2020435acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Click shaping to optimize multiple objectives

Published: 21 August 2011 Publication History

Abstract

Recommending interesting content to engage users is important for web portals (e.g. AOL, MSN, Yahoo!, and many others). Existing approaches typically recommend articles to optimize for a single objective, i.e., number of clicks. However a click is only the starting point of a user's journey and subsequent downstream utilities such as time-spent and revenue are important. In this paper, we call the problem of recommending links to jointly optimize for clicks and post-click downstream utilities click shaping. We propose a multi-objective programming approach in which multiple objectives are modeled in a constrained optimization framework. Such a formulation can naturally incorporate various application-driven requirements. We study several variants that model different requirements as constraints and discuss some of the subtleties involved. We conduct our experiments on a large dataset from a real system by using a newly proposed unbiased evaluation methodology [17]. Through extensive experiments we quantify the tradeoff between different objectives under various constraints. Our experimental results show interesting characteristics of different formulations and our findings may provide valuable guidance to the design of recommendation engines for web portals.

References

[1]
D. Agarwal, B.-C. Chen, and P. Elango. Explore/exploit schemes for web content optimization. In Proceedings of the Ninth International Conference on Data Mining, 2009.
[2]
D. Agarwal, B.-C. Chen, and P. Elango. Spatio-temporal models for estimating click-through rate. In WWW, pages 21--30, 2009.
[3]
D. Agarwal, B.-C. Chen, P. Elango, and et al. Online models for content optimization. In NIPS, 2008.
[4]
P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235--256, 2002.
[5]
D. A. Berry and B. Fristedt. Bandit Problems: Sequential Allocation of Experiments. Monographs on Statistics and Applied Probability. Chapman and Hall, 1985.
[6]
G. Buscher, L. van Elst, and A. Dengel. Segment-level display time as implicit feedback: a comparison to eye tracking. In Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, pages 67--74, 2009.
[7]
W. Chu, S.-T. Park, T. Beaupre, N. Motgi, A. Phadke, S. Chakraborty, and J. Zachariah. A case study of behavior-driven conjoint analysis on yahoo!: front page today module. In KDD, pages 1097--1104, 2009.
[8]
A. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In Proceedings of the 16th international conference on World Wide Web, pages 271--280. ACM, 2007.
[9]
I. S. Dhillon, J. Fan, and Y. Guan. Efficient clustering of very large document collections. In V. K. R. Grossman, C. Kamath and R. Namburu, editors, Data Mining for Scientific and Engineering Applications. Kluwer Academic Publishers, 2001. Invited book chapter.
[10]
I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1):143--175, Jan 2001.
[11]
E. Vee, S. Vassilvitski, and J.Shanmugasundaran. Optimal online assignment with forecasts. In EC, 2010.
[12]
J. P. Ignizio. Goal programming and extensions. Lexington Books, 1976.
[13]
T. Jambor and J. Wang. Optimizing multiple objectives in collaborative filtering. In Proceedings of the fourth ACM conference on Recommender systems, pages 55--62, 2010.
[14]
J. Langford, A. Strehl, and J. Wortman. Exploration scavenging. In ICML, pages 528--535, 2008.
[15]
J. Langford and T. Zhang. The epoch-greedy algorithm for contextual multi-armed bandits. In Advances in Neural Information Processing Systems 20, 2008.
[16]
L. Li, W. Chu, J. Langford, and R. E. Schapire. A contextual-bandit approach to personalized news article recommendation. In Proceedings of the Nineteenth International Conference on World Wide Web, 2010.
[17]
L. Li, W. Chu, J. Langford, and X. Wang. Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms. In WSDM, 2011.
[18]
C. Liu, R. W. White, and S. T. Dumais. Understanding web browsing behaviors through weibull analysis of dwell time. In SIGIR, pages 379--386, 2010.
[19]
R. Fain and J. Pederson. Sponsored search: A brief history. Bulletin of American Society of Information and Technology, 32:12--13, 2006.
[20]
R. Steuer. Multi-criteria optimization: theory, computation, and application. Wiley, 1986.
[21]
S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
[22]
D. Sculley, R. G. Malkin, S. Basu, and R. J. Bayardo. Predicting bounce rates in sponsored search advertisements. In KDD, pages 1325--1334, 2009.
[23]
K. M. Svore, M. N. Volkovs, and C. J. C. Burges. Learning to rank with multiple objective functions. In WWW, 2011.
[24]
J. Vermorel and M. Mohri. Multi-armed bandit algorithms and empirical evaluation. In In European Conference on Machine Learning, pages 437--448. Springer, 2005.

Cited By

View all
  • (2024)The Power of Linear Programming in Sponsored Listings Ranking: Evidence from Field ExperimentsSSRN Electronic Journal10.2139/ssrn.4767661Online publication date: 2024
  • (2022)Multi-objective Optimization of Notifications Using Offline Reinforcement LearningProceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3534678.3539193(3752-3760)Online publication date: 14-Aug-2022
  • (2022)Long-term Dynamics of Fairness Intervention in Connection Recommender SystemsProceedings of the 2022 AAAI/ACM Conference on AI, Ethics, and Society10.1145/3514094.3534173(22-35)Online publication date: 26-Jul-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '11: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
August 2011
1446 pages
ISBN:9781450308137
DOI:10.1145/2020408
Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 August 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. click shaping
  2. constrained optimization
  3. multi-objective

Qualifiers

  • Research-article

Conference

KDD '11
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)27
  • Downloads (Last 6 weeks)3
Reflects downloads up to 12 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)The Power of Linear Programming in Sponsored Listings Ranking: Evidence from Field ExperimentsSSRN Electronic Journal10.2139/ssrn.4767661Online publication date: 2024
  • (2022)Multi-objective Optimization of Notifications Using Offline Reinforcement LearningProceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3534678.3539193(3752-3760)Online publication date: 14-Aug-2022
  • (2022)Long-term Dynamics of Fairness Intervention in Connection Recommender SystemsProceedings of the 2022 AAAI/ACM Conference on AI, Ethics, and Society10.1145/3514094.3534173(22-35)Online publication date: 26-Jul-2022
  • (2022)Offline Reinforcement Learning for Mobile NotificationsProceedings of the 31st ACM International Conference on Information & Knowledge Management10.1145/3511808.3557083(3614-3623)Online publication date: 17-Oct-2022
  • (2021)A Constrained Optimization Approach for Calibrated RecommendationsProceedings of the 15th ACM Conference on Recommender Systems10.1145/3460231.3478857(607-612)Online publication date: 13-Sep-2021
  • (2021)Towards Content Provider Aware Recommender SystemsProceedings of the Web Conference 202110.1145/3442381.3449889(3872-3883)Online publication date: 19-Apr-2021
  • (2020)ECLIPSEProceedings of the 37th International Conference on Machine Learning10.5555/3524938.3525004(704-714)Online publication date: 13-Jul-2020
  • (2020)Bandit based Optimization of Multiple Objectives on a Music Streaming PlatformProceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3394486.3403374(3224-3233)Online publication date: 23-Aug-2020
  • (2020)The NodeHopper: Enabling Low Latency Ranking with Constraints via a Fast Dual SolverProceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3394486.3403181(1285-1294)Online publication date: 23-Aug-2020
  • (2020)Edge formation in Social Networks to Nurture Content CreatorsProceedings of The Web Conference 202010.1145/3366423.3380267(1999-2008)Online publication date: 20-Apr-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media