期刊文献+

基于谱约束的随机化社会网络多点扰动方法 被引量:6

Multi-point Disturbance Method of Randomization Society Network Based on Spectrum Constraint
下载PDF
导出
摘要 现有基于谱约束的随机化社会网络扰动方法只采用4个点的扰动,扰动后社会网络的隐私保护程度不强。为此,基于邻接矩阵及无符号拉普拉斯矩阵,提出一种多点扰动方法,在随机化过程中将社会网络的谱半径控制在一定约束范围内,能在保证扰动后社会网络可用性的同时提高其隐私保护程度。实验结果表明,该方法可以更好地保护社会网络结构。 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.
出处 《计算机工程》 CAS CSCD 北大核心 2011年第9期98-100,103,共4页 Computer Engineering
关键词 社会网络 匿名性 谱半径 邻接矩阵 无符号拉普拉斯矩阵 social network anonymous spectral radius adjacency matrix signless Laplace matrix
  • 相关文献

参考文献6

  • 1Ying Xiaowei,Wu Xiaotao.Randomizing Social Networks:A Spectrum Preserving Approach[C]//Proc.of the 8th SIAM Conference on Data Mining.Atlanta,USA:[s.n.],2008.
  • 2Ying Xiaowei,Wu Xiaotao.On Link Privacy in Randomizing Social Networks[C]//Lecture Notes in Computer Science.Berlin,Germany:Springer-Verlag,2009.
  • 3Liu Kun,Terzi E.Towards Identity Anonymization on Graphs[C]//Proc.of 2008 ACM SIGMOD International Conference on Management of Data.Vancouver,Canada:ACM Press,2008.
  • 4Cvetkovic D,Rowlinson P,Simic S.Eigenspaces of Graphs[M].Cambridge,UK:Cambridge University Press,1997.
  • 5熊中敏,黄冬梅.可多边并行移出的社团发现方法[J].计算机工程,2009,35(12):29-31. 被引量:6
  • 6Cvetkovi D,Rowlinson P.Signless Laplacians of Finite Graphs[J].Linear Algebra and Its Applications,2007,423(1):155-171.

二级参考文献5

  • 1Newman M E J, Girvan M. Finding and Evaluating Community Structure in Networks[J]. Phys. Rev. E., 2004, 69(2): 113-127.
  • 2Tyler J R, Wilkinson D M, Huberman B A. Email as Spectroscopy: Automated Discovery of Community Structure Within Organizations[C]//Proc. of the 1st Int'l Conf. on Communities and Technologies. Amsterdam, Holland: [s. n.], 2003:81-96.
  • 3Radicchi F, Castellano C, Cecconi F, et al. Defining and Identifying Communities in Networks[C]//Proc. of the National Academy of Science of USA. Rome, Italy: [s. n.], 2004: 2658-2663.
  • 4Newman M E J. Fast Algorithm for Detecting Community Structure in Networks[J]. Phys. Rev. E., 2004, 69(6): 133-137.
  • 5Newman M E J. Detecting Community Structure in Network[J]. The European Physical Journal, 2004, 38(2): 321-330.

共引文献5

同被引文献53

  • 1YING X,WU X.On link privacy in randomizing social networks[C]//PAKDD '09:Pacific-Asia Conference on Knowledge Discovery and Data Mining,LNCS 5476.Berlin:Springer-Verlag,2009:28-39.
  • 2YING X,WU X.Graph generation with prescribed feature constraints[C]// SDM '09:Proceedings of the 9th SIAM Conference on Data Mining.Sparks:SIAM,2009:966-977.
  • 3YINGX,WUX.On randomnese measures for social networks[C]//SDM '09:Proceedings of the 9th SIAM Conference on Data Mining.Sparks:SIAM,2009:709-720.
  • 4CVETKOVI D,ROWLINSON P,SIMIC S.Signless Laplacians of finite graphs[J].Linear Algebra and Its Applications,2007,423(1):155-171.
  • 5CVETKOVIC D,ROWLINSON P,SIMIC S.Eigenspaces of graphs[M].Cambridge:Cambridge University Press,1997.
  • 6BACKSTROM L,DWORK C,KLEINBERG J.Wherefore art thour3579x?:anonymized social networks,hidden patterns,and structu-ral steganography[C]//Proc of the 16th International Conference onWorld Wide Web.New York:ACM Press,2007:181-190.
  • 7YING Xiao-wei,WU Xin-tao.Randomizing social networks:a spec-trum preserving approach[C]//Proc of SIAM International Conf-erence on Data Mining.2008:739-750.
  • 8VISWANATH B,MISLOVE A,GUMMADI C M,et al.On the evo-lution of user interaction in facebook[C]//Proc of the 2nd ACMWorkshop on Online Social Networks.New York:ACM Press,2009:37-42.
  • 9ZOU Lei,CHEN Lei,ZSU M T.K-Automorphism:a generalframework for privacy preserving network publication[J].VLDB,2009,2(1):946-957.
  • 10BHAGAT S,CORMODE G.Privacy in dynamic social networks[C]//Proc of WWW 2010.Raleigh,NorthCarolina:ACM Press,2010:1059-1060.

引证文献6

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部