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

一种改进的隐私保护关联规则挖掘算法
引用本文:顾铖,朱保平,张金康.一种改进的隐私保护关联规则挖掘算法[J].南京航空航天大学学报,2015,47(1):119-124.
作者姓名:顾铖  朱保平  张金康
作者单位:南京理工大学计算机科学与工程学院
摘    要:部分隐藏的随机化回答方法是基于关联规则数据挖掘的隐私保护算法,针对该算法在重构频繁项集支持度上的指数级时间复杂度导致算法执行效率下降的不足,采用分治策略和集合运算方法对该算法进行改进,消除重构数据的指数级运算。改进算法降低了算法的时间复杂度并有效提高了执行效率。仿真实验与分析表明了改进算法的有效性。

关 键 词:关联规则  隐私保护  分治策略  集合运算

Improved Algorithm of Privacy Preserving Association Rule Mining
Gu Cheng;Zhu Baoping;Zhang Jinkang.Improved Algorithm of Privacy Preserving Association Rule Mining[J].Journal of Nanjing University of Aeronautics & Astronautics,2015,47(1):119-124.
Authors:Gu Cheng;Zhu Baoping;Zhang Jinkang
Institution:Gu Cheng;Zhu Baoping;Zhang Jinkang;School of Computer Science and Engineering,Nanjing University of Science and Technology;
Abstract:Randomized response with partial hiding is a privacy preservation algorithm based on association rule mining. For the insufficient that the exponential time complexity of the algorithm in the reconstruction of frequent item set support reduces the execution efficiency of the algorithm, the divide and conquer strategy and the set operations are used to improve the algorithm, and the exponential computation in the reconstruction is eliminated. The improved algorithm can reduce the time complexity and promote the efficiency effectively. Experiments and analysis indicate the effectiveness of the improved algorithm.
Keywords:association rules  privacy preservation  divide and conquer strategy  set operations
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《南京航空航天大学学报》浏览原始摘要信息
点击此处可从《南京航空航天大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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