模式识别与人工智能
Saturday, Apr. 5, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2007, Vol. 20 Issue (3): 295-300    DOI:
Papers and Reports Current Issue| Next Issue| Archive| Adv Search |
Minimum Attribute Reduction Algorithm Based on Binary Particle Swarm Optimization
YE DongYi, LIAO JianKun
College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350002

Download: PDF (336 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  Based on binary particle swarm optimization, a minimum attribute reduction algorithm for a decision table is presented. A proper fitness function is defined. Thus, the minimum attribute reduction problem is equivalently transformed into a binary combinatorial optimization problem without additional nonlinear constraints. The concept of a seed particle is introduced with its protection strategy. Finally, an improved binary particle swarm optimization algorithm is proposed to solve the transformed problem. Experimental results show the effectiveness of the presented algorithm.
Key wordsMinimum Attribute Reduction      Fitness Function      Binary Particle Swarm Optimization      Seed Particle Protection     
Received: 04 July 2006     
ZTFLH: TP181  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
YE DongYi
LIAO JianKun
Cite this article:   
YE DongYi,LIAO JianKun. Minimum Attribute Reduction Algorithm Based on Binary Particle Swarm Optimization[J]. , 2007, 20(3): 295-300.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2007/V20/I3/295
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn