A Streaming Feature Selection Method Based on Dynamic Feature Clustering and Particle Swarm Optimization

Feature selection (FS) is an effective data preprocessing technique. In some practical applications, features may continuously arrive one by one or by groups, and we cannot know the exact number of features before learning. Streaming FS (SFS) aims to remove redundant and irrelevant features from the continuously arriving features. This article proposes a three-stage SFS method based on dynamic feature clustering and particle swarm optimization (SFS-DPSO). In the first stage, an online relevance analysis is utilized to quickly remove irrelevant features, reducing the size of newly arrived feature groups. In the second stage, a dynamic feature clustering technique is employed to divide redundant features into different groups, thereby reducing the search space for subsequent evolutionary algorithms. In the third stage, a historical information-driven integer particle swarm optimization algorithm is exploited to search for optimal feature subset in the clustered feature space. The proposed algorithm is applied in 12 typical datasets with different difficulty levels and a real-word case, experimental results show that it can achieve better-classification results in a reasonable time and is superior to most existing algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Evolutionary Computation
Published
2024-08-29
DOI
https://doi.org/10.1109/tevc.2024.3451688
Citations
21
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
6.89

Funders

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

A Streaming Feature Selection Method Based on Dynamic Feature Clustering and Particle Swarm Optimization

Ying Hu, Yinan Guo, Zhang Yon, Hao Ma et al.
21 citations
IEEE Transactions on Evolutionary Computation
Advanced Algorithms and Applications
6.89
article

A Streaming Feature Selection Method Based on Dynamic Feature Clustering and Particle Swarm Optimization

Ying Hu, Yinan Guo, Zhang Yon, Hao Ma, Xianfang Song, Dunwei Gong
article en
21 citations

Abstract

Feature selection (FS) is an effective data preprocessing technique. In some practical applications, features may continuously arrive one by one or by groups, and we cannot know the exact number of features before learning. Streaming FS (SFS) aims to remove redundant and irrelevant features from the continuously arriving features. This article proposes a three-stage SFS method based on dynamic feature clustering and particle swarm optimization (SFS-DPSO). In the first stage, an online relevance analysis is utilized to quickly remove irrelevant features, reducing the size of newly arrived feature groups. In the second stage, a dynamic feature clustering technique is employed to divide redundant features into different groups, thereby reducing the search space for subsequent evolutionary algorithms. In the third stage, a historical information-driven integer particle swarm optimization algorithm is exploited to search for optimal feature subset in the clustered feature space. The proposed algorithm is applied in 12 typical datasets with different difficulty levels and a real-word case, experimental results show that it can achieve better-classification results in a reasonable time and is superior to most existing algorithms.

IEEE Transactions on Evolutionary ComputationVol. 29(5)
Qingdao University of Science and Technology (CN), China University of Mining and Technology (CN), Anhui Normal University (CN)
National Natural Science Foundation of China, China Postdoctoral Science Foundation, Natural Science Foundation of Anhui Province, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 2%
Advanced Algorithms and Applications
6.89
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.