Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.00954 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913971407159296 |
|---|---|
| author | Hu, Andy Prasad, Devika Pizzato, Luiz Foord, Nicholas Abrahamyan, Arman Leontjeva, Anna Doyle, Cooper Jermyn, Dan |
| author_facet | Hu, Andy Prasad, Devika Pizzato, Luiz Foord, Nicholas Abrahamyan, Arman Leontjeva, Anna Doyle, Cooper Jermyn, Dan |
| contents | In machine learning, the process of feature selection involves finding a reduced subset of features that captures most of the information required to train an accurate and efficient model. This work presents FeatureCuts, a novel feature selection algorithm that adaptively selects the optimal feature cutoff after performing filter ranking. Evaluated on 14 publicly available datasets and one industry dataset, FeatureCuts achieved, on average, 15 percentage points more feature reduction and up to 99.6% less computation time while maintaining model performance, compared to existing state-of-the-art methods. When the selected features are used in a wrapper method such as Particle Swarm Optimization (PSO), it enables 25 percentage points more feature reduction, requires 66% less computation time, and maintains model performance when compared to PSO alone. The minimal overhead of FeatureCuts makes it scalable for large datasets typically seen in enterprise applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_00954 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff Hu, Andy Prasad, Devika Pizzato, Luiz Foord, Nicholas Abrahamyan, Arman Leontjeva, Anna Doyle, Cooper Jermyn, Dan Machine Learning In machine learning, the process of feature selection involves finding a reduced subset of features that captures most of the information required to train an accurate and efficient model. This work presents FeatureCuts, a novel feature selection algorithm that adaptively selects the optimal feature cutoff after performing filter ranking. Evaluated on 14 publicly available datasets and one industry dataset, FeatureCuts achieved, on average, 15 percentage points more feature reduction and up to 99.6% less computation time while maintaining model performance, compared to existing state-of-the-art methods. When the selected features are used in a wrapper method such as Particle Swarm Optimization (PSO), it enables 25 percentage points more feature reduction, requires 66% less computation time, and maintains model performance when compared to PSO alone. The minimal overhead of FeatureCuts makes it scalable for large datasets typically seen in enterprise applications. |
| title | FeatureCuts: Feature Selection for Large Data by Optimizing the Cutoff |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2508.00954 |