直接使用蚁群算法挖掘关联规则,不产生频繁项集

Manju, C. Kant
{"title":"直接使用蚁群算法挖掘关联规则,不产生频繁项集","authors":"Manju, C. Kant","doi":"10.1109/ICESA.2015.7503377","DOIUrl":null,"url":null,"abstract":"Association rule mining is one of the significant tasks in data mining. In literature, several approaches for finding interesting association rules have been proposed. Finding association rules is a two phase process. The first phase finds frequent itemsets or patterns and the second phase generates association rules. The phase that detects the frequent itemsets consumes more time and efforts. Thus performance and efficiency of an approach for generating association rules depends upon the efficiency of the approach used to find frequent itemsets in the first phase. The present paper proposes an approach that generates association rules directly without undergoing through this two phase process. ACO based methodology is applied to generate association rules directly. Item database is converted into a directed graph and then ACO is applied to generate association rules in a single step without generating large number of candidate itemsets. The algorithm is inspired by the AntMiner approach used for generating classification rules.","PeriodicalId":259816,"journal":{"name":"2015 International Conference on Energy Systems and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Mining association rules directly using ACO without generating frequent itemsets\",\"authors\":\"Manju, C. Kant\",\"doi\":\"10.1109/ICESA.2015.7503377\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Association rule mining is one of the significant tasks in data mining. In literature, several approaches for finding interesting association rules have been proposed. Finding association rules is a two phase process. The first phase finds frequent itemsets or patterns and the second phase generates association rules. The phase that detects the frequent itemsets consumes more time and efforts. Thus performance and efficiency of an approach for generating association rules depends upon the efficiency of the approach used to find frequent itemsets in the first phase. The present paper proposes an approach that generates association rules directly without undergoing through this two phase process. ACO based methodology is applied to generate association rules directly. Item database is converted into a directed graph and then ACO is applied to generate association rules in a single step without generating large number of candidate itemsets. The algorithm is inspired by the AntMiner approach used for generating classification rules.\",\"PeriodicalId\":259816,\"journal\":{\"name\":\"2015 International Conference on Energy Systems and Applications\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Energy Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICESA.2015.7503377\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Energy Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICESA.2015.7503377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

关联规则挖掘是数据挖掘中的重要任务之一。在文献中,已经提出了几种寻找有趣关联规则的方法。查找关联规则是一个两阶段的过程。第一阶段查找频繁的项集或模式,第二阶段生成关联规则。检测频繁项集的阶段消耗更多的时间和精力。因此,用于生成关联规则的方法的性能和效率取决于用于在第一阶段查找频繁项集的方法的效率。本文提出了一种直接生成关联规则而不经过这两个阶段过程的方法。采用基于蚁群算法的方法直接生成关联规则。将项目数据库转换为有向图,在不产生大量候选项目集的情况下,采用蚁群算法一步生成关联规则。该算法受到用于生成分类规则的AntMiner方法的启发。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mining association rules directly using ACO without generating frequent itemsets
Association rule mining is one of the significant tasks in data mining. In literature, several approaches for finding interesting association rules have been proposed. Finding association rules is a two phase process. The first phase finds frequent itemsets or patterns and the second phase generates association rules. The phase that detects the frequent itemsets consumes more time and efforts. Thus performance and efficiency of an approach for generating association rules depends upon the efficiency of the approach used to find frequent itemsets in the first phase. The present paper proposes an approach that generates association rules directly without undergoing through this two phase process. ACO based methodology is applied to generate association rules directly. Item database is converted into a directed graph and then ACO is applied to generate association rules in a single step without generating large number of candidate itemsets. The algorithm is inspired by the AntMiner approach used for generating classification 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学术官方微信