QoS-Aware Graph Contrastive Learning for Web Service Recommendation
Not on the map. Why?
Abstract (arXiv)
With the rapid growth of cloud services driven by advancements in web service technology, selecting a high-quality service from a wide range of options has become a complex task. This study aims to address the challenges of data sparsity and the cold-start problem in web service recommendation using Quality of Service (QoS). We propose a novel approach called QoS-aware graph contrastive learning (QAGCL) for web service recommendation. Our model harnesses the power of graph contrastive learning to handle cold-start problems and improve recommendation accuracy effectively. By constructing contextually augmented graphs with geolocation information and randomness, our model provides diverse views. Through the use of graph convolutional networks and graph contrastive learning techniques, we learn user and service embeddings from these augmented graphs. The learned embeddings are then utilized to seamlessly integrate QoS considerations into the recommendation process. Experimental results demonstrate the superiority of our QAGCL model over several existing models, highlighting its effectiveness in addressing data sparsity and the cold-start problem in QoS-aware service recommendations. Our research contributes to the potential for more accurate recommendations in real-world scenarios, even with limited user-service interaction data.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 16 of its 42 references that are in the map. First posted on arXiv 6 Jan 2024.
Builds on
16 of 42 references.
References · 16
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2017Neural Collaborative Filteringcited by 1,108
- 2019Neural Graph Collaborative Filteringcited by 660
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
- 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 119
- 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
- 2023LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendationcited by 72
- 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
- 2021Interest-aware Message-Passing GCN for Recommendationcited by 39
4 more
- 2022Blurring-Sharpening Process Models for Collaborative Filteringcited by 35
- 2021LT-OCF: Learnable-Time ODE-based Collaborative Filteringcited by 21
- 2021Linear, or Non-Linear, That is the Question!cited by 19
- 2023Contrastive Self-supervised Learning in Recommender Systems: A Surveycited by 14
Built on by
Citing papers per year: 2024: 2.
2 papers.