A new representation in genetic programming with hybrid feature ranking criterion for high-dimensional feature selection

Feature selection is a common method for improving classification performance. Selecting features for high-dimensional data is challenging due to the large search space. Traditional feature ranking methods that search for top-ranked features cannot remove redundant and irrelevant features and may also ignore interrelated features. Evolutionary computation (EC) techniques are widely used in feature selection due to their global search capability. However, EC can easily fall into local optima when dealing with feature selection for high-dimensional applications. The top-ranked features are more likely to construct effective feature subsets and help EC reduce the search space. This paper proposes a feature selection method based on Genetic Programming (GP) with hybrid feature ranking criterion called GPHC, which combines multiple feature ranking methods into the GP structure using a novel GP representation to search for effective feature subsets. Experiments on eight high-dimensional datasets show that GPHC achieves significantly better classification performance compared to five feature ranking methods. Further comparisons between GPHC and other evolutionary algorithms demonstrate that GPHC has advantages in terms of classification performance, the number of features, and convergence speed.

Authors

Institutions

Publication Details

Journal
Complex & Intelligent Systems
Published
2025-02-28
DOI
https://doi.org/10.1007/s40747-025-01784-1
Primary Topic
Evolutionary Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A new representation in genetic programming with hybrid feature ranking criterion for high-dimensional feature selection

Jianbin Ma, Jiayi Li, Fan Zhang
Complex & Intelligent Systems
Evolutionary Algorithms and Applications
article

A new representation in genetic programming with hybrid feature ranking criterion for high-dimensional feature selection

Jianbin Ma, Jiayi Li, Fan Zhang
article en

Abstract

Feature selection is a common method for improving classification performance. Selecting features for high-dimensional data is challenging due to the large search space. Traditional feature ranking methods that search for top-ranked features cannot remove redundant and irrelevant features and may also ignore interrelated features. Evolutionary computation (EC) techniques are widely used in feature selection due to their global search capability. However, EC can easily fall into local optima when dealing with feature selection for high-dimensional applications. The top-ranked features are more likely to construct effective feature subsets and help EC reduce the search space. This paper proposes a feature selection method based on Genetic Programming (GP) with hybrid feature ranking criterion called GPHC, which combines multiple feature ranking methods into the GP structure using a novel GP representation to search for effective feature subsets. Experiments on eight high-dimensional datasets show that GPHC achieves significantly better classification performance compared to five feature ranking methods. Further comparisons between GPHC and other evolutionary algorithms demonstrate that GPHC has advantages in terms of classification performance, the number of features, and convergence speed.

Complex & Intelligent SystemsVol. 11(4)
Hebei Agricultural University (CN)
National College Students Innovation and Entrepreneurship Training Program
Openalex Percentile: Top 99%
Evolutionary Algorithms and Applications
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.