.png){kind=icon}
返回
An Algorithm for Computing Minimum-Length Irreducible Testors
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2982133.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In pattern recognition, the elimination of unnecessary and/or redundant attributes is known as feature selection. Irreducible testors have been used to perform this task. An objective of the Minimum Description Length Principle (MDL) applied to feature selection in pattern recognition and data mining is to select the minimum number of attributes in a data set. Consequently, the MDL principle leads us to consider the subset of irreducible testors of minimum length. Some algorithms that find the whole set of irreducible testors have been reported in the literature. However, none of these algorithms was designed to generate only minimum-length irreducible testors. In this paper, we propose the first algorithm specifically designed to calculate all minimum-length irreducible testors from a training sample. The paper presents some experimental results obtained using synthetic and real data in which the performance of the proposed algorithm is contrasted with other state-of-the-art algorithms that were adapted to generate only irreducible testers of minimum length.
Keyword:
Feature selection
MDL principle
minimum-length irreducible testors
testor
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏分享收藏A parallel hill-climbing algorithm to generate a subset of irreducible testors.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏Hybrid binary ant lion optimizer with rough set and approximate entropy reducts for feature selection具有粗糙集和近似熵约简的混合二进制蚂蚁狮子优化器，用于特征选择SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏Advances in global sensitivity analyses of demographic-based species distribution models to address uncertainties in dynamic landscapesPeerJ
OAAI
PeerJIF0
OAAI分享收藏
查看更多内容