Learning Personalized Page Content Ranking Using Customer Representation

Xin Shen, Yan Zhao, Sujan Perera, Yujia Liu, Jinyun Yan +1 more
5/9/2023
cs.IRcs.MAcs.SI

No confident code implementation found for this paper.

Abstract

On E-commerce stores, there are rich recommendation content to help shoppers shopping more efficiently. However given numerous products, it's crucial to select most relevant content to reduce the burden of information overload. We introduced a content ranking service powered by a linear causal bandit algorithm to rank and select content for each shopper under each context. The algorithm mainly leverages aggregated customer behavior features, and ignores single shopper level past activities. We study the problem of inferring shoppers interest from historical activities. We propose a deep learning based bandit algorithm that incorporates historical shopping behavior, customer latent shopping goals, and the correlation between customers and content categories. This model produces more personalized content ranking measured by 12.08% nDCG lift.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{shen2023learning,
  title  = {Learning Personalized Page Content Ranking Using Customer Representation},
  author = {Xin Shen and Yan Zhao and Sujan Perera and Yujia Liu and Jinyun Yan and Mitchell Goodman},
  year   = {2023},
  eprint = {2305.05267},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.05267v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.05267.svg)](https://codeofpaper.com/paper/2305.05267)

Discussion