Pith. sign in

REVIEW 3 cited by

Session-based Recommendation with Graph Neural Networks

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

arxiv 1811.00855 v4 pith:LYVJBZOI submitted 2018-11-01 cs.IR cs.LGstat.ML

classification cs.IRcs.LGstat.ML
keywords sessionrecommendationsession-basedcomplexgraphitemsmethodstransitions
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The problem of session-based recommendation aims to predict user actions based on anonymous sessions. Previous methods model a session as a sequence and estimate user representations besides item representations to make recommendations. Though achieved promising results, they are insufficient to obtain accurate user vectors in sessions and neglect complex transitions of items. To obtain accurate item embedding and take complex transitions of items into account, we propose a novel method, i.e. Session-based Recommendation with Graph Neural Networks, SR-GNN for brevity. In the proposed method, session sequences are modeled as graph-structured data. Based on the session graph, GNN can capture complex transitions of items, which are difficult to be revealed by previous conventional sequential methods. Each session is then represented as the composition of the global preference and the current interest of that session using an attention network. Extensive experiments conducted on two real datasets show that SR-GNN evidently outperforms the state-of-the-art session-based recommendation methods consistently.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Two-Stage Session-based Recommendations with Candidate Rank Embeddings

    cs.IR 2019-08 conditional novelty 6.0 of 10

    A two-stage session-based recommender that adds Candidate Rank Embeddings to a re-ranker improves Recall@20 and MRR@20 over several baselines.

  2. Optimizing Sequential Recommendation Models with Scaling Laws and Approximate Entropy

    cs.AI 2024-11 reject novelty 4.0 of 10

    The authors propose a 'Performance Law' for sequential recommendation models that predicts HR and NDCG from model layers, embedding dimension, and number of tokens divided by Approximate Entropy, then uses the fitted ...

  3. Accelerated learning from recommender systems using multi-armed bandit

    cs.IR 2019-08 conditional novelty 4.0 of 10

    A Vrbo team used daily Thompson sampling to rank four recommendation models by click-through rate, but the A/B validation they report is for a previous campaign's winner, not the current one.

Pith tools