返回
Chaotic maps based on binary particle swarm optimization for feature selection
DOI:10.1016/j.asoc.2009.11.014.png)
摘要
En 中文
Feature selection is a useful pre-processing technique for solving classification problems. The challenge of solving the feature selection problem lies in applying evolutionary algorithms capable of handling the huge number of features typically involved. Generally, given classification data may contain useless, redundant or misleading features. To increase classification accuracy, the primary objective is to remove irrelevant features in the feature space and to correctly identify relevant features. Binary particle swarm optimization (BPSO) has been applied successfully to solving feature selection problems. In this paper, two kinds of chaotic maps-so-called logistic maps and tent maps-are embedded in BPSO. The purpose of chaotic maps is to determine the inertia weight of the BPSO. We propose chaotic binary particle swarm optimization (CBPSO) to implement the feature selection, in which the K-nearest neighbor (K-NN) method with leave-one-out cross-validation (LOOCV) serves as a classifier for evaluating classification accuracies. The proposed feature selection method shows promising results with respect to the number of feature subsets. The classification accuracy is superior to other methods from the literature. (c) 2009 Elsevier B.V. All rights reserved.
Keyword:
Feature selection
Binary particle swarm optimization
Chaotic maps
K-nearest neighbor
Leave-one-out cross-validation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
An application of Chen system for secure chaotic communication based on extended Kalman filter and multi-shift cipher algorithm基于扩展卡尔曼滤波和多移位密码算法的Chen系统在保密混沌通信中的应用
A hybrid genetic algorithm and particle swarm optimization for multimodal functions一种求解多峰函数的混合遗传粒子群算法

