RoPM: An Algorithm for Computing Typical Testors Based on Recursive Reductions of the Basic Matrix
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,...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9536713/ |
| _version_ | 1828406889897000960 |
|---|---|
| author | Joel Pino Gomez Fidel Ernesto Hernandez Montero Joel Charles Sotelo Julio Cesar Gomez Mancilla Yenny Villuendas Rey |
| author_facet | Joel Pino Gomez Fidel Ernesto Hernandez Montero Joel Charles Sotelo Julio Cesar Gomez Mancilla Yenny Villuendas Rey |
| author_sort | Joel Pino Gomez |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-10T11:18:16Z |
| format | Article |
| id | doaj.art-9aad3dc87e7e4185bc536b82aa673539 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-10T11:18:16Z |
| publishDate | 2021-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-9aad3dc87e7e4185bc536b82aa6735392022-12-22T01:51:05ZengIEEEIEEE Access2169-35362021-01-01912822012823210.1109/ACCESS.2021.31123859536713RoPM: An Algorithm for Computing Typical Testors Based on Recursive Reductions of the Basic MatrixJoel Pino Gomez0https://orcid.org/0000-0003-3936-9115Fidel Ernesto Hernandez Montero1https://orcid.org/0000-0002-5003-2807Joel Charles Sotelo2Julio Cesar Gomez Mancilla3Yenny Villuendas Rey4https://orcid.org/0000-0001-9889-3924Department of Telecommunications, Technological University of Havana (Cujae), Marianao, CubaDepartment of Telecommunications, Technological University of Havana (Cujae), Marianao, CubaDepartment of Telecommunications, Technological University of Havana (Cujae), Marianao, CubaVibrations and Rotor Dynamic Laboratory, ESIME, Instituto Politécnico Nacional (IPN), Mexico City, MexicoCentro de Innovación y Desarrollo Tecnológico en Cómputo, Instituto Politécnico Nacional (IPN), Mexico City, MexicoFeature 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.https://ieeexplore.ieee.org/document/9536713/Algorithmfeature selectionruntimestypical testors |
| spellingShingle | Joel Pino Gomez Fidel Ernesto Hernandez Montero Joel Charles Sotelo Julio Cesar Gomez Mancilla Yenny Villuendas Rey RoPM: An Algorithm for Computing Typical Testors Based on Recursive Reductions of the Basic Matrix IEEE Access Algorithm feature selection runtimes typical testors |
| title | RoPM: An Algorithm for Computing Typical Testors Based on Recursive Reductions of the Basic Matrix |
| title_full | RoPM: An Algorithm for Computing Typical Testors Based on Recursive Reductions of the Basic Matrix |
| title_fullStr | RoPM: An Algorithm for Computing Typical Testors Based on Recursive Reductions of the Basic Matrix |
| title_full_unstemmed | RoPM: An Algorithm for Computing Typical Testors Based on Recursive Reductions of the Basic Matrix |
| title_short | RoPM: An Algorithm for Computing Typical Testors Based on Recursive Reductions of the Basic Matrix |
| title_sort | ropm an algorithm for computing typical testors based on recursive reductions of the basic matrix |
| topic | Algorithm feature selection runtimes typical testors |
| url | https://ieeexplore.ieee.org/document/9536713/ |
| work_keys_str_mv | AT joelpinogomez ropmanalgorithmforcomputingtypicaltestorsbasedonrecursivereductionsofthebasicmatrix AT fidelernestohernandezmontero ropmanalgorithmforcomputingtypicaltestorsbasedonrecursivereductionsofthebasicmatrix AT joelcharlessotelo ropmanalgorithmforcomputingtypicaltestorsbasedonrecursivereductionsofthebasicmatrix AT juliocesargomezmancilla ropmanalgorithmforcomputingtypicaltestorsbasedonrecursivereductionsofthebasicmatrix AT yennyvilluendasrey ropmanalgorithmforcomputingtypicaltestorsbasedonrecursivereductionsofthebasicmatrix |