模式识别与人工智能
Monday, Apr. 7, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2008, Vol. 21 Issue (4): 500-505    DOI:
Papers and Reports Current Issue| Next Issue| Archive| Adv Search |
XIONG Wei-Qing
Institute of Computer Science and Technology, Ningbo University, Ningbo 315211

Download: PDF (379 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  In this paper, a new algorithm for classification rule mining is proposed, which is based on binary ant colony optimization algorithm. Aiming at the long computing time, a mutation operator is involved. To avoid the local optima problem, a disaster operator is also introduced. The algorithm is applied to the dataset from UCI machine learning repository, and the result shows that the forecasting accuracy is improved greatly. Moreover, by the mutation operator and disaster operator, the computing time can be effectively saved and the local optima can be avoided.
Received: 07 December 2006     
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
XIONG Wei-Qing
Cite this article:   
XIONG Wei-Qing. [J]. , 2008, 21(4): 500-505.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2008/V21/I4/500
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