.png){kind=icon}
返回
RoPM: An Algorithm for Computing Typical Testors Based on Recursive Reductions of the Basic Matrix
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3112385.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Feature selection plays an important role in pattern recognition and smart computing. The full set of typical testors constitutes a useful tool for solving feature selection problems, especially those problems in which the objects are described by both quantitative and qualitative features. However, finding the typical testors involves a high computational cost. That is why even the most efficient methods become unsuitable to solve some problems. In this work, a new algorithm was introduced in order to reduce the long runtimes involved in the search of typical testors. The performance of the proposed algorithm was evaluated by means of several tests, which use both real-world and simulation data. MATLAB and Java language on Eclipse SDK platform were used to build the simulation dataset and to perform the tests, respectively. The runtimes achieved by the proposed algorithm were significantly shorter than those obtained by fast-BR and GCreduct (the two fastest algorithms) mainly when the latter ones exhibited excessively long runtimes.
Keyword:
Runtime
Feature extraction
Tools
Pattern recognition
Classification algorithms
Search problems
Licenses
Algorithm
feature selection
runtimes
typical testors
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
暂无机构信息
引用论文
分享收藏The Impact of Basic Matrix Dimension on the Performance of Algorithms for Computing Typical Testors.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏
查看更多内容