| 基于OLA的K匿名算法的改进 |
| |
| 引用本文： | 胡翔天,宫秀军,陈海亮. 基于OLA的K匿名算法的改进[J]. 微型机与应用, 2011, 30(22): 68-71 |
| |
| 作者姓名： | 胡翔天 宫秀军 陈海亮 |
| |
| 作者单位： | 天津大学计算机科学与技术学院,天津,300072 |
| |
| 摘 要： | 主要对数据匿名化中的一种重要方法K-匿名进行了研究和分析,重点对K匿名算法中的一种较高效的算法最优泛化格OLA(Optimal Lattice Anomy-zation)进行了介绍,并针对OLA为取得最优结果计算节点过多、时间过长的问题进行了进一步研究,在OLA算法的基础上提出一种基于节点度积优先(度积为父节点数与子节点数的乘积)的算法,该算法相较于OLA,需要计算的节点数和时间都显著减少,对OLA算法有明显的改进。
|
| 关 键 词： | K匿名 最优泛化格 数据匿名化 |
Enhaning method based on OLA K-anoymity alogrithm |
| |
| Hu Xiangtian,Gong Xiujun,Chen Hailiang. Enhaning method based on OLA K-anoymity alogrithm[J]. Microcomputer & its Applications, 2011, 30(22): 68-71 |
| |
| Authors: | Hu Xiangtian Gong Xiujun Chen Hailiang |
| |
| Affiliation: | (School of Computer Science & Technology,Tianjin University,Tianjin 300072,China) |
| |
| Abstract: | Through researching and analyzing the K-anoymity,this paper focused on an efficient algorithm of the K-anoymity, named Optimal Lattice Anomy-zation（OLA）. Then analyzing the defects of the OLA,found the OLA calculates too much nodes and costing too much time.To solve these problems,this paper raised a degree product priority algorithm based on the OLA.Through the cxperiments,we found the new alogrithm had much improvement. |
| |
| Keywords: | K-anoymity OLA data anoymity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
