A Multi-Objective Evolutionary Action Rule Mining Method

Grant Daly, Ryan G. Benton, T. Johnsten
{"title":"A Multi-Objective Evolutionary Action Rule Mining Method","authors":"Grant Daly, Ryan G. Benton, T. Johnsten","doi":"10.1109/CEC.2018.8477913","DOIUrl":null,"url":null,"abstract":"Action rules are rules that describe how to transition a decision attribute from an undesired state to a desired state, with the understanding that some attributes are stable and others are flexible. Stable attributes, such as “age”, may not be changed, whereas flexible attributes, such as “interest rate”, may be changed. Action rules have great potential in data mining, as they output easily interpretable rules which can immediately be useful to a decision maker. However, at present, the methods to generate all valid action rules are computationally expensive. To address this, methods have been proposed that prune swaths of the search space as rules are generated; this results in computational efficiency, at the expense of potentially not discovering many useful rules. In this work, a method, called Multi-Objective Evolutionary Action Rule (MOEAR) mining, is introduced. MOEAR optimizes the discovery of action rules using standard evolutionary algorithm principles. Experimental results show that MOEAR is able to generate a large number of potentially interesting action rules, including those rules that could be categorized as “rare”, while achieving good computational performance.","PeriodicalId":212677,"journal":{"name":"2018 IEEE Congress on Evolutionary Computation (CEC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2018.8477913","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Action rules are rules that describe how to transition a decision attribute from an undesired state to a desired state, with the understanding that some attributes are stable and others are flexible. Stable attributes, such as “age”, may not be changed, whereas flexible attributes, such as “interest rate”, may be changed. Action rules have great potential in data mining, as they output easily interpretable rules which can immediately be useful to a decision maker. However, at present, the methods to generate all valid action rules are computationally expensive. To address this, methods have been proposed that prune swaths of the search space as rules are generated; this results in computational efficiency, at the expense of potentially not discovering many useful rules. In this work, a method, called Multi-Objective Evolutionary Action Rule (MOEAR) mining, is introduced. MOEAR optimizes the discovery of action rules using standard evolutionary algorithm principles. Experimental results show that MOEAR is able to generate a large number of potentially interesting action rules, including those rules that could be categorized as “rare”, while achieving good computational performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种多目标演化动作规则挖掘方法
动作规则是描述如何将决策属性从不想要的状态转换到想要的状态的规则,理解一些属性是稳定的,而另一些属性是灵活的。稳定的属性,如“年龄”,可能不会改变,而灵活的属性,如“利率”,可能会改变。动作规则在数据挖掘中具有很大的潜力,因为它们输出易于解释的规则,这些规则可以立即对决策者有用。然而,目前,生成所有有效动作规则的方法在计算上是昂贵的。为了解决这个问题,已经提出了将搜索空间的修剪条作为规则生成的方法;这样可以提高计算效率,但代价是可能无法发现许多有用的规则。本文介绍了一种多目标演化行为规则(MOEAR)挖掘方法。MOEAR使用标准进化算法原理优化动作规则的发现。实验结果表明,MOEAR能够生成大量潜在有趣的动作规则,包括那些可以被归类为“rare”的规则,同时获得良好的计算性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic Evolution of AutoEncoders for Compressed Representations Landscape-Based Differential Evolution for Constrained Optimization Problems A Novel Approach for Optimizing Ensemble Components in Rainfall Prediction A Many-Objective Evolutionary Algorithm with Fast Clustering and Reference Point Redistribution Manyobjective Optimization to Design Physical Topology of Optical Networks with Undefined Node Locations
×
引用
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