Squeeze and Excitation: A Weighted Graph Contrastive Learning for Collaborative Filtering

Contrastive Learning (CL) has recently emerged as a powerful technique in recommendation systems, particularly for its capability to harness self-supervised signals from perturbed views to mitigate the data sparsity problem.The process of constructing perturbed views of the user-item bipartite graph and performing CL between perturbed views in a graph convolutional network (GCN) is called graph contrastive learning (GCL).Although existing GCL-based models are effective, the weight assignment method for perturbed views has not been fully explored.A critical problem in existing GCL-based models is the irrational allocation of feature attention.This problem limits the model's ability to effectively leverage crucial features, resulting in suboptimal performance.To address this, we propose a Weighted Graph Contrastive Learning framework (WeightedGCL).Specifically, WeightedGCL applies a robust perturbation strategy, which perturbs only the view of the final GCN layer.In addition, WeightedGCL incorporates a squeeze and excitation network to dynamically weight the features of the perturbed views.Our WeightedGCL strengthens the model's focus on crucial features and reduces the impact of less relevant information.Extensive experiments on widely used datasets demonstrate that our Weight-edGCL achieves significant accuracy improvements compared to competitive baselines.