.png){kind=icon}
返回
Neurodynamics-driven supervised feature selection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2022.109254.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Feature selection is an important dimensionality reduction technique in machine learning, pattern recog-nition, 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 con-straints. 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 prob-lem. Experimental results of the proposed neurodynamics-based supervised feature selection are elabo-rated 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.(c) 2022 Elsevier Ltd. All rights reserved.
Keyword:
Feature selection
Biconvex Optimization
Information-theoretic measures
Neurodynamic optimization
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
A neurodynamic optimization approach to supervised feature selection via fractional programming.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏A Comprehensive Analysis of Nature-Inspired Meta-Heuristic Techniques for Feature Selection Problem
PREAI
分享收藏
查看更多内容