期刊文献+

基于谱聚类的社交网络差分隐私保护算法研究 被引量:4

A differential privacy protection algorithm in social network based on spectral clustering
下载PDF
导出
摘要 针对权重社交网络差分隐私保护算法中噪声添加量过大以及隐私保护不均衡问题,提出了一种结合谱聚类算法与差分隐私保护模型的隐私保护算法SCDP。首先针对传统差分隐私保护算法直接向社交网络边权重添加噪声方式带来的噪声添加量过大的问题,结合谱聚类算法,将权重社交网络聚类成为不同的簇,对不同的簇采取随机添加噪声的方式,降低噪声的添加量,提高数据的可用性;其次设计新的隐私预算参数,根据社交网络边权重的大小决定噪声的添加量,实现更均衡的隐私保护;最后通过理论推导和实验证明了SCDP算法处理后的数据可用性更高。 Aiming at the problems of excessive noise addition and unbalanced privacy protection in the differential privacy protection algorithm of weighted social networks,a privacy protection algorithm combining spectral clustering algorithm and differential privacy protection model is proposed.Firstly,to solve the problem of excessive noise addition caused by the way of directly adding noise to the side weights of social networks by traditional differential privacy protection algorithms,combined with the spectral clustering algorithm,the weighted social networks are clustered into different clusters,and different clusters are randomly selected.The method of adding noise reduces the amount of noise added and improves the availability of data.Secondly,new privacy budget parameters are designed,and the amount of noise added is determined according to the weight of the social network side,so as to achieve a more balanced privacy protection.Finally,theoretical derivation and experiments prove that the data processed by the proposed algorithm have higher availability.
作者 袁泉 晏飞扬 文志云 张振康 YUAN Quan;YAN Fei-yang;WEN Zhi-yun;ZHANG Zhen-kang(School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065;Research Center of New Telecommunication Technology Applications,Chongqing University of Posts and Telecommunications,Chongqing 400065;Chongqing Information Technology Designing Co.,LTD.,Chongqing 401121,China)
出处 《计算机工程与科学》 CSCD 北大核心 2022年第2期251-256,共6页 Computer Engineering & Science
关键词 权重社交网络 差分隐私 谱聚类 weighted social network differential privacy spectral clustering
  • 相关文献

参考文献3

二级参考文献69

  • 1Jain A, Murty M, Flynn P. Data clustering.. A Review[J]. ACM Computing Surveys, 1999,31 (3) : 264-323.
  • 2Fiedler M. Algebraic connectivity of graphs. Czech, Math. J. , 1973,23: 298-305.
  • 3Malik J,Belongie S,Leung T, et al. Contour and texture analysis for image segmentation In Perceptual Organization for Artificial Vision Systems. Kluwer, 2000.
  • 4Weiss Y. Segmentation using eigenvectors: A unified view//International Conference on Computer Vision 1999.
  • 5Shi J,Malik J. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000,22 (8) : 888-905.
  • 6Wu Z, Leahy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation [J]. IEEE Trans on PAMI,1993, 15(11):1101-1113.
  • 7Hagen L, Kahng A 13. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Computer-Aided Design, 1992,11 (9) : 1074-1085.
  • 8Sarkar S, Soundararajan P. Supervised learning of large perceptual organization: Graph spectral partitioning and learning automata. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2000,22(5) : 504- 525.
  • 9Ding C, He X, Zha H, et al. Spectral Min Max cut for Graph Partitioning and Data Clustering[C]//Proc. of the IEEE Intl Conf. on Data Mining. 2001 : 107-114.
  • 10Meila M , Xu L. Multiway cuts and spectral clustering. U. Washington Tech Report. 2003.

共引文献219

同被引文献54

引证文献4

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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