Discovering fuzzy-rough reducts through Estimation of Distribution Algorithms

Richard Jensen, Neil MacParthaláin
{"title":"Discovering fuzzy-rough reducts through Estimation of Distribution Algorithms","authors":"Richard Jensen, Neil MacParthaláin","doi":"10.1109/FUZZ-IEEE.2015.7338022","DOIUrl":null,"url":null,"abstract":"Due to the explosive growth of stored information worldwide, feature selection (FS) is becoming an increasingly important step, particularly given the abundance of noisy, irrelevant or misleading features. The main aim of FS is to determine a minimal feature subset from a problem domain while retaining a suitably high accuracy in representing the original set of features. However, the problem of finding optimal reductions is challenging as there is always a trade-off between the extent of reduction and the resulting information loss. This topic has been of particular interest in rough and fuzzy-rough set theory, as these provide a mechanism for defining optimality using only the data itself. Evolutionary methods have been used to try to find rough and fuzzy-rough optimal reductions, but these approaches ignore the fact that not all equally-sized reducts have the same utility for classifiers. This paper presents a novel approach for fuzzy-rough feature selection that uses Estimation of Distribution Algorithms to maintain information about the quality of features, to then obtain a better quality reduct that is more useful in general.","PeriodicalId":185191,"journal":{"name":"2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUZZ-IEEE.2015.7338022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the explosive growth of stored information worldwide, feature selection (FS) is becoming an increasingly important step, particularly given the abundance of noisy, irrelevant or misleading features. The main aim of FS is to determine a minimal feature subset from a problem domain while retaining a suitably high accuracy in representing the original set of features. However, the problem of finding optimal reductions is challenging as there is always a trade-off between the extent of reduction and the resulting information loss. This topic has been of particular interest in rough and fuzzy-rough set theory, as these provide a mechanism for defining optimality using only the data itself. Evolutionary methods have been used to try to find rough and fuzzy-rough optimal reductions, but these approaches ignore the fact that not all equally-sized reducts have the same utility for classifiers. This paper presents a novel approach for fuzzy-rough feature selection that uses Estimation of Distribution Algorithms to maintain information about the quality of features, to then obtain a better quality reduct that is more useful in general.
通过估计分布算法发现模糊粗糙约简
由于世界范围内存储信息的爆炸式增长,特征选择(FS)变得越来越重要,特别是考虑到大量的噪声,不相关或误导性的特征。FS的主要目标是从问题域中确定最小特征子集,同时在表示原始特征集时保持适当的高精度。然而,寻找最优缩减的问题是具有挑战性的,因为在缩减的程度和由此产生的信息损失之间总是存在权衡。这个主题对粗糙集和模糊粗糙集理论特别感兴趣,因为它们提供了一种仅使用数据本身来定义最优性的机制。进化方法已经被用来尝试找到粗糙和模糊粗糙的最优约简,但是这些方法忽略了一个事实,即并非所有大小相等的约简对分类器都具有相同的效用。本文提出了一种新的模糊粗糙特征选择方法,该方法利用分布估计算法来保持特征的质量信息,从而获得更有用的质量约简。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信