Aug 2026· IEEE Transactions on Neural Networks and Learning Systems· Vol PP, pp. 1-15· 0 citations
Medicine
TL;DR
These findings validate that the synergy between FND and the collective mechanism effectively balances local exploitation and global exploration, leading to robust feature selection performance across diverse datasets and parameter settings.
Abstract
Feature selection is a core machine learning technique for selecting the most informative features. Most existing feature selection methods rely on greedy strategies, leading to solutions. Although some global feature selection methods improve classification performance, their effectiveness remains limited due to category information or inaccurate relevance measurements. In this article, the feature selection task is reformulated as a mixed-integer optimization problem that minimizes feature redundancy and maximizes feature relevance. Given the nonconvex nature of this formulation, a collective first-order neural dynamics (CFND) method is proposed to solve the optimization problem. The method combines first-order neural dynamics (FND) with a collective mechanism to substantially enhance the global search capability. Theoretical analyses prove that the proposed CFND method converges globally with probability 1. Extensive experiments across ten benchmark datasets demonstrate that the proposed CFND method consistently outperforms other feature selection methods across all classifiers, achieving an average accuracy improvement of approximately 2%-5%. Compared with traditional methods, the maximum performance gain exceeds 6%. These findings validate that the synergy between FND and the collective mechanism effectively balances local exploitation and global exploration, leading to robust feature selection performance across diverse datasets and parameter settings. The source code is available at https://github.com/LongJin-lab/CFND.
We introduce a robust classification model designed for feature selection. Support vector machine (SVM) models continue to play a crucial role in binary classification, particularly with tabular data. Their robust variants are essential for developing classifiers that remain stable despite shifts in data distribution...
Miguel Carrasco, B. Ivorra, Julio López et al.· Journal of Convex Analysis· 0 citations
A hybrid GA that integrates an information-theoretic local search strategy for unsupervised FS and effectively mitigates the premature convergence problem of conventional GAs and improves search efficiency and solution quality compared to traditional heuristic and evolutionary approaches is proposed.
Seyeon Son, Hyunki Lim· Computers, Materials & C...· 0 citations
Multi-objective feature selection provides an effective framework for high-dimensional data analysis by jointly considering classification performance and feature subset size. However, redundant and irrelevant features may degrade the quality of the initial search distribution, and population aggregation may reduce the...
Gao-Xiang Huang, Ji-Gen Luo, Ting Wang et al.· Algorithms· 0 citations
We study data-driven early stopping for spectral regularisation methods in the classical non-parametric regression setting. Building on the discrepancy principle, we propose a multi-scale stopping rule that applies to general kernel estimators and show that, unlike previous approaches, it achieves full adaptivity over...
Enhancing the classification performance is more challenging than reducing the number of features in multiobjective feature selection. Such imbalance might lead the population to converge to a region on the Pareto front with a small number of features. Meanwhile, increasing the classification performance is time consum...
PopFS is introduced, a method for learning one shared, deployable feature set that is robust to population differences while letting each pop- ulation train its own model.
Ruiqi Lyu, A. Turcan, Bryan Wilder· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.