skip to main content
10.1145/3109859.3109897acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
research-article

Practical Lessons from Developing a Large-Scale Recommender System at Zalando

Published:27 August 2017Publication History

ABSTRACT

Developing a real-world recommender system, i.e. for use in large-scale online retail, poses a number of different challenges. Interestingly, only a small part of these challenges are of algorithmic nature, such as how to select the most accurate model for a given use case. Instead, most technical problems usually arise from operational constraints, such as: adaptation to novel use cases; cost and complexity of system maintenance; capability of reusing pre-existing signal and integrating heterogeneous data sources.

In this paper, we describe the system we developed in order to address those constraints at Zalando, which is one of the most popular online fashion retailers in Europe. In particular, we explain how moving from a collaborative filtering approach to a learning-to-rank model helped us to effectively tackle the challenges mentioned above, while improving at the same time the quality of our recommendations. A fairly detailed description of our software architecture is provided, along with an overview of the algorithmic approach. On the other hand, we present some of the offline and online experiments that we ran in order to validate our models.

References

  1. Fabio Aiolli. 2013. Efficient top-n recommendation for very large scale binary rated datasets. In Seventh ACM Conference on Recommender Systems, RecSys '13, Hong Kong, China, October 12-16, 2013, Qiang Yang, Irwin King, Qing Li, Pearl Pu, and George Karypis (Eds.). ACM, 273--280. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Christopher J. C. Burges, Robert Ragno, and Quoc Viet Le. 2006. Learning to Rank with Nonsmooth Cost Functions. In Advances in Neural Information Processing Systems (NIPS). 193--200. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Christopher J. C. Burges, Krysta Marie Svore, Paul N. Bennett, Andrzej Pastusiak, and Qiang Wu. 2011. Learning to Rank Using an Ensemble of Lambda-Gradient Models. In Proceedings of the Yahoo! Learning to Rank Challenge, held at ICML 2010, Haifa, Israel, June 25, 2010. 25--35. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, and Hang Li. 2007. Learning to rank: from pairwise approach to listwise approach. In Proceedings of the 24th International Conference on Machine learning (ICML 2007). ACM, New York, NY, USA, 129--136. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Paul Covington, Jay Adams, and Emre Sargin. 2016. Deep Neural Networks for YouTube Recommendations. In Proceedings of the 10th ACM Conference on Recommender Systems (RecSys '16). ACM, New York, NY, USA, 191--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Bruce Croft, Donald Metzler, and Trevor Strohman. 2009. Search Engines: Information Retrieval in Practice. Addison-Wesley, Boston (MA). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. John C. Duchi and Yoram Singer. 2009. Efficient Online and Batch Learning Using Forward Backward Splitting. Journal of Machine Learning Research 10 (2009), 2899--2934. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Roy Thomas Fielding. 2000. Architectural Styles and the Design of Network-based Software Architectures. Ph.D. Dissertation. University of California, Irvine.Google ScholarGoogle Scholar
  9. Antonino Freno, Martin Saveski, Rodolphe Jenatton, and Cédric Archambeau. 2015. One-Pass Ranking Models for Low-Latency Product Recommendations. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Sydney, NSW, Australia, August 10-13, 2015. ACM, 1789--1798. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Yoav Freund, Raj Iyer, Robert E. Schapire, and Yoram Singer. 2003. An Efficient Boosting Algorithm for Combining Preferences. Journal of Maching Learning Research 4 (2003), 933--969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Carlos A. Gomez-Uribe and Neil Hunt. 2016. The Netflix Recommender System: Algorithms, Business Value, and Innovation. ACM Trans. Management Inf. Syst. 6, 4 (2016), 13:1--13:19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ralf Herbrich, Thore Graepel, and Klaus Obermayer. 2000. Large Margin Rank Boundaries for Ordinal Regression. In Advances in Large Margin Classifiers, Smola, Bartlett, Schölkopf, and Schuurmans (Eds.). MIT Press, Chapter 7, 115-- 132.Google ScholarGoogle Scholar
  13. Thorsten Joachims. 2002. Optimizing Search Engines Using Clickthrough Data. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, USA, 133--142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Ron Kohavi, Roger Longbotham, Dan Sommerfield, and Randal M. Henne. 2009. Controlled experiments on the web: survey and practical guide. Data Mining and Knowledge Discovery 18, 1 (2009), 140--181. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. John Langford, Lihong Li, and Tong Zhang. 2009. Sparse Online Learning via Truncated Gradient. Journal of Machine Learning Research 10 (2009), 777--801. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Tie-Yan Liu. 2009. Learning to Rank for Information Retrieval. Foundations and Trends in Information Retrieval 3, 3 (2009), 225--331. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. H. Brendan McMahan, Gary Holt, D. Sculley, Michael Young, Dietmar Ebner, Julian Grady, Lan Nie, Todd Phillips, Eugene Davydov, Daniel Golovin, et al. 2013. Ad click prediction: a view from the trenches. In Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 2013). ACM, 1222--1230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Tomas Mikolov, Ilya Sutskever, Kai Chen, Gregory S. Corrado, and Jeffrey Dean. 2013. Distributed Representations of Words and Phrases and their Compositionality. In Advances in Neural Information Processing Systems (NIPS 2013), Christopher J. C. Burges, Léon Bottou, Zoubin Ghahramani, and Kilian Q. Weinberger (Eds.). 3111--3119. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Ananth Mohan, Zheng Chen, and Kilian Q. Weinberger. 2011. Web-Search Ranking with Initialized Gradient Boosted Regression Trees. In Yahoo! Learning to Rank Challenge. 77--89. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu. 2009. A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers. In Advances in Neural Information Processing Systems 22 (NIPS 2009), Y. Bengio, D. Schuurmans, J. D. Lafferty, C. K. I. Williams, and A. Culotta (Eds.). 1348--1356. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. D. Sculley. 2009. Large scale learning to rank. In NIPS Workshop on Advances in Ranking.Google ScholarGoogle Scholar
  22. Jason Weston, Samy Bengio, and Nicolas Usunier. 2011. WSABIE: Scaling Up to Large Vocabulary Image Annotation. In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011. 2764--2770. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Lin Xiao. 2010. Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization. Journal of Machine Learning Research 11 (2010), 2543--2596. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Jun Xu and Hang Li. 2007. AdaRank: A Boosting Algorithm for Information Retrieval. In SIGIR '07: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, New York, NY, USA, 391--398. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. H. Zou and T. Hastie. 2005. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society. Series B 67, 2 (2005), 301--320.Google ScholarGoogle Scholar

Index Terms

  1. Practical Lessons from Developing a Large-Scale Recommender System at Zalando

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            RecSys '17: Proceedings of the Eleventh ACM Conference on Recommender Systems
            August 2017
            466 pages
            ISBN:9781450346528
            DOI:10.1145/3109859

            Copyright © 2017 ACM

            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 the author(s) 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].

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 27 August 2017

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            RecSys '17 Paper Acceptance Rate26of125submissions,21%Overall Acceptance Rate254of1,295submissions,20%

            Upcoming Conference

            RecSys '24
            18th ACM Conference on Recommender Systems
            October 14 - 18, 2024
            Bari , Italy

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader