粗糙集约简算法精选.pdfVIP

Available online at Pattern Recognition Letters 29 (2008) 1351–1357 /locate/patrec An efficient ant colony optimization approach to attribute reduction in rough set theory Liangjun Ke *, Zuren Feng, Zhigang Ren State Key Laboratory for Manufacturing Systems Engineering, Xi’an Jiaotong University, Xi’an 710049, China Received 11 September 2006; received in revised form 6 December 2007 Available online 4 March 2008 Communicated by S.K. Pal Abstract Attribute reduction in rough set theory is an important feature selection method. Since attribute reduction is an NP-hard problem, it is necessary to investigate fast and effective approximate algorithms. In this paper, we introduce a new approach based on ant colony optimization (ACO) for attribute reduction. To verify the proposed algorithm, numerical experiments are carried out on thirteen small or medium-sized datasets and three gene expression datasets. The results demonstrate that this algorithm can provide competitive solu- tions efficiently. 2008 Elsevier B.V. All rights reserved. Keywords: Ant colony optimization; Attribute reduction; Feature selection; Rough set theory 1. Introduction hard problem (Wong and Ziarko, 1985). Due to the fact that hill-climbing algorithms often fail to find optimal solu- With the proliferation of high-dimensional data, featu