基于k-subgraph算法的社交网络隐私保护研究  

Research of Privacy Protection for Personal Information of Social Network Service Based on K-subgraph Algorithm

作　　者：宋喜忠[1] 刘康明[1] 

机构地区：[1]黄淮学院信息工程学院,河南驻马店463000

出　　处：《科技通报》2015年第7期119-121,125,共4页Bulletin of Science and Technology

基　　金：河南省科技攻关项目(No.122102210510);河南省教育厅科技攻关项目(No.13A520786)

摘　　要：针对社交网络隐私保护问题,本文提出一种新的隐私保护方法——k-subgraph划分算法,它通过对社交网络进行分割,通过泛化顶点标签和扰乱图的结构特征,来对社交网络进行匿名化处理,拟达到隐私保护的目的。仿真实验表明,该方法可以有效的保护社交网络中个体的隐私信息,同时保证了社交网络中匿名数据的可用性。In view of the social network privacy protection issues, this paper proposes a new privacy protection method- k- subgraph division rules, it through the social network segmentation, through generalization vertex labels and disrupt the figure structure characteristics, come to anonymize the social network, is proposed to achieve the purpose of privacy protection;Simulation experiments show that this method can offer in a network of individual privacy protection, anonymous social network at the same time also can guarantee availability.

关 键 词：社交网络 隐私保护 泛化 数据发布 信息损失 

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