skip to main content
10.1145/3539618.3591623acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
research-article
Open Access

A Critical Reexamination of Intra-List Distance and Dispersion

Published:18 July 2023Publication History

ABSTRACT

Diversification of recommendation results is a promising approach for coping with the uncertainty associated with users' information needs. Of particular importance in diversified recommendation is to define and optimize an appropriate diversity objective. In this study, we revisit the most popular diversity objective called intra-list distance (ILD), defined as the average pairwise distance between selected items, and a similar but lesser known objective called dispersion, which is the minimum pairwise distance. Owing to their simplicity and flexibility, ILD and dispersion have been used in a plethora of diversified recommendation research. Nevertheless, we do not actually know what kind of items are preferred by them.

We present a critical reexamination of ILD and dispersion from theoretical and experimental perspectives. Our theoretical results reveal that these objectives have potential drawbacks: ILD may select duplicate items that are very close to each other, whereas dispersion may overlook distant item pairs. As a competitor to ILD and dispersion, we design a diversity objective called Gaussian ILD, which can interpolate between ILD and dispersion by tuning the bandwidth parameter. We verify our theoretical results by experimental results using real-world data and confirm the extreme behavior of ILD and dispersion in practice.

References

  1. Gediminas Adomavicius and YoungOk Kwon. 2012. Improving aggregate recommendation diversity using ranking-based techniques. IEEE Trans. Knowl. Data Eng., Vol. 24, 5 (2012), 896--911.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Gediminas Adomavicius and YoungOk Kwon. 2014. Optimization-based approaches for maximizing aggregate recommendation diversity. INFORMS J. Comput., Vol. 26, 2 (2014), 351--369.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverson, and Samuel Ieong. 2009. Diversifying Search Results. In WSDM. 5--14.Google ScholarGoogle Scholar
  4. Enrique Amigó, Damiano Spina, and Jorge Carrillo-de Albornoz. 2018. An Axiomatic Analysis of Diversity Evaluation Metrics: Introducing the Rank-Biased Utility Metric. In SIGIR. 625--634.Google ScholarGoogle Scholar
  5. Arda Antikacioglu, Tanvi Bajpai, and R. Ravi. 2019. A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms. SIAM J. Math. Data Sci., Vol. 1, 4 (2019), 759--779.Google ScholarGoogle ScholarCross RefCross Ref
  6. Azin Ashkan, Branislav Kveton, Shlomo Berkovsky, and Zheng Wen. 2015. Optimal Greedy Diversity for Recommendation. In IJCAI. 1742--1748.Google ScholarGoogle Scholar
  7. Benjamin Birnbaum and Kenneth J. Goldman. 2009. An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs. Algorithmica, Vol. 55, 1 (2009), 42--59.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Rubi Boim, Tova Milo, and Slava Novgorodov. 2011. Diversification and Refinement in Collaborative Filtering Recommender. In CIKM. 739--744.Google ScholarGoogle Scholar
  9. Allan Borodin, Hyun Chul Lee, and Yuli Ye. 2012. Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates. In PODS. 155--166.Google ScholarGoogle Scholar
  10. Alexei Borodin and Eric M. Rains. 2005. Eynard-Mehta theorem, Schur process, and their Pfaffian analogs. J. Stat. Phys., Vol. 121, 3--4 (2005), 291--317.Google ScholarGoogle ScholarCross RefCross Ref
  11. 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
  12. Pablo Castells, Neil J. Hurley, and Saul Vargas. 2015. Novelty and Diversity in Recommender Systems. In Recommender Systems Handbook. Springer, 881--918.Google ScholarGoogle Scholar
  13. Peizhe Cheng, Shuaiqiang Wang, Jun Ma, Jiankai Sun, and Hui Xiong. 2017. Learning to Recommend Accurate and Diverse Items. In WWW. 183--192.Google ScholarGoogle Scholar
  14. Charles L. A. Clarke, Maheedhar Kolla, Gordon V. Cormack, Olga Vechtomova, Azin Ashkan, Stefan Büttcher, and Ian MacKinnon. 2008. Novelty and Diversity in Information Retrieval Evaluation. In SIGIR. 659--666.Google ScholarGoogle Scholar
  15. Marina Drosou, H.V. Jagadish, Evaggelia Pitoura, and Julia Stoyanovich. 2017. Diversity in Big Data: A Review. Big Data, Vol. 5, 2 (2017), 73--84.Google ScholarGoogle ScholarCross RefCross Ref
  16. Marina Drosou and Evaggelia Pitoura. 2010. Search Result Diversification. SIGMOD Rec., Vol. 39, 1 (2010), 41--47.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Michael D. Ekstrand, F. Maxwell Harper, Martijn C. Willemsen, and Joseph A. Konstan. 2014. User Perception of Differences in Recommender Algorithms. In RecSys. 161--168.Google ScholarGoogle Scholar
  18. Erhan Erkut. 1990. The discrete p-dispersion problem. Eur. J. Oper. Res. , Vol. 46, 1 (1990), 48--60.Google ScholarGoogle ScholarCross RefCross Ref
  19. Erhan Erkut and Susan Neuman. 1989. Analytical models for locating undesirable facilities. Eur. J. Oper. Res., Vol. 40, 3 (1989), 275--291.Google ScholarGoogle ScholarCross RefCross Ref
  20. Damien Garreau, Wittawat Jitkrittum, and Motonobu Kanagawa. 2019. Large sample analysis of the median heuristic. CoRR, Vol. abs/1707.07269 (2019).Google ScholarGoogle Scholar
  21. Sreenivas Gollapudi and Aneesh Sharma. 2009. An Axiomatic Approach for Result Diversification. In WWW. 381--390.Google ScholarGoogle Scholar
  22. Arthur Gretton, Bharath K. Sriperumbudur, Dino Sejdinovic, Heiko Strathmann, Sivaraman Balakrishnan, Massimiliano Pontil, and Kenji Fukumizu. 2012. Optimal kernel choice for large-scale two-sample tests. In NIPS. 1214--1222.Google ScholarGoogle Scholar
  23. GroupLens. 2003. MovieLens 1M Dataset. https://grouplens.org/datasets/movielens/1m/ Retrieved April, 2022 fromGoogle ScholarGoogle Scholar
  24. F. Maxwell Harper and Joseph A. Konstan. 2015. The MovieLens datasets: History and context. ACM Trans. Interact. Intell. Syst., Vol. 5, 4 (2015), 1--19.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Neil Hurley and Mi Zhang. 2011. Novelty and Diversity in Top-N Recommendation -- Analysis and Evaluation. ACM Trans. Internet Techn., Vol. 10, 4 (2011), 14:1--14:30.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Marius Kaminskas and Derek Bridge. 2017. Diversity, Serendipity, Novelty, and Coverage: A Survey and Empirical Analysis of Beyond-Accuracy Objectives in Recommender Systems. ACM Trans. Interact. Intell. Syst., Vol. 7, 1 (2017), 2:1--2:42.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Michael J. Kuby. 1987. Programming Models for Facility Dispersion: The p-Dispersion and Maxisum Dispersion Problems. Geographical Analysis, Vol. 19, 4 (1987), 315--329.Google ScholarGoogle ScholarCross RefCross Ref
  28. Alex Kulesza and Ben Taskar. 2012. Determinantal Point Processes for Machine Learning. Found. Trends Mach. Learn., Vol. 5, 2--3 (2012), 123--286.Google ScholarGoogle ScholarCross RefCross Ref
  29. Matevž Kunaver and Tomaž Požrl. 2017. Diversity in recommender systems -- A survey. Knowl. Based Syst., Vol. 123 (2017), 154--162.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Odile Macchi. 1975. The coincidence approach to stochastic point processes. Adv. Appl. Probab., Vol. 7, 1 (1975), 83--122.Google ScholarGoogle ScholarCross RefCross Ref
  31. Sean M. McNee, John Riedl, and Joseph A. Konstan. 2006. Being Accurate is Not Enough: How Accuracy Metrics Have Hurt Recommender Systems. In SIGCHI. 1097--1101.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Jianmo Ni. 2018. Amazon review data. https://nijianmo.github.io/amazon/ Retrieved April, 2022 fromGoogle ScholarGoogle Scholar
  33. Jianmo Ni, Jiacheng Li, and Julian McAuley. 2019. Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects. In EMNLP. 188--197.Google ScholarGoogle Scholar
  34. Javier Parapar and Filip Radlinski. 2021. Towards Unified Metrics for Accuracy and Diversity for Recommender Systems. In RecSys. 75--84.Google ScholarGoogle Scholar
  35. Jeff M. Phillips and Suresh Venkatasubramanian. 2011. A Gentle Introduction to the Kernel Distance. CoRR, Vol. abs/1103.1625 (2011).Google ScholarGoogle Scholar
  36. Lijing Qin and Xiaoyan Zhu. 2013. Promoting Diversity in Recommendation by Entropy Regularizer. In IJCAI. 2698--2704.Google ScholarGoogle Scholar
  37. S. S. Ravi, Daniel J. Rosenkrantz, and Giri Kumar Tayi. 1994. Heuristic and Special Case Algorithms for Dispersion Problems. Oper. Res., Vol. 42, 2 (1994), 299--310.Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Marco Túlio Ribeiro, Anísio Lacerda, Adriano Veloso, and Nivio Ziviani. 2012. Pareto-efficient hybridization for multi-objective recommender systems. In RecSys. 19--26.Google ScholarGoogle Scholar
  39. Marco Túlio Ribeiro, Nivio Ziviani, Edleno Silva De Moura, Itamar Hata, An'i sio Lacerda, and Adriano Veloso. 2014. Multiobjective pareto-efficient approaches for recommender systems. ACM Trans. Intell. Syst. Technol., Vol. 5, 4 (2014), 1--20.Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Tetsuya Sakai and Ruihua Song. 2011. Evaluating Diversified Search Results Using Per-intent Graded Relevance. In SIGIR. 1043--1052.Google ScholarGoogle Scholar
  41. Chaofeng Sha, Xiaowei Wu, and Junyu Niu. 2016. A framework for recommending relevant and diverse items. In IJCAI. 3868--3874.Google ScholarGoogle Scholar
  42. Barry Smyth and Paul McClave. 2001. Similarity vs. Diversity. In ICCBR. 347--361.Google ScholarGoogle Scholar
  43. Harald Steck. 2019. Embarrassingly Shallow Autoencoders for Sparse Data. In WWW. 3251--3257.Google ScholarGoogle Scholar
  44. Ruilong Su, Li'Ang Yin, Kailong Chen, and Yong Yu. 2013. Set-oriented Personalized Ranking for Diversified Top-N Recommendation. In RecSys. 415--418.Google ScholarGoogle Scholar
  45. Arie Tamir. 1991. Obnoxious Facility Location on Graphs. SIAM J. Discret. Math., Vol. 4, 4 (1991), 550--567.Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Saúl Vargas, Linas Baltrunas, Alexandros Karatzoglou, and Pablo Castells. 2014. Coverage, Redundancy and Size-Awareness in Genre Diversity for Recommender Systems. In RecSys. 209--216.Google ScholarGoogle Scholar
  47. Saúl Vargas and Pablo Castells. 2011. Rank and Relevance in Novelty and Diversity Metrics for Recommender Systems. In RecSys. 109--116.Google ScholarGoogle Scholar
  48. Jacek Wasilewski and Neil Hurley. 2016. Incorporating Diversity in a Learning to Rank Recommender System. In FLAIRS. 572--578.Google ScholarGoogle Scholar
  49. Qiong Wu, Yong Liu, Chunyan Miao, Yin Zhao, Lu Guan, and Haihong Tang. 2019. Recent Advances in Diversified Recommendation. CoRR, Vol. abs/1905.06589 (2019).Google ScholarGoogle Scholar
  50. Cong Yu, Laks Lakshmanan, and Sihem Amer-Yahia. 2009. It Takes Variety to Make a World: Diversification in Recommender Systems. In EDBT. 368--378.Google ScholarGoogle Scholar
  51. Eva Zangerle and Christine Bauer. 2022. Evaluating Recommender Systems: Survey and Framework. ACM Comput. Surv., Vol. 55, 8 (2022), 1--38.Google ScholarGoogle Scholar
  52. Mi Zhang and Neil Hurley. 2008. Avoiding Monotony: Improving the Diversity of Recommendation Lists. In RecSys. 123--130.Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Cai-Nicolas Ziegler, Sean M. McNee, Joseph A. Konstan, and Georg Lausen. 2005. Improving Recommendation Lists Through Topic Diversification. In WWW. 22--32. ioGoogle ScholarGoogle Scholar

Index Terms

  1. A Critical Reexamination of Intra-List Distance and Dispersion

    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
      SIGIR '23: Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval
      July 2023
      3567 pages
      ISBN:9781450394086
      DOI:10.1145/3539618

      Copyright © 2023 Owner/Author

      This work is licensed under a Creative Commons Attribution International 4.0 License.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 18 July 2023

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate792of3,983submissions,20%
    • Article Metrics

      • Downloads (Last 12 months)198
      • Downloads (Last 6 weeks)29

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader