Sparse Regression Feature Selection Algorithm with Feature Variance Weighting

Aiming at the problem of insufficient discriminative feature selection ability in the existing sparse regression based feature selection algorithm, a sparse regression feature selection algorithm with feature variance weighting is proposed by introducing the variance information of features. In this method, the variances of the features are used to assist in constructing the sparse penalty term, that is, the variances of the features are used to construct the feature weights, which are added to the corresponding rows of the transformation matrix in the sparse penalty term, so as to achieve a more discriminative feature selection. At the same time, the variances of the features are also used to construct the initial regression transformation matrix, which can improve the global optimization searching capability of the algorithm. The whole model is solved using the Iteratively Re-Weighted method, which ensures the convergence of the algorithm. Comparative experiments on seven datasets have conducted to validate the effectiveness of the proposed method.

Authors

Institutions

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1145/3703935.3703966
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sparse Regression Feature Selection Algorithm with Feature Variance Weighting

F. Li, Yuexuan Wu, Xiaobin Zhi
Face and Expression Recognition
article

Sparse Regression Feature Selection Algorithm with Feature Variance Weighting

F. Li, Yuexuan Wu, Xiaobin Zhi
article en

Abstract

Aiming at the problem of insufficient discriminative feature selection ability in the existing sparse regression based feature selection algorithm, a sparse regression feature selection algorithm with feature variance weighting is proposed by introducing the variance information of features. In this method, the variances of the features are used to assist in constructing the sparse penalty term, that is, the variances of the features are used to construct the feature weights, which are added to the corresponding rows of the transformation matrix in the sparse penalty term, so as to achieve a more discriminative feature selection. At the same time, the variances of the features are also used to construct the initial regression transformation matrix, which can improve the global optimization searching capability of the algorithm. The whole model is solved using the Iteratively Re-Weighted method, which ensures the convergence of the algorithm. Comparative experiments on seven datasets have conducted to validate the effectiveness of the proposed method.

Xi’an University of Posts and Telecommunications (CN)
Openalex Percentile: Top 70%
Face and Expression Recognition
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.