mlsanityData to 7 Oct 2026

A Preference-oriented Diversity Model Based on Mutual-information in Re-ranking for E-commerce Search

arXiv 2405.15521 ↗First posted 24 May 2024cs.IR cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Re-ranking is a process of rearranging ranking list to more effectively meet user demands by accounting for the interrelationships between items. Existing methods predominantly enhance the precision of search results, often at the expense of diversity, leading to outcomes that may not fulfill the varied needs of users. Conversely, methods designed to promote diversity might compromise the precision of the results, failing to satisfy the users' requirements for accuracy. To alleviate the above problems, this paper proposes a Preference-oriented Diversity Model Based on Mutual-information (PODM-MI), which consider both accuracy and diversity in the re-ranking process. Specifically, PODM-MI adopts Multidimensional Gaussian distributions based on variational inference to capture users' diversity preferences with uncertainty. Then we maximize the mutual information between the diversity preferences of the users and the candidate items using the maximum variational inference lower bound to enhance their correlations. Subsequently, we derive a utility matrix based on the correlations, enabling the adaptive ranking of items in line with user preferences and establishing a balance between the aforementioned objectives. Experimental results on real-world online e-commerce systems demonstrate the significant improvements of PODM-MI, and we have successfully deployed PODM-MI on an e-commerce search platform.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 12 of its 19 references that are in the map. First posted on arXiv 24 May 2024.

Builds on

12 of 19 references.

References · 12

  1. 2016Wide & Deep Learning for Recommender Systemscited by 745
  2. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
  3. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
  4. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
  5. 2018Learning a Deep Listwise Context Model for Ranking Refinementcited by 62
  6. 2021End-to-End User Behavior Retrieval in Click-Through RatePrediction Modelcited by 45
  7. 2020Efficient Document Re-Ranking for Transformers by Precomputing Term Representationscited by 44
  8. 2018Seq2Slate: Re-ranking and Slate Optimization with RNNscited by 39
  9. 2020EdgeRec: Recommender System on Edge in Mobile Taobaocited by 29
  10. 2021Sliding Spectrum Decomposition for Diversified Recommendationcited by 15
  11. 2022Feature-aware Diversified Re-ranking with Disentangled Representations for Relevant Recommendationcited by 11
  12. 2020AliExpress Learning-To-Rank: Maximizing Online Model Performance without Going Onlinecited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.