基于交格的高效用敏感关联规则隐藏算法

V. Trieu, Chau Truong Ngoc, H. L. Quoc, N. N. Si
{"title":"基于交格的高效用敏感关联规则隐藏算法","authors":"V. Trieu, Chau Truong Ngoc, H. L. Quoc, N. N. Si","doi":"10.1109/MAPR.2018.8337512","DOIUrl":null,"url":null,"abstract":"Hiding high utility sensitive association rule is an essential problem for preserving privacy knowledge from being revealed while sharing data outside the parties. However, this problem has not been considered thoughtfully. This paper aims to propose a novel strategy for hiding high utility sensitive association rules based on intersection lattice. The strategy includes two steps: (i) The transactions containing the sensitive rule and having the least utility are selected as victim transactions; (ii) The victim items are specified based on a heuristic in such a way that modifying them causes the least impact on lattice of high transaction weighted utility itemsets. Relying on those steps, the algorithm named HHUARL for hiding high utility sensitive association rules is proposed. The expriment shows that side effects caused by HHUARL algorithm is acceptable.","PeriodicalId":117354,"journal":{"name":"International Conference on Multimedia Analysis and Pattern Recognition","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithm for Hiding High Utility Sensitive Association Rule Based on Intersection Lattice\",\"authors\":\"V. Trieu, Chau Truong Ngoc, H. L. Quoc, N. N. Si\",\"doi\":\"10.1109/MAPR.2018.8337512\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hiding high utility sensitive association rule is an essential problem for preserving privacy knowledge from being revealed while sharing data outside the parties. However, this problem has not been considered thoughtfully. This paper aims to propose a novel strategy for hiding high utility sensitive association rules based on intersection lattice. The strategy includes two steps: (i) The transactions containing the sensitive rule and having the least utility are selected as victim transactions; (ii) The victim items are specified based on a heuristic in such a way that modifying them causes the least impact on lattice of high transaction weighted utility itemsets. Relying on those steps, the algorithm named HHUARL for hiding high utility sensitive association rules is proposed. The expriment shows that side effects caused by HHUARL algorithm is acceptable.\",\"PeriodicalId\":117354,\"journal\":{\"name\":\"International Conference on Multimedia Analysis and Pattern Recognition\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Multimedia Analysis and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MAPR.2018.8337512\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Multimedia Analysis and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MAPR.2018.8337512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

隐藏高效用敏感关联规则是在各方共享数据的同时保护隐私知识不被泄露的关键问题。然而,这个问题并没有得到深思熟虑的考虑。提出了一种基于交格的高效用敏感关联规则隐藏策略。该策略包括两个步骤:(i)选择包含敏感规则且效用最小的交易作为受害交易;(ii)受害项目是基于启发式指定的,这样修改它们对高交易加权实用项目集的格的影响最小。在此基础上,提出了基于HHUARL的高效用敏感关联规则隐藏算法。实验表明,HHUARL算法产生的副作用是可以接受的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Algorithm for Hiding High Utility Sensitive Association Rule Based on Intersection Lattice
Hiding high utility sensitive association rule is an essential problem for preserving privacy knowledge from being revealed while sharing data outside the parties. However, this problem has not been considered thoughtfully. This paper aims to propose a novel strategy for hiding high utility sensitive association rules based on intersection lattice. The strategy includes two steps: (i) The transactions containing the sensitive rule and having the least utility are selected as victim transactions; (ii) The victim items are specified based on a heuristic in such a way that modifying them causes the least impact on lattice of high transaction weighted utility itemsets. Relying on those steps, the algorithm named HHUARL for hiding high utility sensitive association rules is proposed. The expriment shows that side effects caused by HHUARL algorithm is acceptable.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Algorithm for Hiding High Utility Sensitive Association Rule Based on Intersection Lattice Multivariate Filter for Saliency
×
引用
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