2024
DOI: 10.33480/jitk.v9i2.5015
|View full text |Cite
|
Sign up to set email alerts
|

A Systematic Literature Review: Recursive Feature Elimination Algorithms

Arif Mudi Priyatno,
Triyanna Widiyaningtyas

Abstract: Recursive feature elimination (RFE) is a feature selection algorithm that works by gradually eliminating unimportant features. RFE has become a popular method for feature selection in various machine learning applications, such as classification and prediction. However, there is no systematic literature review (SLR) that discusses recursive feature elimination algorithms. This article conducts a SLR on RFE algorithms. The goal is to provide an overview of the current state of the RFE algorithm. This SLR uses I… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 34 publications
0
2
0
Order By: Relevance
“…The RFE is adaptable to any type of algorithm, rendering it a versatile method that is applicable across various scenarios. The Recurse RFE method is classified by some authors as a wrapper method [45]. Some other sources consider it a wrapper-type feature selection method that also uses filter-based feature selection internally [46].…”
Section: Recursive Feature Eliminationmentioning
confidence: 99%
“…The RFE is adaptable to any type of algorithm, rendering it a versatile method that is applicable across various scenarios. The Recurse RFE method is classified by some authors as a wrapper method [45]. Some other sources consider it a wrapper-type feature selection method that also uses filter-based feature selection internally [46].…”
Section: Recursive Feature Eliminationmentioning
confidence: 99%
“…Within algorithmic modelling, we can also use one of the wrapper methods, recursive feature elimination (RFE). In this method, smaller and smaller subsets of variables are considered, the least important variables are removed from the current set based on a measure of importance, until a predetermined number of variables is reached [Kohavi, John 1997;Priyatno et al 2024]. The approach can however be computationally expensive.…”
Section: Variable Selection In Algorithmic Modellingmentioning
confidence: 99%