Pith.

Information Retrieval · arXiv:1812.02646 v1 · submitted 6 Dec 2018

RepeatNet: A Repeat Aware Neural Recommendation Machine for Session-based Recommendation

Pengjie Ren, Zhumin Chen, Jing Li, Zhaochun Ren, Jun Ma, Maarten de Rijke

The paper says

“RepeatNet outperforms state-of-the-art baselines on all three datasets in terms of MRR and Recall.”

from the abstract · picked out as the main claim by a classifier

Pith says

Pith has not reviewed this paper.

Get a Pith Review, $5

Reviews

Reviews by people

No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

Recurrent neural networks for session-based recommendation have attracted a lot of attention recently because of their promising performance. repeat consumption is a common phenomenon in many recommendation scenarios (e.g., e-commerce, music, and TV program recommendations), where the same item is re-consumed repeatedly over time. However, no previous studies have emphasized repeat consumption with neural networks. An effective neural approach is needed to decide when to perform repeat recommendation. In this paper, we incorporate a repeat-explore mechanism into neural networks and propose a new model, called RepeatNet, with an encoder-decoder structure. RepeatNet integrates a regular neural recommendation approach in the decoder with a new repeat recommendation mechanism that can choose items from a user's history and recommends them at the right time. We report on extensive experiments on three benchmark datasets. RepeatNet outperforms state-of-the-art baselines on all three datasets in terms of MRR and Recall. Furthermore, as the dataset size and the repeat ratio increase, the improvements of RepeatNet over the baselines also increase, which demonstrates its advantage in handling repeat recommendation scenarios.

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-09-23 · no language-model review

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.79 · states limitation 0.07 · human participants 0.05 · controlled comparison 0.92 · randomized assignment 0.01 · states quantitative result 0.24 · compares with prior results 0.98 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Recurrent neural networks for session-based recommendation have attracted a lot of attention recently because of their promising performance. repeat consumption is a common phenomenon in many recommendation scenarios (e.g., e-commerce, music, and TV program recommendations), where the same item is re-consumed repeatedly over time. background 1.00 0.06 0.02 asserted 0.99
However, no previous studies have emphasized repeat consumption with neural networks. gap 1.00 0.05 0.02 asserted 1.00
An effective neural approach is needed to decide when to perform repeat recommendation. gap 0.82 0.05 0.03 asserted 0.92
In this paper, we incorporate a repeat-explore mechanism into neural networks and propose a new model, called RepeatNet, with an encoder-decoder structure. contribution 0.61 0.94 0.06 asserted 0.99
RepeatNet integrates a regular neural recommendation approach in the decoder with a new repeat recommendation mechanism that can choose items from a user's history and recommends them at the right time. method 0.95 0.86 0.07 asserted 1.00
We report on extensive experiments on three benchmark datasets. method 0.56 0.93 0.02 asserted 0.93
RepeatNet outperforms state-of-the-art baselines on all three datasets in terms of MRR and Recall. result 1.00 0.96 0.70 asserted 1.00
Furthermore, as the dataset size and the repeat ratio increase, the improvements of RepeatNet over the baselines also increase, which demonstrates its advantage in handling repeat recommendation scenarios. interpretation 0.76 0.94 0.37 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.99

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,180 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Cited by 1 Pith paper

Reviewed papers on Pith that cite this one. The full citation record

  1. RELAY: One Query, Two Roles for Sequential Recommendation cs.IR · Oct 2026
How the literature uses it

2 arXiv papers cite this in 2 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 1 sentence without a confident label

Compares with it 1 paper
  • We compare TailNet with frequency based methods (POP and S-POP), two RNN-based methods (GRU4REC [ref] and NARM [ref] ), neighborhood-based method (Item-KNN [ref] ), repeat-explore method (RepeatNet [ref] ), attention-based method (STAMP [ref] ), two traditional Matrix Factorization or Markov Chain approaches (FPMC [ref] and BPR-MF [ref] ), and GNN-based method (SR-GNN [ref] ).

    Long-tail Session-based Recommendation · Experiments · 0.99

Challenges and discussion

Know something about this paper? Leave a comment.

No comments yet.

Sign in to comment