首站-论文投稿智能助手
典型文献
Plausible Heterogeneous Graph k-Anonymization for Social Networks
文献摘要:
The inefficient utilization of ubiquitous graph data with combinatorial structures necessitates graph embedding methods,aiming at learning a continuous vector space for the graph which is amenable to be adopted in traditional machine learning algorithms in favor of vector representations.Graph embedding methods build an important bridge between social network analysis and data analytics as social networks naturally generate an unprecedented volume of graph data continuously.Publishing social network data not only bring benefit for public health,disaster response,commercial promotion,and many other applications,but also give birth to threats that jeopardize each individual's privacy and security.Unfortunately,most existing works in publishing social graph embedding data only focus on preserving social graph structure with less attention paid to the privacy issues inherited from social networks.To be specific,attackers can infer the presence of a sensitive relationship between two individuals by training a predictive model with the exposed social network embedding.In this paper,we propose a novel link-privacy preserved graph embedding framework using adversarial learning,which can reduce adversary's prediction accuracy on sensitive links while persevering sufficient non-sensitive information such as graph topology and node attributes in graph embedding.Extensive experiments are conducted to evaluate the proposed framework using ground truth social network datasets.
文献关键词:
作者姓名:
Kaiyang Li;Ling Tian;Xu Zheng;Bei Hui
作者机构:
School of Computer Science and Engineering,University of Electronic Science and Technology of China,Chengdu 611731,China;Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province,Chengdu 610000,China;School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu 610054, China
引用格式:
[1]Kaiyang Li;Ling Tian;Xu Zheng;Bei Hui-.Plausible Heterogeneous Graph k-Anonymization for Social Networks)[J].清华大学学报自然科学版(英文版),2022(06):912-924
A类:
Plausible,Anonymization,persevering
B类:
Heterogeneous,Graph,Social,Networks,inefficient,utilization,ubiquitous,graph,combinatorial,structures,necessitates,embedding,methods,aiming,learning,vector,space,which,amenable,adopted,traditional,machine,algorithms,favor,representations,build,important,bridge,between,social,analysis,analytics,networks,naturally,generate,unprecedented,volume,continuously,Publishing,not,only,bring,benefit,public,health,disaster,response,commercial,promotion,many,other,applications,also,give,birth,threats,that,jeopardize,each,privacy,security,Unfortunately,most,existing,publishing,focus,preserving,less,attention,paid,issues,inherited,from,To,specific,attackers,can,infer,presence,sensitive,relationship,individuals,by,training,predictive,model,exposed,In,this,paper,novel,preserved,framework,using,adversarial,reduce,adversary,prediction,accuracy,links,while,sufficient,information,such,topology,node,attributes,Extensive,experiments,are,conducted,evaluate,proposed,ground,truth,datasets
AB值:
0.607776
相似文献
机标中图分类号,由域田数据科技根据网络公开资料自动分析生成,仅供学习研究参考。