mlr_fselectors_rfe | R Documentation |
Feature selection using the Recursive Feature Elimination (RFE) algorithm. Recursive feature elimination iteratively removes features with a low importance score. Only works with mlr3::Learners that can calculate importance scores (see the section on optional extractors in mlr3::Learner).
The learner is trained on all features at the start and importance scores are calculated for each feature.
Then the least important feature is removed and the learner is trained on the reduced feature set.
The importance scores are calculated again and the procedure is repeated until the desired number of features is reached.
The non-recursive option (recursive = FALSE
) only uses the importance scores calculated in the first iteration.
The feature selection terminates itself when n_features
is reached.
It is not necessary to set a termination criterion.
When using a cross-validation resampling strategy, the importance scores of the resampling iterations are aggregated.
The parameter aggregation
determines how the importance scores are aggregated.
By default ("rank"
), the importance score vector of each fold is ranked and the feature with the lowest average rank is removed.
The option "mean"
averages the score of each feature across the resampling iterations and removes the feature with the lowest average score.
Averaging the scores is not appropriate for most importance measures.
The ArchiveBatchFSelect holds the following additional columns:
"importance"
(numeric()
)
The importance score vector of the feature subset.
The gallery features a collection of case studies and demos about optimization.
Utilize the built-in feature importance of models with Recursive Feature Elimination.
This FSelector can be instantiated with the associated sugar function fs()
:
fs("rfe")
n_features
integer(1)
The minimum number of features to select, by default half of the features.
feature_fraction
double(1)
Fraction of features to retain in each iteration.
The default of 0.5 retains half of the features.
feature_number
integer(1)
Number of features to remove in each iteration.
subset_sizes
integer()
Vector of the number of features to retain in each iteration.
Must be sorted in decreasing order.
recursive
logical(1)
If TRUE
(default), the feature importance is calculated in each iteration.
aggregation
character(1)
The aggregation method for the importance scores of the resampling iterations.
See details.
The parameter feature_fraction
, feature_number
and subset_sizes
are mutually exclusive.
mlr3fselect::FSelector
-> mlr3fselect::FSelectorBatch
-> FSelectorBatchRFE
new()
Creates a new instance of this R6 class.
FSelectorBatchRFE$new()
clone()
The objects of this class are cloneable with this method.
FSelectorBatchRFE$clone(deep = FALSE)
deep
Whether to make a deep clone.
Guyon I, Weston J, Barnhill S, Vapnik V (2002). “Gene Selection for Cancer Classification using Support Vector Machines.” Machine Learning, 46(1), 389–422. ISSN 1573-0565, \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1023/A:1012487302797")}.
Other FSelector:
FSelector
,
mlr_fselectors
,
mlr_fselectors_design_points
,
mlr_fselectors_exhaustive_search
,
mlr_fselectors_genetic_search
,
mlr_fselectors_random_search
,
mlr_fselectors_rfecv
,
mlr_fselectors_sequential
,
mlr_fselectors_shadow_variable_search
# Feature Selection
# retrieve task and load learner
task = tsk("penguins")
learner = lrn("classif.rpart")
# run feature selection on the Palmer Penguins data set
instance = fselect(
fselector = fs("rfe"),
task = task,
learner = learner,
resampling = rsmp("holdout"),
measure = msr("classif.ce"),
store_models = TRUE
)
# best performing feature subset
instance$result
# all evaluated feature subsets
as.data.table(instance$archive)
# subset the task and fit the final model
task$select(instance$result_feature_set)
learner$train(task)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.