Frequency-Based Multi-Objective Feature Selection to Enhance the Generalization of Evolutionary Algorithms
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Feature selection is a critical preprocessing task in machine learning, particularly with high-dimensional datasets and decision-making while handling big data which presents significant challenges. This paper introduces an innovative approach for multi-objective feature selection, aiming to minimize the number of features and classification error simultaneously. The method mitigates the generalization issues commonly faced when relying on the results of a single run of evolutionary algorithms. Our approach leverages the frequency of each feature across multiple runs of the optimization algorithm, applied to different portions of the data, as a key metric for ranking the features. This can reduce the risk of overfitting and enhances generalization by capturing more reliable features through repeated runs and different data subsets. To enhance the robustness of the selection, we incorporate the correlation between features and labels to determine the final feature set. To evaluate the proposed method, we selected fourteen datasets with varying numbers of features and instances. Experimental results demonstrate that this post-optimization processing technique significantly enhances generalization and consistently delivers superior performance across various datasets compared to the raw optimization results.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it