Abstract
The presence or absence of one item in a recommendation list will affect the demand for other items because customers are often willing to switch to other items if their most preferred items are not available. The cross-item influence, called “peers effect”, has been largely ignored in the literature. In this paper, we develop a peers-aware recommender system, named PARS. We apply a ranking-based choice model to capture the cross-item influence and solve the resultant MaxMin problem with a decomposition algorithm. The MaxMin model solves for the recommendation decision in the meanwhile of estimating users’ preferences towards the items, which yields high-quality recommendations robust to input data variation. Experimental results illustrate that PARS outperforms a few frequently used methods in practice. An online evaluation with a flash sales scenario at Taobao also shows that PARS delivers significant improvements in terms of both conversion rates and user value.
Original language | English |
---|---|
Title of host publication | The Web Conference 2020 |
Subtitle of host publication | Proceedings of The World Wide Web Conference WWW 2020 |
Publisher | Association for Computing Machinery |
Pages | 2606-2612 |
ISBN (Print) | 978-1-4503-7023-3 |
DOIs | |
Publication status | Published - Apr 2020 |
Event | 29th International World Wide Web Conference (WWW '20) - Online, Taipei, Taiwan Duration: 20 Apr 2020 → 24 Apr 2020 https://www2020.thewebconf.org/ |
Publication series
Name | The Web Conference 2020 - Proceedings of the World Wide Web Conference, WWW 2020 |
---|
Conference
Conference | 29th International World Wide Web Conference (WWW '20) |
---|---|
Abbreviated title | The Web Conference 2020 |
Country/Territory | Taiwan |
City | Taipei |
Period | 20/04/20 → 24/04/20 |
Internet address |
Bibliographical note
Research Unit(s) information for this publication is provided by the author(s) concerned.Research Keywords
- E-commerce
- Recommender system
- Ranking-based model
- Demand substitution
Publisher's Copyright Statement
- This paper is published under the Creative Commons Attribution 4.0 International (CC-BY 4.0) license.