Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Report
Data sources: ZENODO
addClaim

LightGCL and SimGCL Performance on Sparse Graph-Based Recommendation Systems

Authors: Assignee Research;

LightGCL and SimGCL Performance on Sparse Graph-Based Recommendation Systems

Abstract

This report synthesises findings from 12 peer-reviewed papers addressing the following research question: What is the relative performance of LightGCL versus SimGCL in terms of recommendation accuracy (e.g., Recall@K, NDCG@K) when trained on large-scale sparse interaction graphs with varying levels of. Graph neural network (GNN) is a powerful learning approach for graph-based recommender systems. Recently, GNNs integrated with contrastive learning have shown superior performance in recommendation with their data augmentation schemes, aiming at dealing with highly sparse data. 9 claims were extracted from source literature; 9 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 8.8/10. This report is a machine-generated literature synthesis and does not constitute original research.Research goal: What is the relative performance of LightGCL versus SimGCL in terms of recommendation accuracy (e.g., Recall@K, NDCG@K) when trained on large-scale sparse interaction graphs with varying levels of sparsity?Autonomous literature synthesis. Automated review score: 8.8/10. Full text and citation available at Assignee Research.

Powered by OpenAIRE graph
Found an issue? Give us feedback