|
|||||
|
|
| 基于取整划分函数的k 匿名算法 | |
| 引用本文： | 吴英杰,唐庆明,倪巍伟,孙志挥.基于取整划分函数的k 匿名算法[J].软件学报,2012,23(8):2138-2148. |
| 作者姓名： | 吴英杰 唐庆明 倪巍伟 孙志挥 |
| 作者单位： | 1. 福州大学数学与计算机科学学院,福建福州350108;东南大学计算机科学与工程学院,江苏南京210096;网络系统信息安全福建省高校重点实验室(福州大学),福建福州350108 2. 福州大学数学与计算机科学学院,福建福州,350108 3. 东南大学计算机科学与工程学院,江苏南京,210096 |
| 基金项目： | 国家自然科学基金，福建省自然科学基金 |
| 摘 要： | 提出一种基于取整划分函数的k匿名算法,并从理论上证明该算法在非平凡的数据集中可以取得更低的上界.特别地,当数据集大于2k2时,该算法产生的匿名化数据的匿名组规模的上界为k+1；而当待发布数据表足够大时,算法所生成的所有匿名组的平均规模将足够趋近于k.仿真实验结果表明,该算法是有效而可行的. |
| 关 键 词： | 隐私保护 数据发布 k匿名算法 取整划分函数 匿名组规模上界 |
| 收稿时间： | 2011/1/15 0:00:00 |
| 修稿时间： | 2011/11/2 0:00:00 |
Algorithm for k-Anonymity Based on Rounded Partition Function |
|
| WU Ying-Jie,TANG Qing-Ming,NI Wei-Wei and SUN Zhi-Hui.Algorithm for k-Anonymity Based on Rounded Partition Function[J].Journal of Software,2012,23(8):2138-2148. | |
| Authors: | WU Ying-Jie TANG Qing-Ming NI Wei-Wei and SUN Zhi-Hui |
| Affiliation: | 1(College of Mathematics and Computer Science,Fuzhou University,Fuzhou 350108,China) 2(College of Computer Science and Engineering,Southeast University,Nanjing 210096,China) 3(Key Laboratory of Network System Information Security(Fuzhou University),Department of Education of Fujian Province,Fuzhou 350108,China) |
| Abstract: | This paper proposes an algorithm based on rounded partition function for k-anonymity.By rigorous theoretical proof,the study will show that a better upper bound on size of the anonymization groups can be obtained in non-trivial data sets.In particular,when the size of the original dataset is greater than 2k2,the upper bound will be reduced to k+\.Further,the average size of all anonymization groups of the anonymous data will be close enough to k when the size of the original dataset is large enough.Experimental results on real datasets show that this algorithm is effective and feasible. |
| Keywords: | privacy preservation data publishing algorithm for k-anonymity rounded partition function upper bound on size of anonymization group |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《软件学报》浏览原始摘要信息 | |
| 点击此处可从《软件学报》下载全文 | |