Pith. sign in

REVIEW 3 cited by

Graph Learning based Recommender Systems: A Review

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 2105.06339 v1 pith:E37ECI4B submitted 2021-05-13 cs.IR cs.AIcs.LG

classification cs.IRcs.AIcs.LG
keywords glrsgraphlearningapproachesareadevelopmentfilteringgraphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent years have witnessed the fast development of the emerging topic of Graph Learning based Recommender Systems (GLRS). GLRS employ advanced graph learning approaches to model users' preferences and intentions as well as items' characteristics for recommendations. Differently from other RS approaches, including content-based filtering and collaborative filtering, GLRS are built on graphs where the important objects, e.g., users, items, and attributes, are either explicitly or implicitly connected. With the rapid development of graph learning techniques, exploring and exploiting homogeneous or heterogeneous relations in graphs are a promising direction for building more effective RS. In this paper, we provide a systematic review of GLRS, by discussing how they extract important knowledge from graph-based representations to improve the accuracy, reliability and explainability of the recommendations. First, we characterize and formalize GLRS, and then summarize and categorize the key challenges and main progress in this novel research area. Finally, we share some new research directions in this vibrant area.

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. Heterogeneous Graph Backdoor Attack

    cs.CR 2025-05 conditional novelty 7.0 of 10

    HGBA is a backdoor attack against heterogeneous graph neural networks that uses a single relation-based trigger edge to achieve high attack success with low budget and resistance to defenses.

  2. UniSAGE: Unifying Static and Dynamic Attributes with Hyper-Structure

    cs.CL 2026-05 conditional novelty 6.0 of 10

    UniSAGE jointly models static and dynamic attributes in a single attribute graph and improves entity classification/regression over prior RDL and GNN baselines.

  3. RankGraph: Unified Heterogeneous Graph Learning for Cross-Domain Recommendation

    cs.IR 2025-09 conditional novelty 4.0 of 10

    RankGraph combines RGCN-style message passing, contrastive learning, and graph-token injection into foundation-model recommenders, reporting small online CTR and CVR gains.

Pith tools