2014 ModelingImpressionDiscountingin

From GM-RKB
Jump to: navigation, search

Subject Headings: Multi-Session Item Recommendation.

Notes

Cited By

2016

  • https://buildingrecommenders.wordpress.com/2016/04/06/impression-discounting/
    • QUOTE: ... Impression discounting relies on learning a model for users based on their historical engagement (i.e. impressions) with recommendations over a certain period of time. You can think of it as a re-ranking plugin for a recommender, where it’s implemented either in the Recommendation Post-Processing or Online Modules components, or even in both. The model, when applied to a list of recommendations for a user will then penalize (i.e. discount) items that have not been engaged with and change the ordering of the items in the list. Items that have previously been impressed but not interacted with will be pushed down the list, allowing other items to bubble up. The hard part of this process is training the model so that it discounts items by the correct amount, neither being too harsh or lenient. ...

Quotes

Author Keywords

Abstract

Recommender systems have become very important for many online activities, such as watching movies, shopping for products, and connecting with friends on social networks. User behavioral analysis and user feedback (both explicit and implicit) modeling are crucial for the improvement of any online recommender system. Widely adopted recommender systems at LinkedIn such as “People You May Know " and " Endorsements " are evolving by analyzing user behaviors on impressed recommendation items.

In this paper, we address modeling impression discounting of recommended items, that is, how to model user's no-action feedback on impressed recommended items. The main contributions of this paper include (1) large-scale analysis of impression data from LinkedIn and KDD Cup; (2) novel anti-noise regression techniques, and its application to learn four different impression discounting functions including linear decay, inverse decay, exponential decay, and quadratic decay; (3) applying these impression discounting functions to LinkedIn's “People You May Know " and " Endorsementsrecommender systems.

References

  • 1. Deepak Agarwal, Bee-Chung Chen, Pradheep Elango, Spatio-temporal Models for Estimating Click-through Rate, Proceedings of the 18th International Conference on World Wide Web, April 20-24, 2009, Madrid, Spain doi:10.1145/1526709.1526713
  • 2. Eugene Agichtein, Eric Brill, Susan Dumais, Improving Web Search Ranking by Incorporating User Behavior Information, Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, August 06-11, 2006, Seattle, Washington, USA doi:10.1145/1148170.1148177
  • 3. Christopher M. Bishop, Pattern Recognition and Machine Learning (Information Science and Statistics), Springer-Verlag New York, Inc., Secaucus, NJ, 2006
  • 4. Wenlin Chen, Yixin Chen, Yi Mao, Baolong Guo, Density-based Logistic Regression, Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 11-14, 2013, Chicago, Illinois, USA doi:10.1145/2487575.2487583
  • 5. B. Dalessandro, R. Hook, and C. Perlich. Evaluating and Optimizing Online Advertising: Forget the Click, But There Are Good Proxies. In: Proceedings of Empirical Generalizations in Advertising Conference, 2012.
  • 6. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In KDD, Pages 226--231, 1996.
  • 7. Neha Gupta, Abhimanyu Das, Sandeep Pandey, Vijay K. Narayanan, Factoring Past Exposure in Display Advertising Targeting, Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 12-16, 2012, Beijing, China doi:10.1145/2339530.2339719
  • 8. Yifan Hu, Yehuda Koren, Chris Volinsky, Collaborative Filtering for Implicit Feedback Datasets, Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, p.263-272, December 15-19, 2008 doi:10.1109/ICDM.2008.22
  • 9. Yehuda Koren, Factorization Meets the Neighborhood: A Multifaceted Collaborative Filtering Model, Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 24-27, 2008, Las Vegas, Nevada, USA doi:10.1145/1401890.1401944
  • 10. Yehuda Koren, Factor in the Neighbors: Scalable and Accurate Collaborative Filtering, ACM Transactions on Knowledge Discovery from Data (TKDD), v.4 n.1, p.1-24, January 2010 doi:10.1145/1644873.1644874
  • 11. S. Kpotufe and V. K. Garg. Adaptivity to Local Smoothness and Dimension in Kernel Regression. In NIPS, Pages 3075--3083, 2013.
  • 12. Pei Lee, Laks V.S. Lakshmanan, Evangelos Milios, KeySee: Supporting Keyword Search on Evolving Events in Social Streams, Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 11-14, 2013, Chicago, Illinois, USA doi:10.1145/2487575.2487711
  • 13. P. Lee, L. V. S. Lakshmanan, and E. E. Milios. Incremental Cluster Evolution Tracking from Highly Dynamic Network Data. In ICDE, Pages 3--14, 2014.
  • 14. X. Lin and D. Zhang. Inference in Generalized Additive Mixed Models by Using Smoothing Splines. Journal of the Royal Statistical Society, Series B, 61(2):381--400, 1999.
  • 15. Omar Moling, Linas Baltrunas, Francesco Ricci, Optimal Radio Channel Recommendations with Explicit and Implicit Feedback, Proceedings of the Sixth ACM Conference on Recommender Systems, September 09-13, 2012, Dublin, Ireland doi:10.1145/2365952.2365971
  • 16. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab, 1999.
  • 17. C. Perlich. Machine Learning Challenges in Targeted Advertising: Transfer Learning in Action. 2013.
  • 18. Matthew Richardson, Ewa Dominowska, Robert Ragno, Predicting Clicks: Estimating the Click-through Rate for New Ads, Proceedings of the 16th International Conference on World Wide Web, May 08-12, 2007, Banff, Alberta, Canada doi:10.1145/1242572.1242643
  • 19. G. Ristanoski, W. Liu, and J. Bailey. Time Series Forecasting Using Distribution Enhanced Linear Regression. In PAKDD (1), Pages 484--495, 2013.
  • 20. D. Ruppert and M. P. Wand. Multivariate Locally Weighted Least Squares Regression. Annals of Statistics, 22:1347--1370, 1994.
  • 21. Badrul Sarwar, George Karypis, Joseph Konstan, John Riedl, Item-based Collaborative Filtering Recommendation Algorithms, Proceedings of the 10th International Conference on World Wide Web, p.285-295, May 01-05, 2001, Hong Kong, Hong Kong doi:10.1145/371920.372071
  • 22. G. P. Styan. Hadamard Products and Multivariate Statistical Analysis. Linear Algebra and Its Applications, 6:217--240, 1973.
  • 23. Roshan Sumbaly, Jay Kreps, Sam Shah, The Big Data Ecosystem at LinkedIn, Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, June 22-27, 2013, New York, New York, USA doi:10.1145/2463676.2463707
  • 24. Diyi Yang, Tianqi Chen, Weinan Zhang, Qiuxia Lu, Yong Yu, Local Implicit Feedback Mining for Music Recommendation, Proceedings of the Sixth ACM Conference on Recommender Systems, September 09-13, 2012, Dublin, Ireland doi:10.1145/2365952.2365973
  • 25. Shuang-Hong Yang, Bo Long, Alexander J. Smola, Hongyuan Zha, Zhaohui Zheng, Collaborative Competitive Filtering: Learning Recommender Using Context of User Choice, Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, July 24-28, 2011, Beijing, China doi:10.1145/2009916.2009959
  • 26. Jiyong Zhang, Pearl Pu, A Recursive Prediction Algorithm for Collaborative Filtering Recommender Systems, Proceedings of the 2007 ACM Conference on Recommender Systems, October 19-20, 2007, Minneapolis, MN, USA doi:10.1145/1297231.1297241;


 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2014 ModelingImpressionDiscountinginPei Lee
Laks V.S. Lakshmanan
Mitul Tiwari
Sam Shah
Modeling Impression Discounting in Large-scale Recommender Systems10.1145/2623330.26233562014