首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于谱约束的随机化社会网络多点扰动方法
引用本文:强小强,何小卫,韩建民,李静.基于谱约束的随机化社会网络多点扰动方法[J].计算机工程,2011,37(9):98-100,103.
作者姓名:强小强  何小卫  韩建民  李静
作者单位:浙江师范大学数理与信息工程学院,浙江,金华,321004
摘    要:现有基于谱约束的随机化社会网络扰动方法只采用4个点的扰动,扰动后社会网络的隐私保护程度不强。为此,基于邻接矩阵及无符号拉普拉斯矩阵,提出一种多点扰动方法,在随机化过程中将社会网络的谱半径控制在一定约束范围内,能在保证扰动后社会网络可用性的同时提高其隐私保护程度。实验结果表明,该方法可以更好地保护社会网络结构。

关 键 词:社会网络  匿名性  谱半径  邻接矩阵  无符号拉普拉斯矩阵

Multi-point Disturbance Method of Randomization Society Network Based on Spectrum Constraint
JIANG Xiao-qiang,HE Xiao-wei,HAN Jian-min,LI Jing.Multi-point Disturbance Method of Randomization Society Network Based on Spectrum Constraint[J].Computer Engineering,2011,37(9):98-100,103.
Authors:JIANG Xiao-qiang  HE Xiao-wei  HAN Jian-min  LI Jing
Institution:(College of Mathematics,Physics and Information Engineering,Zhejiang Normal University,Jinhua 321004,China)
Abstract:There are only four points perturbation method for the randomization society network which based on spectrum constraint,the privacy protection degree is not well after perturbation social network.To solve the problem,this paper proposes a multi-point disturbance method of randomization society network.In random process,this method is based on the adjacency matrix and signless Laplace matrix.It controls the social network spectral radius in certain within constraints,and ensures the usability and improves the privacy protection degree of the social network.Disturbance algorithm and experimental result proves that this method can better protect the social network structure.
Keywords:social network  anonymous  spectral radius  adjacency matrix  signless Laplace matrix
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号