Oren Sar Shalom
ABSTRACT
Most Collaborative Filtering (CF) algorithms are optimized using a dataset of isolated user-item tuples. However, in commercial applications recommended items are usually served as an ordered list of several items and not as isolated items. In this setting, inter-item interactions have an effect on the list's Click-Through Rate (CTR) that is unaccounted for using traditional CF approaches. Most CF approaches also ignore additional important factors like click propensity variation, item fatigue, etc. In this work, we introduce the list recommendation problem. We present useful insights gleaned from user behavior and consumption patterns from a large scale real world recommender system. We then propose a novel two-layered framework that builds upon existing CF algorithms to optimize a list's click probability. Our approach accounts for inter-item interactions as well as additional information such as item fatigue, trendiness patterns, contextual information etc. Finally, we evaluate our approach using a novel adaptation of Inverse Propensity Scoring (IPS) which facilitates off-policy estimation of our method's CTR and showcases its effectiveness in real-world settings.
- J. Bennett and S. Lanning. The Netflix Prize. In Proc. KDD Cup and Workshop, 2007.Google Scholar
- Haibin Cheng and Erick Cantú-Paz. Personalized click prediction in sponsored search. In Proceedings of the Third ACM International Conference on Web Search and Data Mining, WSDM '10, pages 351--360, 2010. Google ScholarDigital Library
- Paolo Cremonesi, Yehuda Koren, and Roberto Turrin. Performance of recommender algorithms on top-n recommendation tasks. In Proceedings of the 4th ACM Conference on Recommender Systems, pages 39--46, 2010. Google ScholarDigital Library
- Thomas G. Dietterich. Ensemble methods in machine learning. In Proceedings of the First International Workshop on Multiple Classifier Systems, MCS '00, pages 1--15, 2000. Google ScholarDigital Library
- Gideon Dror, Noam Koenigstein, and Yehuda Koren. Yahoo! music recommendations: Modeling music ratings with temporal dynamics and item taxonomy. In Proceedings of the 5th ACM Conference on Recommender Systems, 2011. Google ScholarDigital Library
- Gideon Dror, Noam Koenigstein, Yehuda Koren, and Markus Weimer. The Yahoo! music dataset and KDD-Cup'11. In Proceedings of KDDCup 2011, 2011.Google Scholar
- Jerome H Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, pages 1189--1232, 2001.Google ScholarCross Ref
- Thore Graepel, Joaquin Q Candela, Thomas Borchert, and Ralf Herbrich. Web-scale bayesian click-through rate prediction for sponsored search advertising in microsoft's bing search engine. In Proceedings of the 27th International Conference on Machine Learning (ICML-10), pages 13--20, 2010.Google ScholarDigital Library
- Y. F. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In IEEE International Conference on Data Mining, 2008. Google ScholarDigital Library
- Tamas Jambor and Jun Wang. Optimizing multiple objectives in collaborative filtering. In Proceedings of the Fourth ACM Conference on Recommender Systems, RecSys '10, pages 55--62, 2010. Google ScholarDigital Library
- Noam Koenigstein and Ulrich Paquet. Xbox movies recommendations: Variational Bayes matrix factorization with embedded feature selection. In Proceedings of the 7th ACM Conference on Recommender Systems, 2013. Google ScholarDigital Library
- Yehuda Koren. Collaborative filtering with temporal dynamics. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09, pages 447--456, 2009. Google ScholarDigital Library
- Neal Lathia, Stephen Hailes, Licia Capra, and Xavier Amatriain. Temporal diversity in recommender systems. In Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval, pages 210--217, 2010. Google ScholarDigital Library
- Lihong Li, Wei Chu, John Langford, and Robert E Schapire. A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th International Conference on World Wide Web, pages 661--670, 2010. Google ScholarDigital Library
- H. Brendan McMahan, Gary Holt, D. Sculley, Michael Young, Dietmar Ebner, Julian Grady, Lan Nie, Todd Phillips, Eugene Davydov, Daniel Golovin, Sharat Chikkerur, Dan Liu, Martin Wattenberg, Arnar Mar Hrafnkelsson, Tom Boulos, and Jeremy Kubica. Ad click prediction: A view from the trenches. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '13, pages 1222--1230, 2013. Google ScholarDigital Library
- J. A. Nelder and R. Mead. A simplex method for function minimization. The Computer Journal, 7(4), 1965. Google ScholarCross Ref
- Ulrich Paquet and Noam Koenigstein. One-class collaborative filtering with random graphs. In Proceedings of the 22nd International Conference on World Wide Web, WWW '13, pages 999--1008, 2013. Google ScholarDigital Library
- Filip Radlinski, Robert Kleinberg, and Thorsten Joachims. Learning diverse rankings with multi-armed bandits. In Proceedings of the International Conference on Machine Learning (ICML), 2008. Google ScholarDigital Library
- Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. BPR: Bayesian personalized ranking from implicit feedback. In UAI '09: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, 2009. Google ScholarDigital Library
- Mario Rodriguez, Christian Posse, and Ethan Zhang. Multiple objective optimization in recommender systems. In Proceedings of the Sixth ACM Conference on Recommender Systems, RecSys '12, 2012. Google ScholarDigital Library
- Andrew I. Schein, Alexandrin Popescul, Lyle H. Ungar, and David M. Pennock. Methods and metrics for cold-start recommendations. In Proceedings of the 25th ACM SIGIR International Conference on Research and Development in Information Retrieval, pages 253--260, 2002. Google ScholarDigital Library
- Benyah Shaparenko, Ozgur Cetin, and Rukmini Iyer. Data-driven text features for sponsored search click prediction. In Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising, ADKDD '09, pages 46--54, 2009. Google ScholarDigital Library
- Yue Shi, Alexandros Karatzoglou, Linas Baltrunas, Martha Larson, Nuria Oliver, and Alan Hanjalic. Climf: Learning to maximize reciprocal rank with collaborative less-is-more filtering. In Proceedings of the 6th ACM Conference on Recommender Systems, RecSys '12, pages 139--146, 2012. Google ScholarDigital Library
- Yue Shi, Martha Larson, and Alan Hanjalic. List-wise learning to rank with matrix factorization for collaborative filtering. In Proceedings of the 4th ACM Conference on Recommender Systems, pages 269--272, 2010. Google ScholarDigital Library
- Alexander L. Strehl, John Langford, Lihong Li, and Sham Kakade. Learning from logged implicit exploration data. In Advances in Neural Information Processing Systems 23, pages 2217--2225, 2010.Google Scholar
- Liang Tang, Yexi Jiang, Lei Li, and Tao Li. Ensemble contextual bandits for personalized recommendation. In Proceedings of the 8th ACM Conference on Recommender Systems, pages 73--80, 2014. Google ScholarDigital Library
- Liang Tang, Romer Rosales, Ajit Singh, and Deepak Agarwal. Automatic ad format selection via contextual bandits. In Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, pages 1587--1594, 2013. Google ScholarDigital Library
- Hastagiri P Vanchinathan, Isidor Nikolic, Fabio De Bona, and Andreas Krause. Explore-exploit in top-n recommender systems via gaussian processes. In Proceedings of the 8th ACM Conference on Recommender Systems, pages 225--232, 2014. Google ScholarDigital Library
- Jun Wang and Jianhan Zhu. Portfolio theory of information retrieval. In Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, pages 115--122. ACM, 2009. Google ScholarDigital Library
- Markus Weimer, Alexandros Karatzoglou, Quoc Viet Le, and Alexander J. Smola. Cofi rank - maximum margin matrix factorization for collaborative ranking. In Advances in Neural Information Processing Systems 20, pages 1593--1600, 2008.Google Scholar
- Liang Xiang, Quan Yuan, Shiwan Zhao, Li Chen, Xiatian Zhang, Qing Yang, and Jimeng Sun. Temporal recommendation on graphs via long-and short-term preference fusion. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 723--732, 2010. Google ScholarDigital Library
- Liang Xiong, Xi Chen, Tzu-Kuo Huang, Jeff G. Schneider, and Jaime G. Carbonell. Temporal collaborative filtering with bayesian probabilistic tensor factorization. In Proceedings of the SIAM International Conference on Data Mining, SDM 2010, pages 211--222, 2010. Google ScholarCross Ref
- Yuan Cao Zhang, Diarmuid Ó Séaghdha, Daniele Quercia, and Tamas Jambor. Auralist: Introducing serendipity into music recommendation. In Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, WSDM '12, pages 13--22, 2012. Google ScholarDigital Library
- T. Zhou, Z. Kuscsik, J.G. Liu, M. Medo, J.R. Wakeling, and Y.C. Zhang. Solving the apparent diversity-accuracy dilemma of recommender systems. Proceedings of the National Academy of Sciences (PNAS), 107(10):4511--4515, 2010. Google ScholarCross Ref
- Cai-Nicolas Ziegler, Sean M McNee, Joseph A Konstan, and Georg Lausen. Improving recommendation lists through topic diversification. In Proceedings of the 14th International Conference on World Wide Web, pages 22--32, 2005. Google ScholarDigital Library
Index Terms
- Beyond Collaborative Filtering: The List Recommendation Problem
Recommendations
Trust-based collaborative filtering: tackling the cold start problem using regular equivalence
RecSys '18: Proceedings of the 12th ACM Conference on Recommender SystemsUser-based Collaborative Filtering (CF) is one of the most popular approaches to create recommender systems. This approach is based on finding the most relevant k users from whose rating history we can extract items to recommend. CF, however, suffers ...
Typicality-Based Collaborative Filtering Recommendation
Collaborative filtering (CF) is an important and popular technology for recommender systems. However, current CF methods suffer from such problems as data sparsity, recommendation inaccuracy, and big-error in predictions. In this paper, we borrow ideas ...
Exploiting user interests for collaborative filtering: interests expansion via personalized ranking
CIKM '10: Proceedings of the 19th ACM international conference on Information and knowledge managementIn real applications, a given user buys or rates an item based on his/her interests. Learning to leverage this interest information is often critical for recommender systems. However, in existing recommender systems, the information about latent user ...
Comments