Paper Overview
Field: Machine Learning Authors: Kia Kazemi-Nia, Harsh Bandhey, Philip J. Freda, Ryan J. Urbanowicz arXiv: 2608.28552
Abstract
As a precursor to high-dimensional biomedical data modeling, reliable feature selection can reduce computational expense, improve modeling performance, and yield simpler, more interpretable models. However, most filter-based feature selection methods struggle to detect feature interactions, while wrapper or embedded feature selection methods are computationally expensive. Relief-based algorithms (RBAs) are filter methods that are sensitive to feature interactions while mitigating these other limitations.
This study (1) refactors, optimizes, and expands the scikit-rebate Python package with existing and newly proposed RBA variants and (2) conducts rigorous RBA benchmark comparisons across diverse genomic simulations.
Key Findings
- scikit-rebate was expanded to include SWRF*, mu-Relief, and 5 novel RBA variants, implementing alternative strategies for neighbor selection and feature scoring.
- All RBAs were evaluated on simulated genomic datasets varying sample size, feature count, heritability, and underlying association type (e.g., main effects and interactions), comparing predictive feature rankings and runtime.
- Except for mu-Relief, all RBAs excelled at detecting 2-way interactions in noisy data.
- RBAs using 'far' scoring were best at detecting 2-way interactions — MultiSWRFDB* performed best — but were considerably less sensitive to main effects.
- SWRF, MultiSWRF, MultiSURF, and MultiSWRFDB performed best on main effect and 2-way interaction datasets; MultiSWRFDB was best overall when 3-way interactions were also considered.
- The refactoring of scikit-rebate reduced RBA runtimes by 10 to 35 times.
- The newly introduced RBAs are among the strongest performers, robustly preserving main effects and 2-way epistatic interactions to retain predictive signal for downstream modeling.