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. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gómez, Y., Bello, R., Nowé, A., & Bosmans, F. (2009). Speeding-up ACO implementation by decreasing the number of heuristic function evaluations in feature selection problem. In Advances in Soft Computing (Vol. 49, pp. 223–232). https://doi.org/10.1007/978-3-540-85861-4_27
Mendeley helps you to discover research relevant for your work.