Effective Graph Modeling and Contrastive Learning for Time-Aware QoS Prediction
Accurate and reliable service quality prediction has become a key issue in service recommendation and network measurement scenarios. However, traditional methods for time-aware QoS prediction face two main challenges: (I) data sparsity makes it difficult to estimate and recover global information from the limited known data; (II) shallow learning models struggle to represent the intricate relationships between objects, and thus suffer poor prediction performance. To this end, we propose a time-aware QoS prediction framework that combines the merits of graph modeling, graph representation learning, and contrastive learning. First, a novel graph schema is proposed to capture the complex interactions between user-service-slots. Then, a prediction model is developed leveraging a graph convolutional network to learn the node representations by aggregating feature information from neighboring nodes. Finally, a novel contrastive learning strategy is used to improve the robustness of node representation. Experimental results on a large-scale dataset demonstrated that our proposed method significantly outperforms the state-of-the-art prediction methods on response time and throughput prediction tasks.
Authors
- Hao Wu (ORCID: https://orcid.org/0000-0002-3696-9281)
- Yiji Zhao (ORCID: https://orcid.org/0000-0001-8248-9441)
- Lei Zhang (ORCID: https://orcid.org/0000-0001-8749-7459)
- Shuting Tian
- Binbin Jin
Institutions
- Nanjing Normal University (CN)
- Yunnan University (CN)
Publication Details
- Journal
- IEEE Transactions on Services Computing
- Published
- 2024-10-11
- DOI
- https://doi.org/10.1109/tsc.2024.3478836
- Citations
- 1
- Primary Topic
- Advanced Computing and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 1.96