.png){kind=icon}
返回
UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2024.101715.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Feature selection (FS) is a crucial technique in machine learning and data mining, serving a variety of purposes such as simplifying model construction, facilitating knowledge discovery, improving computational efficiency, and reducing memory consumption. Despite its importance, the constantly increasing search space of highdimensional datasets poses significant challenges to FS methods, including issues like the curse of dimensionality, susceptibility to local optima, and high computational and memory costs. To overcome these challenges, a new FS algorithm named Uniform-solution-driven Binary Feature Selection (UniBFS) has been developed in this study. UniBFS exploits the inherent characteristic of binary algorithms-binary coding-to search the entire problem space for identifying relevant features while avoiding irrelevant ones. To improve the effectiveness and efficiency of the UniBFS algorithm, Redundant Features Elimination algorithm (RFE) is presented in this paper. RFE performs a local search in a very small subspace of the solutions obtained by UniBFS in different stages, and removes the redundant features which do not increase the classification accuracy. Moreover, the study proposes a hybrid algorithm that combines UniBFS with two filter-based FS methods, ReliefF and Fisher, to identify pertinent features during the global search phase. The proposed algorithms are evaluated on 30 high-dimensional datasets ranging from 2000 to 54676 dimensions, and their effectiveness and efficiency are compared with stateof-the-art techniques, demonstrating their superiority.
Keyword:
High-dimensional data classification
Evolutionary algorithms for selection
Swarm algorithms for selection
Binary feature selection algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
A survey on swarm intelligence approaches to feature selection in data mining数据挖掘中特征选择的群体智能方法综述
PREAI
分享收藏Variable-Length Particle Swarm Optimization for Feature Selection on High-Dimensional Classification高维分类特征选择的变长粒子群算法OAAI
OAAI分享收藏Correlation-Guided Updating Strategy for Feature Selection in Classification With Surrogate-Assisted Particle Swarm Optimization代理辅助粒子群优化分类中特征选择的相关性引导更新策略
PREAI
分享收藏Advances in nature-inspired metaheuristic optimization for feature selection problem: A comprehensive survey自然启发的特征选择问题的元启发式优化研究进展: 综合综述.png)
COMPUTER SCIENCE REVIEW
COMPUTER SCIENCE REVIEWIF12.7
PREAI
分享收藏Self-adaptive parameter and strategy based particle swarm optimization for large-scale feature selection problems with multiple classifiers基于自适应参数和策略的粒子群算法求解大规模多分类器特征选择问题OAAI
OAAI分享收藏
查看更多内容