基于事务分离的差分隐私频繁项集挖掘方法  

Differential privacy frequent itemset mining method based on transaction separation

作　　者：丁苏凡 曾尚琦 田冬艳 DING Su-fan;ZENG Shang-qi;TIAN Dong-yan(School of Information and Control Engineering,China University of Mining and Technology,Xuzhou 221000,China;NARI Group Corporation/Station Grid Electric Power Research Institute,NARI Technology Development Limited Company,Nanjing 211000,China)

机构地区：[1]中国矿业大学信息与控制工程学院,江苏徐州221000 [2]国电南瑞科技股份有限公司国网电力科学研究院,江苏南京211000

出　　处：《计算机工程与设计》2023年第1期45-51,共7页Computer Engineering and Design

基　　金：国家重点研发计划基金项目(2018YFC0808302)。

摘　　要：频繁项集挖掘在加入差分隐私后将带来敏感度过高、噪声过大、数据可用性较差的问题。为了解决这些问题,提出了基于事务分离的差分隐私频繁项集挖掘方法。利用指数机制对事务最大限制长度进行筛选,将长事务分离成为多个短事务,以此降低全局敏感度并避免截断误差的产生。在数据挖掘过程中,采用Apriori算法挖掘频繁项集,利用双阈值进行项集判断以及修正支持度,减小传输误差的产生和噪音。实验结果表明,该方法满足差分隐私的要求,可有效提高数据可用性。After adding differential privacy,frequent itemset mining will bring problems such as high sensitivity,excessive noise and poor data usability.In order to solve these problems,a transaction separation based differential privacy frequent itemsets mining method is proposed.Using the index mechanism to filter the maximum transaction length and separate the long transaction into multiple short transactions to reduce the global sensitivity and avoid the truncation error.Firstly,the Apriori algorithm is used to mine frequent itemsets.Secondly,the dual threshold is used to judge itemsets and correct support,so as to reduce transmission error and noise.Experimental results show that this method meets the requirements of differential privacy and improves the data availability effectively.

关 键 词：频繁项集挖掘 ε-差分隐私 事务分离 双阈值 支持度修正 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]