QoS-Aware Graph Contrastive Learning for Web Service Recommendation
Abstract: 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.
- L.-J. Zhang, J. Zhang, and H. Cai, “Services computing. 2007.”
- Q. Duan, Y. Yan, and A. V. Vasilakos, “A survey on service-oriented network virtualization toward convergence of networking and cloud computing,” IEEE Transactions on Network and Service Management, vol. 9, no. 4, pp. 373–392, 2012.
- S. H. Ghafouri, S. M. Hashemi, and P. C. K. Hung, “A survey on web service qos prediction methods,” IEEE Transactions on Services Computing, vol. 15, no. 4, pp. 2439–2454, 2022.
- M. Tang, X. Dai, B. Cao, and J. Liu, “Wswalker: A random walk method for qos-aware web service recommendation,” in 2015 IEEE International Conference on Web Services, pp. 591–598, 2015.
- K. Lee, J. Park, and J. Baik, “Location-based web service qos prediction via preference propagation for improving cold start problem,” in 2015 IEEE International Conference on Web Services, pp. 177–184, 2015.
- D. Ryu, K. Lee, and J. Baik, “Location-based web service qos prediction via preference propagation to address cold start problem,” IEEE Transactions on Services Computing, vol. 14, no. 3, pp. 736–746, 2018.
- J. Choi, J. Lee, D. Ryu, S. Kim, and J. Baik, “Gain-qos: A novel qos prediction model for edge computing,” Journal of Web Engineering, vol. 21, no. 1, pp. 27–51, 2022.
- Z. Zheng, H. Ma, M. R. Lyu, and I. King, “Collaborative web service qos prediction via neighborhood integrated matrix factorization,” IEEE Transactions on Services Computing, vol. 6, no. 3, pp. 289–299, 2012.
- T. Yu, Y. Zhang, and K.-J. Lin, “Efficient algorithms for web services selection with end-to-end qos constraints,” ACM Transactions on the Web (TWEB), vol. 1, no. 1, pp. 6–es, 2007.
- R. Phalnikar and P. A. Khutade, “Survey of qos based web service discovery,” in 2012 World Congress on Information and Communication Technologies, pp. 657–661, IEEE, 2012.
- Y. Zhang, Z. Zheng, and M. R. Lyu, “Wsexpress: A qos-aware search engine for web services,” in 2010 IEEE International Conference on Web Services, pp. 91–98, 2010.
- Z. Zheng, L. Xiaoli, M. Tang, F. Xie, and M. R. Lyu, “Web service qos prediction via collaborative filtering: A survey,” IEEE Transactions on Services Computing, 2020.
- H. Shin, S. Kim, J. Shin, and X. Xiao, “Privacy enhanced matrix factorization for recommendation with local differential privacy,” IEEE Transactions on Knowledge and Data Engineering, vol. 30, no. 9, pp. 1770–1782, 2018.
- Y. He, C. Wang, and C. Jiang, “Correlated matrix factorization for recommendation with implicit feedback,” IEEE Transactions on Knowledge and Data Engineering, vol. 31, no. 3, pp. 451–464, 2019.
- Z. ur Rehman, O. K. Hussain, F. K. Hussain, E. J. Chang, and T. S. Dillon, “User-side qos forecasting and management of cloud services,” World Wide Web, vol. 18, pp. 1677–1716, 2015.
- M. S. Hossain, “Qos in web service-based collaborative multimedia environment,” in 16th International Conference on Advanced Communication Technology, pp. 881–884, 2014.
- M. Chen, Y. Ma, B. Hu, and L.-J. Zhang, “A ranking-oriented hybrid approach to qos-aware web service recommendation,” in 2015 IEEE International Conference on Services Computing, pp. 578–585, IEEE, 2015.
- Y. Yin, W. Zhang, Y. Xu, H. Zhang, Z. Mai, and L. Yu, “Qos prediction for mobile edge service recommendation with auto-encoder,” IEEE Access, vol. 7, pp. 62312–62324, 2019.
- S. Wang, Y. Zhao, L. Huang, J. Xu, and C.-H. Hsu, “Qos prediction for service recommendations in mobile edge computing,” Journal of Parallel and Distributed Computing, vol. 127, pp. 134–144, 2019.
- J. Zhu, B. Li, J. Wang, D. Li, Y. Liu, and Z. Zhang, “Bgcl: Bi-subgraph network based on graph contrastive learning for cold-start qos prediction,” Knowledge-Based Systems, vol. 263, p. 110296, 2023.
- T. E. Trueman, P. Narayanasamy, and J. Ashok Kumar, “A graph-based method for ranking of cloud service providers,” The Journal of Supercomputing, vol. 78, no. 5, pp. 7260–7277, 2022.
- Z. Chang, D. Ding, and Y. Xia, “A graph-based qos prediction approach for web service recommendation,” Applied Intelligence, vol. 51, no. 10, pp. 6728–6742, 2021.
- R. van den Berg, T. N. Kipf, and M. Welling, “Graph convolutional matrix completion,” in KDD, 2017.
- X. Wang, X. He, M. Wang, F. Feng, and T.-S. Chua, “Neural graph collaborative filtering,” in SIGIR, 2019.
- X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, and M. Wang, “LightGCN: Simplifying and powering graph convolution network for recommendation,” in SIGIR, 2020.
- K. Mao, J. Zhu, J. Wang, Q. Dai, Z. Dong, X. Xiao, and X. He, “Simplex: A simple and strong baseline for collaborative filtering,” in CIKM, p. 1243–1252, 2021.
- K. Mao, J. Zhu, X. Xiao, B. Lu, Z. Wang, and X. He, “Ultragcn: Ultra simplification of graph convolutional networks for recommendation,” in CIKM, 2021.
- J. Choi, J. Jeon, and N. Park, “LT-OCF: Learnable-time ode-based collaborative filtering,” in CIKM, 2021.
- L. Chen, L. Wu, R. Hong, K. Zhang, and M. Wang, “Revisiting graph based collaborative filtering: A linear residual graph convolutional network approach,” in AAAI, 2020.
- T. Kong, T. Kim, J. Jeon, J. Choi, Y.-C. Lee, N. Park, and S.-W. Kim, “Linear, or non-linear, that is the question!,” in WSDM, pp. 517–525, 2022.
- F. Liu, Z. Cheng, L. Zhu, Z. Gao, and L. Nie, “Interest-aware message-passing gcn for recommendation,” in TheWebConf (former WWW), p. 1296–1305, 2021.
- J. Choi, S. Hong, N. Park, and S.-B. Cho, “Blurring-sharpening process models for collaborative filtering,” in SIGIR, 2023.
- J. Yu, M. Gao, J. Li, H. Yin, and H. Liu, “Adaptive implicit friends identification over heterogeneous network for social recommendation,” in CIKM, pp. 357–366, 2018.
- Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, “Graph contrastive learning with augmentations,” NeurIPS, vol. 33, pp. 5812–5823, 2020.
- M. Jing, Y. Zhu, T. Zang, and K. Wang, “Contrastive self-supervised learning in recommender systems: A survey,” arXiv preprint arXiv: Arxiv-2303.09902, 2023.
- J. Wu, X. Wang, F. Feng, X. He, L. Chen, J. Lian, and X. Xie, “Self-supervised graph learning for recommendation,” in SIGIR, p. 726–735, 2021.
- J. Yu, H. Yin, X. Xia, T. Chen, L. Cui, and Q. V. H. Nguyen, “Are graph augmentations necessary? simple graph contrastive learning for recommendation,” in SIGIR, pp. 1294–1303, 2022.
- X. Cai, C. Huang, L. Xia, and X. Ren, “LightGCL: Simple yet effective graph contrastive learning for recommendation,” in ICLR, 2023.
- A. v. d. Oord, Y. Li, and O. Vinyals, “Representation learning with contrastive predictive coding,” arXiv preprint arXiv:1807.03748, 2018.
- S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, “Bpr: Bayesian personalized ranking from implicit feedback,” in UAI, 2009.
- X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T.-s. Chua, “Neural Collaborative Filtering,” in TheWebConf (former WWW), 2017.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.