谱半径和特征显著性约束的随机化社会网络方法  

Random method of social network based on spectral spectrum and feature significant constraints

作　　者：许黎明[1] 强小强[1] 宋转[1] 

机构地区：[1]浙江师范大学数理与信息工程学院,浙江金华321004

出　　处：《计算机应用》2012年第2期485-488,共4页journal of Computer Applications

摘　　要：为了保护社会网络的安全性,保证扰动后社会网络的可用性,提出谱半径和特征显著性(非随机化性)约束的多点扰动社会网络的方法。在扰动社会网络过程中,将社会网络的谱半径和特征显著性控制在一定的约束范围内,从而在保证扰动后社会网络的可用性同时,提高扰动后社会网络的隐私保护程度。理论上分析了该方法的安全性更好,并给出相应的算法。最后通过实验比较随机化后社会网络的调和平均最短距离、传递系数和特征显著性结构性质的变化情况,表明该方法能有效地保护社会网络的结构性质,提高扰动后的可用性。To protect the security of social network, ensure the availability of social network after perturbation, the paper proposed perturbation method of social network based on the signless Laplacian matrix and the social network non-randomness. In the perturbation process, this method controlled the social network spectral radius and the social network non-randomness by certain constraints, thus ensuring the usability and improving the privacy protection degree of the social network. The paper analyzed the security of this method in theory, and provided corresponding algorithm. At last, the experimental results on comparison of harmonic mean of the shortest distance of the social network, subgraph centrality and the social network nonrandomness of change, show that the proposed method effectively protects the structural feature of social network and improving the availability of the social network.

关 键 词：社会网络 匿名化 谱半径 无符号拉普拉斯矩阵 社会网络的特征显著性 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]