Personalized Re-ranking with Item Relationships for E-commerce

28Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Re-ranking is a critical task for large-scale commercial recommender systems. Given the initial ranked lists, top candidates are re-ranked to improve the accuracy of the ranking results. However, existing re-ranking strategies are sub-optimal due to (i) most prior works do not consider explicit item relationships, like being substitutable or complementary, which may mutually influence the user satisfaction on other items in the lists, and (ii) they usually apply an identical re-ranking strategy for all users, with personalized user preferences and intents ignored. To resolve the problem, we construct a heterogeneous graph to fuse the initial scoring information and item relationships information. We develop a graph neural network based framework, IRGPR, to explicitly model transitive item relationships by recursively aggregating relational information from multi-hop neighborhoods. We also incorporate a novel intent embedding network to embed personalized user intents into the propagation. We conduct extensive experiments on real-world datasets, demonstrating the effectiveness of IRGPR in re-ranking. Further analysis reveals that modeling the item relationships and personalized intents are particularly useful for improving the performance of re-ranking.

Cite

CITATION STYLE

APA

Liu, W., Liu, Q., Tang, R., Chen, J., He, X., & Heng, P. A. (2020). Personalized Re-ranking with Item Relationships for E-commerce. In International Conference on Information and Knowledge Management, Proceedings (pp. 925–934). Association for Computing Machinery. https://doi.org/10.1145/3340531.3412332

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free