首页 | 本学科首页   官方微博 | 高级检索  
     

基于贪心扰动的社交网络隐私保护研究
引用本文:刘华玲,郑建国,孙辞海. 基于贪心扰动的社交网络隐私保护研究[J]. 电子学报, 2013, 41(8): 1586-1591. DOI: 10.3969/j.issn.0372-2112.2013.08.021
作者姓名:刘华玲  郑建国  孙辞海
作者单位:1. 上海对外经贸大学商务信息学院, 上海 201620;2. 东华大学旭日管理学院, 上海 200051
基金项目:国家自然科学基金(No .7091020);上海市高等教育内涵建设工程“085工程”
摘    要:在社交网络的数据挖掘隐私保护问题中,连接边的权重和权重的隐私保护问题是非常重要的.为此,提出一种贪心扰动的隐私保护算法,以保证社交网络初始的最短路径不变并使其长度与扰动后相接近.仿真模拟计算结果表明,这种扰乱策略符合预期的理论分析结果.

关 键 词:数据挖掘  社交网络  隐私保护  贪心扰动算法  
收稿时间:2012-06-09

Privacy Preserving in Social Networks Based on Greedy Perturbation
LIU Hua-ling , ZHENG Jian-guo , SUN Ci-hai. Privacy Preserving in Social Networks Based on Greedy Perturbation[J]. Acta Electronica Sinica, 2013, 41(8): 1586-1591. DOI: 10.3969/j.issn.0372-2112.2013.08.021
Authors:LIU Hua-ling    ZHENG Jian-guo    SUN Ci-hai
Affiliation:1. Business Information Management School, Shanghai University of International Business and Economics, Shanghai 201620, China;2. Glorious Sun School of Business and Management, Donghua University, Shanghai 201620, China
Abstract:For the privacy preserving problem in the data mining technology of the social networks,weights of the connected edge of the networking and their preserving is very important.We develop a privacy preserving strategy based on data perturbation algorithm.The strategy applies the greedy perturbation algorithm to perturb edge weighs so that the shortest path of the network can be kept,and its length can be similar with that of the original one.The results of simulation calculation show that the perturbation strategy can march with the expected theoretical analysis results.
Keywords:data mining  social network  privacy preserving  greedy perturbation algorithm
本文献已被 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号