Papers › Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding

Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding

19 Sep 2018arXiv:1809.07426archive 2025-07-28

Jiaxi Tang, Ke Wang

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 (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.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

LinJayan/Caser_Paddle mentioned on GitHubpaddleSyntology: not harvested report
UlionTse/mlgb mentioned on GitHubpytorchSyntology: not harvested report
massquantity/LibRecommender mentioned on GitHubtfMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Self-supervised Learning for Large-scale Item Recommendations (arXiv:2007.12865; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
graytowne/caser_pytorch pytorchLGPL-3.0Syntology: not harvested report
microsoft/recommenders tfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Auto-Encoding Variational Bayes (arXiv:1312.6114; that paper's own run record: 140 ran (of which 52 constructed an object rather than computing a result; 120 with no instrument failure: 4 honoured, 2 violated, 114 with no contract checked; 20 where Syntology's instrument failed) · 59 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Recommendation SystemsSequential Recommendation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections