Neurodynamics-driven supervised feature selection
•The supervised similarity measure based on information theory incorporating the information of class labels is applied to quantify similarities between features.•The proposed feature selection problem via holistic redundancy minimization based on the supervised similarity measure is mathematically...
Saved in:
Published in | Pattern recognition Vol. 136; p. 109254 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.04.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | •The supervised similarity measure based on information theory incorporating the information of class labels is applied to quantify similarities between features.•The proposed feature selection problem via holistic redundancy minimization based on the supervised similarity measure is mathematically formulated as a biconvex optimization problem with a quartic objective function. In addition, an iteratively reweighted convex quadratic program is reformulated.•A two-timescale duplex neurodynamic system is applied to solve the formulated biconvex optimization problem and a projection neural network is customized to solve the iteratively reweighted convex optimization problem.•The two-timescale duplex neurodynamic approach is substantiated to be almost-surely convergent to global optimal solutions to the formulated biconvex optimization problem.•Extensive experimental results on benchmark datasets demonstrate the superior performance of the proposed QWRM-based feature selection methods in comparison with the mainstream feature selection methods.
Feature selection is an important dimensionality reduction technique in machine learning, pattern recognition, image processing, and data mining. Most existing feature selection methods are greedy in nature thus are prone to sub-optimality. Though some feature selection methods based on global optimization of unsupervised redundancy may potentiate performance improvements, they may or may not be relevant to classification as the information on pairwise features with class labels is missing. In this paper, based on a supervised similarity measure, a biconvex optimization problem is formulated for holistic feature section with a quadratically weighted objective function subject to linear equality and nonnegativity constraints. In addition, an iteratively reweighted convex quadratic program is reformulated. A two-timescale duplex neurodynamic system is applied to solve the formulated biconvex optimization problem and a projection neural network is customized to solve the iteratively reweighted convex optimization problem. Experimental results of the proposed neurodynamics-based supervised feature selection are elaborated in comparison with several existing feature selection methods based on twenty benchmark datasets to substantiate the efficacy and superiority of the neurodynamics-based method for selecting informative features in classification. |
---|---|
ISSN: | 0031-3203 1873-5142 |
DOI: | 10.1016/j.patcog.2022.109254 |