Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 230

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

TAGNN: Target Attentive Graph Neural Networks for Session-based Recommendation

Open access
Yu, Feng, Zhu, Yanqiao, Liu, Qiang, Wu, Shu, Wang, Liang, Tan, Tieniu · 2020 · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval

Abstract

Session-based recommendation nowadays plays a vital role in many websites, which aims to predict users' actions based on anonymous sessions. There have emerged many studies that model a session as a sequence or a graph via investigating temporal transitions of items in a session. However, these methods compress a session into one fixed representation vector without considering the target items to be predicted. The fixed vector will restrict the representation ability of the recommender model, considering the diversity of target items and users' interests. In this paper, we propose a novel target attentive graph neural network (TAGNN) model for session-based recommendation. In TAGNN, target-aware attention adaptively activates different user interests with respect to varied target items. The learned interest representation vector varies with different target items, greatly improving the expressiveness of the model. Moreover, TAGNN harnesses the power of graph neural networks to capture rich item transitions in sessions. Comprehensive experiments conducted on real-world datasets demonstrate its superiority over state-of-the-art methods.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3397271.3401319

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • The graph neural network model

    Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582

  • Item-based collaborative filtering recommendation algorithms

    Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135 · cited 4×

    “The traditional baselines include (a) frequency-based methods POP and S-POP, (b) similarity-based method Item-KNN [9], and (c) factorization-based methods Bayesian personalized ranking (BPRMF) [7] and factorizing personalized Markov chain model (FPMC) [8].”
    MethodInfluential

Cited by

See all 230

Metadata

Authors
Yu, F., Zhu, Y., Liu, Q., Wu, S., Wang, L., & Tan, T.
Venue
Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval
Publisher
ACM
Published
2020-07-25
Pages
1921-1924
OpenAlex
W3021402147
Cited by
230
References
2
FWCI
25.20
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.