结合克隆选择和确定性抽样的高效关联分类。

Samir A Mohamed Elsayed, Sanguthevar Rajasekaran, Reda A Ammar
{"title":"结合克隆选择和确定性抽样的高效关联分类。","authors":"Samir A Mohamed Elsayed,&nbsp;Sanguthevar Rajasekaran,&nbsp;Reda A Ammar","doi":"10.1109/CEC.2013.6557966","DOIUrl":null,"url":null,"abstract":"<p><p>Traditional Associative Classification (AC) algorithms typically search for all possible association rules to find a representative subset of those rules. Since the search space of such rules may grow exponentially as the support threshold decreases, the rules discovery process can be computationally expensive. One effective way to tackle this problem is to directly find a set of high-stakes association rules that potentially builds a highly accurate classifier. This paper introduces AC-CS, an AC algorithm that integrates the clonal selection of the immune system along with deterministic data sampling. Upon picking a representative sample of the original data, it proceeds in an evolutionary fashion to populate only rules that are likely to yield good classification accuracy. Empirical results on several real datasets show that the approach generates dramatically less rules than traditional AC algorithms. In addition, the proposed approach is significantly more efficient than traditional AC algorithms while achieving a competitive accuracy.</p>","PeriodicalId":89459,"journal":{"name":"Proceedings of the ... Congress on Evolutionary Computation. Congress on Evolutionary Computation","volume":" ","pages":"3236-3243"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CEC.2013.6557966","citationCount":"1","resultStr":"{\"title\":\"Integrating Clonal Selection and Deterministic Sampling for Efficient Associative Classification.\",\"authors\":\"Samir A Mohamed Elsayed,&nbsp;Sanguthevar Rajasekaran,&nbsp;Reda A Ammar\",\"doi\":\"10.1109/CEC.2013.6557966\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Traditional Associative Classification (AC) algorithms typically search for all possible association rules to find a representative subset of those rules. Since the search space of such rules may grow exponentially as the support threshold decreases, the rules discovery process can be computationally expensive. One effective way to tackle this problem is to directly find a set of high-stakes association rules that potentially builds a highly accurate classifier. This paper introduces AC-CS, an AC algorithm that integrates the clonal selection of the immune system along with deterministic data sampling. Upon picking a representative sample of the original data, it proceeds in an evolutionary fashion to populate only rules that are likely to yield good classification accuracy. Empirical results on several real datasets show that the approach generates dramatically less rules than traditional AC algorithms. In addition, the proposed approach is significantly more efficient than traditional AC algorithms while achieving a competitive accuracy.</p>\",\"PeriodicalId\":89459,\"journal\":{\"name\":\"Proceedings of the ... Congress on Evolutionary Computation. Congress on Evolutionary Computation\",\"volume\":\" \",\"pages\":\"3236-3243\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1109/CEC.2013.6557966\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... Congress on Evolutionary Computation. Congress on Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2013.6557966\",\"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 ... Congress on Evolutionary Computation. Congress on Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2013.6557966","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

传统的关联分类(AC)算法通常搜索所有可能的关联规则,以找到这些规则的代表性子集。由于这些规则的搜索空间可能会随着支持阈值的降低而呈指数增长,因此规则发现过程的计算成本可能很高。解决这个问题的一个有效方法是直接找到一组高风险的关联规则,这些规则可能构建一个高度准确的分类器。本文介绍了一种集免疫系统克隆选择和确定性数据采样于一体的AC- cs算法。在选择原始数据的代表性样本后,它以进化的方式只填充可能产生良好分类准确性的规则。在几个真实数据集上的实证结果表明,该方法比传统的AC算法生成的规则要少得多。此外,该方法的效率明显高于传统的交流算法,同时达到了相当的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Integrating Clonal Selection and Deterministic Sampling for Efficient Associative Classification.

Integrating Clonal Selection and Deterministic Sampling for Efficient Associative Classification.

Traditional Associative Classification (AC) algorithms typically search for all possible association rules to find a representative subset of those rules. Since the search space of such rules may grow exponentially as the support threshold decreases, the rules discovery process can be computationally expensive. One effective way to tackle this problem is to directly find a set of high-stakes association rules that potentially builds a highly accurate classifier. This paper introduces AC-CS, an AC algorithm that integrates the clonal selection of the immune system along with deterministic data sampling. Upon picking a representative sample of the original data, it proceeds in an evolutionary fashion to populate only rules that are likely to yield good classification accuracy. Empirical results on several real datasets show that the approach generates dramatically less rules than traditional AC algorithms. In addition, the proposed approach is significantly more efficient than traditional AC algorithms while achieving a competitive accuracy.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信