在关联规则挖掘中,使用EMO通过添加项来保护敏感知识

Peng Cheng, Jeng-Shyang Pan
{"title":"在关联规则挖掘中,使用EMO通过添加项来保护敏感知识","authors":"Peng Cheng, Jeng-Shyang Pan","doi":"10.1145/2598394.2598465","DOIUrl":null,"url":null,"abstract":"When data is released or shared among different organizations, some sensitive or confidential information may be subject to be exposed by using data mining tools. Thus, a question arises: how can we protect sensitive knowledge while allowing other parties to extract the knowledge behind the shared data. In this paper, we address the problem of privacy preserving in association rule mining from the perspective of multi-objective optimization. A sensitive rule can be hidden by adding items into the dataset to make the support of the antecedent part of the sensitive rule increase and accordingly the confidence of the sensitive rule decrease. The evolutionary multi-objective optimization (EMO) algorithm is utilized to find suitable transactions (or tuples) to be modified so as the side effects to be minimized. Experiments on real datasets demonstrated the effectiveness of the proposed method.","PeriodicalId":298232,"journal":{"name":"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Use EMO to protect sensitive knowledge in association rule mining by adding items\",\"authors\":\"Peng Cheng, Jeng-Shyang Pan\",\"doi\":\"10.1145/2598394.2598465\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When data is released or shared among different organizations, some sensitive or confidential information may be subject to be exposed by using data mining tools. Thus, a question arises: how can we protect sensitive knowledge while allowing other parties to extract the knowledge behind the shared data. In this paper, we address the problem of privacy preserving in association rule mining from the perspective of multi-objective optimization. A sensitive rule can be hidden by adding items into the dataset to make the support of the antecedent part of the sensitive rule increase and accordingly the confidence of the sensitive rule decrease. The evolutionary multi-objective optimization (EMO) algorithm is utilized to find suitable transactions (or tuples) to be modified so as the side effects to be minimized. Experiments on real datasets demonstrated the effectiveness of the proposed method.\",\"PeriodicalId\":298232,\"journal\":{\"name\":\"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2598394.2598465\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2598394.2598465","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

当数据在不同的组织之间发布或共享时,使用数据挖掘工具可能会暴露一些敏感或机密信息。因此,出现了一个问题:我们如何在允许其他方提取共享数据背后的知识的同时保护敏感知识。本文从多目标优化的角度研究了关联规则挖掘中的隐私保护问题。通过在数据集中添加项来隐藏敏感规则,可以使敏感规则的先行部分的支持度增加,从而降低敏感规则的置信度。采用进化多目标优化(EMO)算法寻找合适的事务(或元组)进行修改,使副作用最小化。在实际数据集上的实验证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Use EMO to protect sensitive knowledge in association rule mining by adding items
When data is released or shared among different organizations, some sensitive or confidential information may be subject to be exposed by using data mining tools. Thus, a question arises: how can we protect sensitive knowledge while allowing other parties to extract the knowledge behind the shared data. In this paper, we address the problem of privacy preserving in association rule mining from the perspective of multi-objective optimization. A sensitive rule can be hidden by adding items into the dataset to make the support of the antecedent part of the sensitive rule increase and accordingly the confidence of the sensitive rule decrease. The evolutionary multi-objective optimization (EMO) algorithm is utilized to find suitable transactions (or tuples) to be modified so as the side effects to be minimized. Experiments on real datasets demonstrated the effectiveness of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolutionary synthesis of dynamical systems: the past, current, and future Incremental evolution of HERCL programs for robust control Selecting evolutionary operators using reinforcement learning: initial explorations Flood evolution: changing the evolutionary substrate from a path of stepping stones to a field of rocks Artificial immune systems for optimisation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1