IRAIAug 27, 2023

Text Matching Improves Sequential Recommendation by Reducing Popularity Biases

arXiv:2308.14029v140 citationsh-index: 40Has Code
Originality Incremental advance
AI Analysis

This work addresses popularity bias and cold start problems in recommendation systems, offering a domain-specific improvement.

The paper tackles the problem of popularity bias in sequential recommendation systems by proposing TASTE, a model that uses text matching to represent items and users, which outperforms state-of-the-art methods on standard datasets and alleviates cold start issues.

This paper proposes Text mAtching based SequenTial rEcommendation model (TASTE), which maps items and users in an embedding space and recommends items by matching their text representations. TASTE verbalizes items and user-item interactions using identifiers and attributes of items. To better characterize user behaviors, TASTE additionally proposes an attention sparsity method, which enables TASTE to model longer user-item interactions by reducing the self-attention computations during encoding. Our experiments show that TASTE outperforms the state-of-the-art methods on widely used sequential recommendation datasets. TASTE alleviates the cold start problem by representing long-tail items using full-text modeling and bringing the benefits of pretrained language models to recommendation systems. Our further analyses illustrate that TASTE significantly improves the recommendation accuracy by reducing the popularity bias of previous item id based recommendation models and returning more appropriate and text-relevant items to satisfy users. All codes are available at https://github.com/OpenMatch/TASTE.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes