Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Speeding-Up ACO Implementation by Decreasing the Number of Heuristic Function Evaluations in Feature Selection Problem

Yudel GómezContact Information, Rafael BelloContact Information, Ann NowéContact Information and Frank BosmansContact Information

(1)  Department of Computer Science, Universidad Central de Las Villas, Cuba
(2)  Comp Lab, Department of Computer Science, Vrije Universiteit Brussel, Belgium
Abstract
In this paper we study a model to feature selection based on Ant Colony Optimization and Rough Set Theory. The algorithm looks for reducts by using ACO as search method and RST offers the heuristic function to measure the quality of one feature subset. Major results of using this approach are shown and others are referenced. Recently, runtime analyses of Ant Colony Optimization algorithms have been studied also. However the efforts are limited to specific classes of problems or simplified algorithm’s versions, in particular studying a specific part of the algorithms like the pheromone influence. From another point of view, this paper presents results of applying an improved ACO implementation which focuses on decreasing the number of heuristic function evaluations needed.

Contact Information Yudel Gómez
Email: ygomezd@uclv.edu.cu
URL: http://www.cei.uclv.edu.cu/

Contact Information Rafael Bello
Email: rbellop@uclv.edu.cu
URL: http://www.cei.uclv.edu.cu/

Contact Information Ann Nowé
Email: ann.nowe@vub.ac.be
URL: http://como.vub.ac.be/

Contact Information Frank Bosmans
Email: fpbosmans@vub.ac.be
URL: http://como.vub.ac.be/
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.80 • Server: mpweb06
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)