Metraipolis › archive › dc_c164add0dcd8

Advancing Interaction-Sensitive Feature Selection: Novel Relief-Based Algorithms, Expanded Comparisons, and Recommendations for Biomedical Data Mining — arXiv:2608.28552

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.28552
License (as archived)
CC0-1.0
Archived
2026-10-17T11:06:40.554Z
SHA-256 of the archived text
1ad8d6e453dbfac4b564a9537b668eb2f8ed1aa9bedc4ea2202d12fc4a9f84cd
Stable URL of this page
https://metraipolis.com/documento/dc_c164add0dcd8

How to cite

Advancing Interaction-Sensitive Feature Selection: Novel Relief-Based Algorithms, Expanded Comparisons, and Recommendations for Biomedical Data Mining — arXiv:2608.28552 — arXiv (en), https://arxiv.org/abs/2608.28552 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c164add0dcd8 (Metraipolis archive dc_c164add0dcd8, sha256 1ad8d6e453dbfac4b564a9537b668eb2f8ed1aa9bedc4ea2202d12fc4a9f84cd)
BibTeX
@misc{dcc164add0dcd8,
  title = {Advancing Interaction-Sensitive Feature Selection: Novel Relief-Based Algorithms, Expanded Comparisons, and Recommendations for Biomedical Data Mining — arXiv:2608.28552},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.28552},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c164add0dcd8; sha256 1ad8d6e453dbfac4b564a9537b668eb2f8ed1aa9bedc4ea2202d12fc4a9f84cd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28552. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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. We expand scikit-rebate to include SWRF*, mu-Relief, and 5 novel RBA variants implementing alternative strategies for neighbor selection and feature scoring. All RBAs were evaluated to compare predictive feature ranking and runtime across simulated genomic datasets varying in sample size, number of features, heritability, and underlying association type (e.g. main effects and interactions). All RBAs, except mu-Relief, were proficient in detecting 2-way interactions in noisy data. RBAs utilizing 'far' scoring were best at detecting 2-way interactions - with MultiSWRFDB* top-performing - but were far less sensitive to main effects. SWRF, MultiSWRF, MultiSURF, and MultiSWRFDB yielded top performance across main effect and 2-way interaction datasets with MultiSWRFDB performing best when also considering 3-way interactions. Refactoring of scikit-rebate resulted in 10 to 35-fold reductions in RBA runtimes. The newly introduced RBAs were among the strongest performing, and by robustly retaining both main effects and 2-way epistatic interactions, these algorithms preserve predictive signals for downstream modeling.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-31 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.28552 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:50:25.821Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).