Dual-Channel Latent Factor Analysis Enhanced Graph Contrastive Learning for Recommendation
Graph Neural Networks (GNNs) are powerful learning methods for recommender systems owing to their robustness in handling complicated user-item interactions. Recently, the integration of contrastive learning with GNNs has demonstrated remarkable performance in recommender systems to handle the issue of highly sparse user-item interaction data. Yet, some available graph contrastive learning (GCL) techniques employ stochastic augmentation, i.e., nodes or edges are randomly perturbed on the user-item bipartite graph to construct contrastive views. Such a stochastic augmentation strategy not only brings noise perturbation but also cannot utilize global collaborative signals effectively. To address it, this study proposes a latent factor analysis (LFA) enhanced GCL approach, named LFA-GCL. Our model exclusively incorporates LFA to implement the unconstrained structural refinement, thereby obtaining an augmented global collaborative graph accurately without introducing noise signals. Experiments on four public datasets show that the proposed LFA-GCL outperforms the state-of-the-art models.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningRecommendation SystemsMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Multi-Channel Factor Analysis: Identifiability and Asymptotics
Recent work by Ram\'irez et al. [2] has introduced Multi-Channel Factor Analysis (MFA) as an extension of factor analysis to multi-channel data that allows for latent factors common to all channels as well as factors spe…
Learning Network Representations with Disentangled Graph Auto-Encoder
The (variational) graph auto-encoder is widely used to learn representations for graph-structured data. However, the formation of real-world graphs is a complicated and heterogeneous process influenced by latent factors.…
DecoderLearning Network RepresentationsContext-Enhanced CSI Tracking Using Koopman-Inspired Dual Autoencoders in Dynamic Wireless Environments
This paper introduces a novel framework for tracking and predicting Channel State Information (CSI) by leveraging Physics-Informed Autoencoders (PIAE) integrated with a learned Koopman operator. The proposed approach mod…
Computational EfficiencyPrivacy PreservingAn Adam-enhanced Particle Swarm Optimizer for Latent Factor Analysis
Digging out the latent information from large-scale incomplete matrices is a key issue with challenges. The Latent Factor Analysis (LFA) model has been investigated in depth to an alyze the latent information. Recently, …
A Differential Evolution-Enhanced Latent Factor Analysis Model for High-dimensional and Sparse Data
High-dimensional and sparse (HiDS) matrices are frequently adopted to describe the complex relationships in various big data-related systems and applications. A Position-transitional Latent Factor Analysis (PLFA) model c…
Position