利用改进的遗传算法隐藏敏感关联规则:按需添加字幕(论文字幕)

Janki Patel, Priyanka J. Shah
{"title":"利用改进的遗传算法隐藏敏感关联规则:按需添加字幕(论文字幕)","authors":"Janki Patel, Priyanka J. Shah","doi":"10.1109/ICOEI.2019.8862644","DOIUrl":null,"url":null,"abstract":"Association Rule Hiding is the Data Mining method which is used for extracting hidden information from huge dataset. In our paper, Two approaches are introduced. In first approach FP Growth Algorithm is being presented that generate association rules efficiently and it reduces time of forming frequent item sets every time. In second approach we have tried to hide sensitive association rules by Genetic Algorithm. Generally from large databases frequent items are extracted by applying different algorithms. In this paper, we compare all the algorithms for extracting frequent items which are Association Rule Mining, Apriori Algorithm and FP growth Algorithm. We also compare Fuzzy Logic Algorithms and Genetic Algorithm for hiding sensitive association rules.","PeriodicalId":212501,"journal":{"name":"2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Hiding Sensitive Association Rules Using Modified Genetic Algorithm: Subtitle as needed (paper subtitle)\",\"authors\":\"Janki Patel, Priyanka J. Shah\",\"doi\":\"10.1109/ICOEI.2019.8862644\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Association Rule Hiding is the Data Mining method which is used for extracting hidden information from huge dataset. In our paper, Two approaches are introduced. In first approach FP Growth Algorithm is being presented that generate association rules efficiently and it reduces time of forming frequent item sets every time. In second approach we have tried to hide sensitive association rules by Genetic Algorithm. Generally from large databases frequent items are extracted by applying different algorithms. In this paper, we compare all the algorithms for extracting frequent items which are Association Rule Mining, Apriori Algorithm and FP growth Algorithm. We also compare Fuzzy Logic Algorithms and Genetic Algorithm for hiding sensitive association rules.\",\"PeriodicalId\":212501,\"journal\":{\"name\":\"2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOEI.2019.8862644\",\"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 3rd International Conference on Trends in Electronics and Informatics (ICOEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOEI.2019.8862644","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

关联规则隐藏是一种用于从海量数据集中提取隐藏信息的数据挖掘方法。本文介绍了两种方法。第一种方法提出了一种高效生成关联规则的FP生长算法,减少了每次生成频繁项集的时间。第二种方法是利用遗传算法隐藏敏感的关联规则。一般来说,从大型数据库中提取频繁项需要采用不同的算法。在本文中,我们比较了关联规则挖掘、Apriori算法和FP生长算法这三种提取频繁项的算法。我们还比较了模糊逻辑算法和遗传算法对敏感关联规则隐藏的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hiding Sensitive Association Rules Using Modified Genetic Algorithm: Subtitle as needed (paper subtitle)
Association Rule Hiding is the Data Mining method which is used for extracting hidden information from huge dataset. In our paper, Two approaches are introduced. In first approach FP Growth Algorithm is being presented that generate association rules efficiently and it reduces time of forming frequent item sets every time. In second approach we have tried to hide sensitive association rules by Genetic Algorithm. Generally from large databases frequent items are extracted by applying different algorithms. In this paper, we compare all the algorithms for extracting frequent items which are Association Rule Mining, Apriori Algorithm and FP growth Algorithm. We also compare Fuzzy Logic Algorithms and Genetic Algorithm for hiding sensitive association rules.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信