频繁项集挖掘的隐私保护算法

Bo Peng, Xian Li, Wei Cui
{"title":"频繁项集挖掘的隐私保护算法","authors":"Bo Peng, Xian Li, Wei Cui","doi":"10.1109/ICPDS47662.2019.9017193","DOIUrl":null,"url":null,"abstract":"A differentially private frequent itemset mining algorithm DP-FMA is proposed for privacy protection of frequent itemset mining. The existing algorithms have great damage to the data. In order to solve this problem, DP-FMA is based on the real frequent itemset to mine the frequent itemset with noise, so that the support of frequent itemset will not decrease, and the availability of mining results will be improved. Aiming at the problem of inconsistency between the support with noise and the real support for mining in existing algorithms, a consistent constraint strategy is proposed, which makes the mining support with noise in descending order of integer and ultimately improves the accuracy of mining results. Finally, theoretical analysis is used to prove the differential privacy and availability of the algorithm. The experimental comparison proves the high availability and high accuracy of the algorithm.","PeriodicalId":130202,"journal":{"name":"2019 IEEE International Conference on Power Data Science (ICPDS)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Privacy Protection Algorithm for Frequent Itemset Mining\",\"authors\":\"Bo Peng, Xian Li, Wei Cui\",\"doi\":\"10.1109/ICPDS47662.2019.9017193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A differentially private frequent itemset mining algorithm DP-FMA is proposed for privacy protection of frequent itemset mining. The existing algorithms have great damage to the data. In order to solve this problem, DP-FMA is based on the real frequent itemset to mine the frequent itemset with noise, so that the support of frequent itemset will not decrease, and the availability of mining results will be improved. Aiming at the problem of inconsistency between the support with noise and the real support for mining in existing algorithms, a consistent constraint strategy is proposed, which makes the mining support with noise in descending order of integer and ultimately improves the accuracy of mining results. Finally, theoretical analysis is used to prove the differential privacy and availability of the algorithm. The experimental comparison proves the high availability and high accuracy of the algorithm.\",\"PeriodicalId\":130202,\"journal\":{\"name\":\"2019 IEEE International Conference on Power Data Science (ICPDS)\",\"volume\":\"116 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Conference on Power Data Science (ICPDS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPDS47662.2019.9017193\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Power Data Science (ICPDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPDS47662.2019.9017193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

针对频繁项集挖掘的隐私保护问题,提出了差分私有频繁项集挖掘算法DP-FMA。现有的算法对数据的破坏很大。为了解决这一问题,DP-FMA在真实频繁项集的基础上对含噪声的频繁项集进行挖掘,使频繁项集的支持度不降低,提高了挖掘结果的可用性。针对现有算法中含有噪声的挖掘支持与真实挖掘支持不一致的问题,提出了一种一致性约束策略,使含有噪声的挖掘支持按整数降序排列,最终提高了挖掘结果的准确性。最后,通过理论分析证明了该算法的差分隐私性和可用性。实验结果表明,该算法具有较高的可用性和准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Privacy Protection Algorithm for Frequent Itemset Mining
A differentially private frequent itemset mining algorithm DP-FMA is proposed for privacy protection of frequent itemset mining. The existing algorithms have great damage to the data. In order to solve this problem, DP-FMA is based on the real frequent itemset to mine the frequent itemset with noise, so that the support of frequent itemset will not decrease, and the availability of mining results will be improved. Aiming at the problem of inconsistency between the support with noise and the real support for mining in existing algorithms, a consistent constraint strategy is proposed, which makes the mining support with noise in descending order of integer and ultimately improves the accuracy of mining results. Finally, theoretical analysis is used to prove the differential privacy and availability of the algorithm. The experimental comparison proves the high availability and high accuracy of the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信