Differentially private adaptive noise for graph neural network in online social networks

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Changsong Yang , Tiantian Zhu , Yueling Liu , Yong Ding , Zhen Liu
{"title":"Differentially private adaptive noise for graph neural network in online social networks","authors":"Changsong Yang ,&nbsp;Tiantian Zhu ,&nbsp;Yueling Liu ,&nbsp;Yong Ding ,&nbsp;Zhen Liu","doi":"10.1016/j.comnet.2025.111757","DOIUrl":null,"url":null,"abstract":"<div><div>Online Social Networks (OSNs) have become a significant domain for studying social behaviors and information dissemination due to their unique user interactions and relational structures. These graph-structured data contain important information, and in-depth research on such data can effectively mine users’ social influence, thereby promoting the study of social applications such as information dissemination, behavior prediction, and social recommendation. Graph Neural Network (GNN) have demonstrated superior performance compared to traditional neural networks in multiple domains due to their advantages in handling graph-structured data. However, the inherent node-link structure in graph data makes privacy leakage an urgent issue to be addressed. In response to privacy protection issues in online social networks, w·e propose an adaptive differential privacy noise GNN scheme. This scheme can dynamically adjust the noise value introduced at each iteration based on historical and current model parameters, ensuring that the model meets differential privacy requirements while minimizing the impact on model accuracy. Through empirical experiments on multiple real-world datasets, this method maintains high accuracy under different privacy budgets. Even when the privacy budget <span><math><mrow><mi>ϵ</mi><mo>=</mo><mn>2</mn></mrow></math></span>, compared to the GAP algorithm and the baseline model based on Multilayer Perceptron (MLP), the model still achieved a 2.07 <span><math><mo>%</mo></math></span> increase in average accuracy, providing a superior trade-off between privacy and accuracy under a range of privacy protection requirements.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"273 ","pages":"Article 111757"},"PeriodicalIF":4.6000,"publicationDate":"2025-10-06","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/S1389128625007236","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Online Social Networks (OSNs) have become a significant domain for studying social behaviors and information dissemination due to their unique user interactions and relational structures. These graph-structured data contain important information, and in-depth research on such data can effectively mine users’ social influence, thereby promoting the study of social applications such as information dissemination, behavior prediction, and social recommendation. Graph Neural Network (GNN) have demonstrated superior performance compared to traditional neural networks in multiple domains due to their advantages in handling graph-structured data. However, the inherent node-link structure in graph data makes privacy leakage an urgent issue to be addressed. In response to privacy protection issues in online social networks, w·e propose an adaptive differential privacy noise GNN scheme. This scheme can dynamically adjust the noise value introduced at each iteration based on historical and current model parameters, ensuring that the model meets differential privacy requirements while minimizing the impact on model accuracy. Through empirical experiments on multiple real-world datasets, this method maintains high accuracy under different privacy budgets. Even when the privacy budget ϵ=2, compared to the GAP algorithm and the baseline model based on Multilayer Perceptron (MLP), the model still achieved a 2.07 % increase in average accuracy, providing a superior trade-off between privacy and accuracy under a range of privacy protection requirements.
在线社交网络中图神经网络的差分私有自适应噪声
在线社交网络由于其独特的用户交互和关系结构,已成为研究社会行为和信息传播的重要领域。这些图结构数据包含重要信息,对这些数据的深入研究可以有效挖掘用户的社会影响力,从而推动信息传播、行为预测、社交推荐等社交应用的研究。由于在处理图结构数据方面的优势,图神经网络(GNN)在多个领域表现出比传统神经网络更优越的性能。然而,图数据固有的节点-链接结构使得隐私泄露成为亟待解决的问题。针对在线社交网络中的隐私保护问题,w·e提出了一种自适应差分隐私噪声GNN方案。该方案可以根据历史和当前模型参数动态调整每次迭代引入的噪声值,在保证模型满足差分隐私要求的同时,将对模型精度的影响降到最低。通过对多个真实数据集的实证实验,该方法在不同隐私预算下都保持了较高的准确率。即使隐私预算ε =2,与GAP算法和基于多层感知器(MLP)的基线模型相比,该模型的平均准确率仍然提高了2.07%,在一系列隐私保护要求下,在隐私和准确性之间提供了更好的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信