Jianlong Xu, Rongtao Zhang, Dianming Lin, Mengqing Jin, Yuelong Liu
{"title":"Sparsity-resilient QoS prediction via ε-DP enhanced subgraph-inductive GNNs in internet of services","authors":"Jianlong Xu, Rongtao Zhang, Dianming Lin, Mengqing Jin, Yuelong Liu","doi":"10.1016/j.comnet.2026.112085","DOIUrl":null,"url":null,"abstract":"<div><div>The rapid evolution of the Internet of Services (IoS) in the Web 3.0 era empowers users with access to an abundance of functionally similar services. This makes reliable Quality of Service (QoS) prediction essential for selecting optimal services. However, real-world QoS data often suffer from high sparsity, and privacy concerns frequently prevent users from sharing their raw QoS records. This creates a dual challenge: achieving high prediction accuracy while preserving data privacy in sparse environments. To address these challenges, we propose DPIS-GNN, a novel framework that integrates ε-Differential Privacy (ε-DP) with subgraph-inductive Graph Neural Networks (GNNs). Our approach first applies ε-DP mechanisms to obfuscate local datasets, protecting sensitive user information. These perturbed datasets are then aggregated into a unified interaction graph, from which relevant patterns are inferred. Next, we introduce a subgraph-based GNN that inductively learns from the noisy and sparse data to produce accurate QoS predictions. Extensive experiments on real-world datasets demonstrate the effectiveness of our approach. DPIS-GNN achieves up to a 17.55% reduction in Mean Absolute Error (MAE) and a 9.77% decrease in Root Mean Square Error (RMSE), outperforming state-of-the-art baselines. Our model exhibits superior robustness in sparse and cold-start scenarios, offering both strong privacy protection and high predictive performance.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"278 ","pages":"Article 112085"},"PeriodicalIF":4.6000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128626000976","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/3 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
The rapid evolution of the Internet of Services (IoS) in the Web 3.0 era empowers users with access to an abundance of functionally similar services. This makes reliable Quality of Service (QoS) prediction essential for selecting optimal services. However, real-world QoS data often suffer from high sparsity, and privacy concerns frequently prevent users from sharing their raw QoS records. This creates a dual challenge: achieving high prediction accuracy while preserving data privacy in sparse environments. To address these challenges, we propose DPIS-GNN, a novel framework that integrates ε-Differential Privacy (ε-DP) with subgraph-inductive Graph Neural Networks (GNNs). Our approach first applies ε-DP mechanisms to obfuscate local datasets, protecting sensitive user information. These perturbed datasets are then aggregated into a unified interaction graph, from which relevant patterns are inferred. Next, we introduce a subgraph-based GNN that inductively learns from the noisy and sparse data to produce accurate QoS predictions. Extensive experiments on real-world datasets demonstrate the effectiveness of our approach. DPIS-GNN achieves up to a 17.55% reduction in Mean Absolute Error (MAE) and a 9.77% decrease in Root Mean Square Error (RMSE), outperforming state-of-the-art baselines. Our model exhibits superior robustness in sparse and cold-start scenarios, offering both strong privacy protection and high predictive performance.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.