REVIEW 2 cited by
Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Top-$N$ sequential recommendation models each user as a sequence of items interacted in the past and aims to predict top-$N$ ranked items that a user will likely interact in a `near future'. The order of interaction implies that sequential patterns play an important role where more recent items in a sequence have a larger impact on the next item. In this paper, we propose a Convolutional Sequence Embedding Recommendation Model (\emph{Caser}) as a solution to address this requirement. The idea is to embed a sequence of recent items into an `image' in the time and latent spaces and learn sequential patterns as local features of the image using convolutional filters. This approach provides a unified and flexible network structure for capturing both general preferences and sequential patterns. The experiments on public datasets demonstrated that Caser consistently outperforms state-of-the-art sequential recommendation methods on a variety of common evaluation metrics.
Forward citations
Cited by 2 Pith papers
-
Beyond Semantic Understanding: Preserving Collaborative Frequency Components in LLM-based Recommendation
FreLLM4Rec shows that LLMs attenuate low-frequency collaborative components of item embeddings and introduces graph and temporal low-pass filters that preserve them, achieving up to 8% NDCG@10 gains.
-
Coarse-to-Fine Long-term Interest Modeling for Generative Recommendation
GLASS extends generative retrieval with a tiered long-term interest vector and a first-SID-keyed search of long histories, reporting consistent gains over Tiger and DualGR on two public datasets.
Discussion (0). Sign in to comment.