期刊
NEUROCOMPUTING
卷 148, 期 -, 页码 150-157出版社
ELSEVIER
DOI: 10.1016/j.neucom.2012.09.049
关键词
Feature selection; Bare bones particle swarm; Reinforced memory; Uniform combination; 1-Nearest neighbor
资金
- Fundamental Research Funds for the Central Universities [2013QNA51]
- Natural Science Foundation of Jiangsu province [BK2011215]
- China Postdoctoral Science Foundation [2012M521142]
Feature selection is a useful pre-processing technique for solving classification problems. As an almost parameter-free optimization algorithm, the bare bones particle swarm optimization (BPSO) has been applied to the topic of optimization on continuous or integer spaces, but it has not been applied to feature selection problems with binary variables. In this paper, we propose a new method to find optimal feature subset by the BPSO, called the binary BPSO. In this algorithm, a reinforced memory strategy is designed to update the local leaders of particles for avoiding the degradation of outstanding genes in the particles, and a uniform combination is proposed to balance the local exploitation and the global exploration of algorithm. Moreover, the 1-nearest neighbor method is used as a classifier to evaluate the classification accuracy of a particle. Some international standard data sets are selected to evaluate the proposed algorithm. The experiments show that the proposed algorithm is competitive in terms of both classification accuracy and computational performance. (C) 2014 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据