期刊文献+

一种基于随机投影的加权社会网络隐私保护方法 被引量:4

Privacy Preserving Method Based on Random Projection for Weighted Social Networks
下载PDF
导出
摘要 针对加权社会网络的发布,提出了一种基于随机投影的隐私保护方法——向量集随机投影,该方法通过对加权社会网络的结构和边权重进行干扰实现敏感信息的隐私保护。通过对加权社会网络进行分割,得到节点数相同的若干个子网络;依据边空间理论,采用由边信息构建的向量描述子网络,构建加权社会网络的向量集作为发布模型;利用随机投影技术对原始向量集进行降维操作得到目标向量集;依据目标向量集构建加权社会网络的发布集。实验结果表明,向量集随机投影方法能够在确保隐私信息安全的同时仍然保护社会网络分析所需要的某些结构特征。 A privacy preserving method based on random projection namely vectors set random projection was put forward on the publication of weighted social networks.The method protects sensitive information security through perturbing network structures and edge weights.It partitions weighted social networks into multiple sub-networks with the same number of nodes.Based on the theory of edge space,it describes the sub-networks by vectors consisted of edges information and constructs vector set of weighted social networks as the released model.It uses random projection technology for dimension reduction and maps the original vector set into the targeted vector set.It constructs the released weighted social networks based on the targeted vector set.The experimental results demonstrate that the vector set random projection method can ensure privacy information security and protect some structure characteristics of the social network analysis.
出处 《计算机科学》 CSCD 北大核心 2016年第3期151-157,178,共8页 Computer Science
基金 国家自然科学基金项目(61003288 61111130184) 国家教育部博士点基金资助项目(20093227110005) 江苏省普通高校研究生科研创新计划项目(CX10B_006X)资助
关键词 社会网络 隐私保护 降维 随机投影 向量集 Social networks Privacy preserving Dimension reduction Random projection Vectors set
  • 相关文献

参考文献1

二级参考文献15

  • 1C C Aggarwal,P S Yu. A General Survey of Privacy-preserv-ing Data Mining Models and Algorithms[M].NewYork:Springer US,2008.11-52.
  • 2L Sweeney. K-anonymity:A model for protecting privacy[J].International Journal of Uncertainty Fuzziness and Knowledge-Based Systems,2002,(05):557-570.
  • 3S Lee,M G Genton,R B Arellano-Valle. Perturbation of nu-merical confidential data via skew-t distributions[J].Manage-ment Science,2010,(02):318-333.
  • 4K K Chen,L Liu. Geometric data perturbation for privacy pre-serving outsourced data mining[J].Knowledge and Information Systems,2011,(03):657-695.
  • 5C C Aggarwal. On randomization,public information and the curse of dimensionality[A].Istanbul:IEEE,2007.136-145.
  • 6K Liu,H Kargupta,J Ryan. Random projection-based multi-plicative data perturbation for privacy preserving distributed data mining[J].IEEE Transactions on Knowledge and Data Engineering,2006,(01):92-106.doi:10.1109/TKDE.2006.14.
  • 7C C Aggarwal,P S Yu. On privacy-preservation of text and sparse binary data with sketches[A].Minnesota:SIAM,2007.57-67.
  • 8Y Sang,H Shen,H Tian. Reconstructing data perturbed by random projections when the mixing matrix is known[A].Beilin:Springer-Verlag,2009.334-349.
  • 9W B Johnson,J Lindenstrauss. Extensions of lipschitz map-pings into a hilbert space[J].Contemporary Mathematics,1984.189-206.
  • 10P Anna,P Rasmus. Uniform hashing in constant time and op-timal space[J].SIAM Journal on Computing,2008,(01):85-96.doi:10.1137/060658400.

共引文献19

同被引文献24

引证文献4

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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