Predicting the dataset-level utility of feature-selection portfolio search

Feature selection (FS) can improve prediction, while searching many combinations of selectors, subset sizes, and classifiers adds substantial cost. We predict the dataset-level AUC gain from the best combination in this FS-enabled portfolio over the best all-feature classifier. Among 99 datasets in the prediction sample, 51 show any positive gain and five gain at least 0.04 absolute AUC points. A class-weighted Random Forest using five basic descriptors and 21 Problexity measures achieves leave-one-dataset-out AUROC of 0.722 for any positive gain and 0.708 for gains of at least 0.04. Matched random-subset searches and outer-fold tests provide complementary evidence on search utility. SHAP analysis identifies neighborhood structure, feature overlap, and dataset size as influential predictors. These results support dataset-level prioritization of FS portfolio search and identify directions for strengthening its predictive precision.

Authors

Institutions

Publication Details

Journal
Machine Learning with Applications
Published
2026-10-29
DOI
https://doi.org/10.1016/j.mlwa.2026.101053
Primary Topic
Machine Learning and Data Classification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Predicting the dataset-level utility of feature-selection portfolio search

Itamar Elmakias, Dan Vilenchik
1 links
Machine Learning with Applications
Machine Learning and Data Classification
article

Predicting the dataset-level utility of feature-selection portfolio search

Itamar Elmakias, Dan Vilenchik
article en

Abstract

Feature selection (FS) can improve prediction, while searching many combinations of selectors, subset sizes, and classifiers adds substantial cost. We predict the dataset-level AUC gain from the best combination in this FS-enabled portfolio over the best all-feature classifier. Among 99 datasets in the prediction sample, 51 show any positive gain and five gain at least 0.04 absolute AUC points. A class-weighted Random Forest using five basic descriptors and 21 Problexity measures achieves leave-one-dataset-out AUROC of 0.722 for any positive gain and 0.708 for gains of at least 0.04. Matched random-subset searches and outer-fold tests provide complementary evidence on search utility. SHAP analysis identifies neighborhood structure, feature overlap, and dataset size as influential predictors. These results support dataset-level prioritization of FS portfolio search and identify directions for strengthening its predictive precision.

Machine Learning with ApplicationsVol. 26
Ben-Gurion University of the Negev (IL)
Openalex Percentile: Top 14%
Machine Learning and Data Classification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Predicting the dataset-level utility of feature-selection portfolio search — Itamar Elmakias, Dan Vilenchik · Machine Learning with Applications (2026) | TGRS Research Map | TGRS