skip to main content
10.1145/3523227.3546779acmotherconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
research-article
Open Access

Solving Diversity-Aware Maximum Inner Product Search Efficiently and Effectively

Published:13 September 2022Publication History

ABSTRACT

Maximum inner product search (or k-MIPS) is a fundamental operation in recommender systems that infer preferable items for users. To support large-scale recommender systems, existing studies designed scalable k-MIPS algorithms. However, these studies do not consider diversity, although recommending diverse items is important to improve user satisfaction. We therefore formulate a new problem, namely diversity-aware k-MIPS. In this problem, users can control the degree of diversity in their recommendation lists through a parameter. However, exactly solving this problem is unfortunately NP-hard, so it is challenging to devise an efficient, effective, and practical algorithm for the diversity-aware k-MIPS problem. This paper overcomes this challenge and proposes IP-Greedy, which incorporates new early termination and skipping techniques into a greedy algorithm. We conduct extensive experiments on real datasets, and the results demonstrate the efficiency and effectiveness of our algorithm. Also, we conduct a case study of the diversity-aware k-MIPS problem on a real dataset. We confirm that this problem can make recommendation lists diverse while preserving high inner products of user and item vectors in the lists.

Skip Supplemental Material Section

Supplemental Material

video.mp4

mp4

177.2 MB

References

  1. Mustafa Abdool, Malay Haldar, Prashant Ramanathan, Tyler Sax, Lanbo Zhang, Aamir Manaswala, Lynn Yang, Bradley Turnbull, Qing Zhang, and Thomas Legrand. 2020. Managing Diversity in Airbnb Search. In KDD. 2952–2960.Google ScholarGoogle Scholar
  2. Daichi Amagata and Takahiro Hara. 2016. Diversified set monitoring over distributed data streams. In DEBS. 1–12.Google ScholarGoogle Scholar
  3. Daichi Amagata and Takahiro Hara. 2021. Reverse Maximum Inner Product Search: How to efficiently find users who would like to buy my item?. In RecSys. 273–281.Google ScholarGoogle Scholar
  4. Ashton Anderson, Lucas Maystre, Ian Anderson, Rishabh Mehrotra, and Mounia Lalmas. 2020. Algorithmic Effects on the Diversity of Consumption on Spotify. In The Web Conference. 2155–2165.Google ScholarGoogle Scholar
  5. Vito Walter Anelli, Alejandro Bellogín, Tommaso Di Noia, and Claudio Pomo. 2021. Reenvisioning the Comparison between Neural Collaborative Filtering and Matrix Factorization. In RecSys. 521–529.Google ScholarGoogle Scholar
  6. Yoram Bachrach, Yehuda Finkelstein, Ran Gilad-Bachrach, Liran Katzir, Noam Koenigstein, Nir Nice, and Ulrich Paquet. 2014. Speeding up the xbox recommender system using a euclidean transformation for inner-product spaces. In RecSys. 257–264.Google ScholarGoogle Scholar
  7. Oren Barkan and Noam Koenigstein. 2016. Item2vec: Neural Item Embedding for Collaborative Filtering. In International Workshop on Machine Learning for Signal Processing. 1–6.Google ScholarGoogle ScholarCross RefCross Ref
  8. Jaime Carbonell and Jade Goldstein. 1998. The use of MMR, diversity-based reranking for reordering documents and producing summaries. In SIGIR. 335–336.Google ScholarGoogle Scholar
  9. Ilio Catallo, Eleonora Ciceri, Piero Fraternali, Davide Martinenghi, and Marco Tagliasacchi. 2013. Top-k Diversity Queries over Bounded Regions. ACM Transactions on Database Systems 38, 2 (2013), 1–44.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Laming Chen, Guoxin Zhang, and Eric Zhou. 2018. Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity. NeurIPS 31(2018).Google ScholarGoogle Scholar
  11. Peizhe Cheng, Shuaiqiang Wang, Jun Ma, Jiankai Sun, and Hui Xiong. 2017. Learning to Recommend Accurate and Diverse Items. In World Wide Web. 183–192.Google ScholarGoogle Scholar
  12. Wei-Sheng Chin, Bo-Wen Yuan, Meng-Yuan Yang, Yong Zhuang, Yu-Chin Juan, and Chih-Jen Lin. 2016. LIBMF: A Library for Parallel Matrix Factorization in Shared-memory Systems. The Journal of Machine Learning Research 17, 1 (2016), 2971–2975.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Xinyan Dai, Xiao Yan, Kelvin KW Ng, Jiu Liu, and James Cheng. 2020. Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search. In AAAI. 51–58.Google ScholarGoogle Scholar
  14. Qin Ding, Hsiang-Fu Yu, and Cho-Jui Hsieh. 2019. A Fast Sampling Algorithm for Maximum Inner Product Search. In AISTATS. 3004–3012.Google ScholarGoogle Scholar
  15. Marina Drosou and Evaggelia Pitoura. 2010. Search Result Diversification. ACM SIGMOD Record 39, 1 (2010), 41–47.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Marina Drosou and Evaggelia Pitoura. 2015. Multiple Radii Disc Diversity: Result Diversification Based on Dissimilarity and Coverage. ACM Transactions on Database Systems 40, 1 (2015), 1–43.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Steven Essinger, Dave Huber, and Daniel Tang. 2021. AIR: Personalized Product Recommender System for Nike’s Digital Transformation. In RecSys. 530–532.Google ScholarGoogle Scholar
  18. Piero Fraternali, Davide Martinenghi, and Marco Tagliasacchi. 2012. Top-k Bounded Diversification. In SIGMOD. 421–432.Google ScholarGoogle Scholar
  19. Xiaoyu Ge and Panos K Chrysanthis. 2020. Efficient PrefDiv Algorithms for Effective Top-k Result Diversification.. In EDBT. 335–346.Google ScholarGoogle Scholar
  20. Sreenivas Gollapudi and Aneesh Sharma. 2009. An Axiomatic Approach for Result Diversification. In World Wide Web. 381–390.Google ScholarGoogle Scholar
  21. Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, and Sanjiv Kumar. 2020. Accelerating Large-scale Inference with Anisotropic Vector Quantization. In ICML. 3887–3896.Google ScholarGoogle Scholar
  22. Ruining He and Julian McAuley. 2016. Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-class Collaborative Filtering. In World Wide Web. 507–517.Google ScholarGoogle Scholar
  23. Zhengbao Jiang, Ji-Rong Wen, Zhicheng Dou, Wayne Xin Zhao, Jian-Yun Nie, and Ming Yue. 2017. Learning to Diversify Search Results via Subtopic Attention. In SIGIR. 545–554.Google ScholarGoogle Scholar
  24. Marius Kaminskas and Derek Bridge. 2016. Diversity, Serendipity, Novelty, and Coverage: A Survey and Empirical Analysis of Beyond-accuracy Objectives in Recommender Systems. ACM Transactions on Interactive Intelligent Systems 7, 1 (2016), 1–42.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Mozhgan Karimi, Dietmar Jannach, and Michael Jugovac. 2018. News Recommender Systems–Survey and Roads Ahead. Information Processing & Management 54, 6 (2018), 1203–1227.Google ScholarGoogle ScholarCross RefCross Ref
  26. Daniel James Kershaw, Rob Koeling, Stephan Bourgeois, Antonio Trenta, and Harriet J Muncey. 2021. Fairness in Reviewer Recommendations at Elsevier. In RecSys. 554–555.Google ScholarGoogle Scholar
  27. Vijay Keswani and L Elisa Celis. 2021. Dialect Diversity in Text Summarization on Twitter. In The Web Conference. 3802–3814.Google ScholarGoogle Scholar
  28. Matevž Kunaver and Tomaž Požrl. 2017. Diversity in Recommender Systems–A Survey. Knowledge-based systems 123 (2017), 154–162.Google ScholarGoogle Scholar
  29. Sudarshan Dnyaneshwar Lamkhede and Christoph Kofler. 2021. Recommendations and Results Organization in Netflix Search. In RecSys. 577–579.Google ScholarGoogle Scholar
  30. Chang Li, Haoyun Feng, and Maarten de Rijke. 2020. Cascading Hybrid Bandits: Online Learning to Rank for Relevance and Diversity. In RecSys. 33–42.Google ScholarGoogle Scholar
  31. Hui Li, Tsz Nam Chan, Man Lung Yiu, and Nikos Mamoulis. 2017. FEXIPRO: fast and exact inner product retrieval in recommender systems. In SIGMOD. 835–850.Google ScholarGoogle Scholar
  32. Yile Liang, Tieyun Qian, Qing Li, and Hongzhi Yin. 2021. Enhancing Domain-Level and User-Level Adaptivity in Diversified Recommendation. In SIGIR. 747–756.Google ScholarGoogle Scholar
  33. Jie Liu, Xiao Yan, Xinyan Dai, Zhirong Li, James Cheng, and Ming-Chang Yang. 2020. Understanding and Improving Proximity Graph Based Maximum Inner Product Search. In AAAI. 139–146.Google ScholarGoogle Scholar
  34. Hayato Nakama, Daichi Amagata, and Takahiro Hara. 2021. Approximate Top-k Inner Product Join with a Proximity Graph. In IEEE Big Data. 4468–4471.Google ScholarGoogle Scholar
  35. Lu Qin, Jeffrey Xu Yu, and Lijun Chang. 2012. Diversifying Top-k Results. PVLDB 5, 11 (2012), 1124–1135.Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Parikshit Ram and Alexander G Gray. 2012. Maximum inner-product search using cone trees. In KDD. 931–939.Google ScholarGoogle Scholar
  37. Sekharipuram S Ravi, Daniel J Rosenkrantz, and Giri Kumar Tayi. 1994. Heuristic and special case algorithms for dispersion problems. Operations Research 42, 2 (1994), 299–310.Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Steffen Rendle, Walid Krichene, Li Zhang, and John Anderson. 2020. Neural Collaborative Filtering vs. Matrix Factorization Revisited. In RecSys. 240–248.Google ScholarGoogle Scholar
  39. Yang Song, Yu Gu, Rui Zhang, and Ge Yu. 2021. ProMIPS: Efficient High-Dimensional c-Approximate Maximum Inner Product Search with a Lightweight Index. In ICDE. 1619–1630.Google ScholarGoogle Scholar
  40. Harald Steck, Linas Baltrunas, Ehtsham Elahi, Dawen Liang, Yves Raimond, and Justin Basilico. 2021. Deep Learning for Recommender Systems: A Netflix Case Study. AI Magazine 42, 3 (2021), 7–18.Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Zhan Su, Zhicheng Dou, Yutao Zhu, Xubo Qin, and Ji-Rong Wen. 2021. Modeling Intent Graph for Search Result Diversification. In SIGIR. 736–746.Google ScholarGoogle Scholar
  42. Shulong Tan, Zhaozhuo Xu, Weijie Zhao, Hongliang Fei, Zhixin Zhou, and Ping Li. 2021. Norm Adjusted Proximity Graph for Fast Inner Product Retrieval. In KDD. 1552–1560.Google ScholarGoogle Scholar
  43. Christina Teflioudi and Rainer Gemulla. 2016. Exact and Approximate Maximum Inner Product Search with LEMP. ACM Transactions on Database Systems 42, 1 (2016), 1–49.Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Christina Teflioudi, Rainer Gemulla, and Olga Mykytiuk. 2015. LEMP: Fast Retrieval of Large Entries in a Matrix Product. In SIGMOD. 107–122.Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Duong Chi Thang, Nguyen Thanh Tam, Nguyen Quoc Viet Hung, and Karl Aberer. 2015. An Evaluation of Diversification Techniques. In DEXA. 215–231.Google ScholarGoogle Scholar
  46. Hanxin Wang, Daichi Amagata, Takuya Makeawa, Takahiro Hara, Niu Hao, Kei Yonekawa, and Mori Kurokawa. 2020. A DNN-Based Cross-Domain Recommender System for Alleviating Cold-Start Problem in E-Commerce. IEEE Open Journal of the Industrial Electronics Society 1 (2020), 194–206.Google ScholarGoogle ScholarCross RefCross Ref
  47. Jing Wang, Feng Tian, Hongchuan Yu, Chang Hong Liu, Kun Zhan, and Xiao Wang. 2017. Diverse Non-negative Matrix Factorization for Multiview Data Representation. IEEE Transactions on Cybernetics 48, 9 (2017), 2620–2632.Google ScholarGoogle ScholarCross RefCross Ref
  48. Long Xia, Jun Xu, Yanyan Lan, Jiafeng Guo, and Xueqi Cheng. 2015. Learning Maximal Marginal Relevance Model via Directly Optimizing Diversity Evaluation Measures. In SIGIR. 113–122.Google ScholarGoogle Scholar
  49. Le Yan, Zhen Qin, Rama Kumar Pasumarthi, Xuanhui Wang, and Michael Bendersky. 2021. Diversification-Aware Learning to Rank using Distributed Representation. In The Web Conference. 127–136.Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Rui Ye, Yuqing Hou, Te Lei, Yunxing Zhang, Qing Zhang, Jiale Guo, Huaiwen Wu, and Hengliang Luo. 2021. Dynamic Graph Construction for Improving Diversity of Recommendation. In RecSys. 651–655.Google ScholarGoogle Scholar
  51. Hamed Zamani and W Bruce Croft. 2020. Learning a Joint Search and Recommendation Model from User-Item Interactions. In WSDM. 717–725.Google ScholarGoogle Scholar
  52. Guangyi Zhang and Aristides Gionis. 2020. Maximizing Diversity over Clustered Data. In SDM. 649–657.Google ScholarGoogle Scholar
  53. Xing Zhao, Ziwei Zhu, Yin Zhang, and James Caverlee. 2020. Improving the Estimation of Tail Ratings in Recommender System with Multi-Latent Representations. In WSDM. 762–770.Google ScholarGoogle Scholar
  54. Yadong Zhu, Yanyan Lan, Jiafeng Guo, Xueqi Cheng, and Shuzi Niu. 2014. Learning for search result diversification. In SIGIR. 293–302.Google ScholarGoogle Scholar

Index Terms

  1. Solving Diversity-Aware Maximum Inner Product Search Efficiently and Effectively

        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 Other conferences
          RecSys '22: Proceedings of the 16th ACM Conference on Recommender Systems
          September 2022
          743 pages

          Copyright © 2022 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 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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 13 September 2022

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed limited

          Acceptance Rates

          Overall Acceptance Rate254of1,295submissions,20%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format