Pradheep Elango
Yahoo!
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Pradheep Elango.
international world wide web conferences | 2009
Deepak Agarwal; Bee-Chung Chen; Pradheep Elango
We propose novel spatio-temporal models to estimate click-through rates in the context of content recommendation. We track article CTR at a fixed location over time through a dynamic Gamma-Poisson model and combine information from correlated locations through dynamic linear regressions, significantly improving on per-location model. Our models adjust for user fatigue through an exponential tilt to the first-view CTR (probability of click on first article exposure) that is based only on user-specific repeat-exposure features. We illustrate our approach on data obtained from a module (Today Module) published regularly on Yahoo! Front Page and demonstrate significant improvement over commonly used baseline methods. Large scale simulation experiments to study the performance of our models under different scenarios provide encouraging results. Throughout, all modeling assumptions are validated via rigorous exploratory data analysis.
knowledge discovery and data mining | 2011
Deepak Agarwal; Bee-Chung Chen; Pradheep Elango; Xuanhui Wang
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 users 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.
neural information processing systems | 2008
Deepak Agarwal; Bee-Chung Chen; Pradheep Elango; Nitin Motgi; Seung-Taek Park; Raghu Ramakrishnan; Scott Roy; Joe Zachariah
international conference on data mining | 2009
Deepak Agarwal; Bee-Chung Chen; Pradheep Elango
WORLDS'05 Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2 | 2005
Sriya Santhanam; Pradheep Elango; Andrea C. Arpaci-Dusseau; Miron Livny
knowledge discovery and data mining | 2010
Deepak Agarwal; Bee-Chung Chen; Pradheep Elango
Archive | 2007
Deepak Agarwal; Bee-Chung Chen; Pradheep Elango; Nitin Motgi; Vijay K. Narayanan; Raghu Ramakrishnan; Howard Scott Roy; Amitabh Seth; Vik Singh; Joe Zachariah; Sharat Israni; John Thrall; Chandar Venkataraman; Amit Phadke; Michael Salisbury
Archive | 2008
Deepak Agarwal; Pradheep Elango; Raghu Ramakrishnan; Seung-Taek Park; Bee-Chung Chen
Archive | 2010
Scott Roy; Belle L. Tseng; Pradheep Elango; Bee-Chung Chen; Jayavel Shanmugasundaram; Raghu Ramakrishnan; Andrei Z. Broder; Deepak Agarwal; Todd Beaupre; Nitin Motgi; John Tomlin
Archive | 2012
H. Scott Roy; Raghunath Ramakrishnan; Pradheep Elango; Nitin Motgi; Deepak Agarwal; Wei Chu; Bee-Chung Chen