An Ant Colony Optimization Based Approach for Feature Selection

The International Congress for Global Science and Technology (ICGST)
Publication Type:
Conference Proceeding
AIML 2005 Proceedings, 2005, pp. 1 - 6
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2005002283.pdf472.19 kBAdobe PDF
This paper presents a new feature subset selection algorithm based on the Ant Colony Optimization (ACO). ACO is a metaheuristic inspired by the behaviour of real ants in their search for the shortest paths to food sources. It looks for optimal solutions by utilizing distributed computing, local heuristics and previous knowledge. We modified the ACO algorithm so that it can be used to search for the best subsets of features. A new pheromone trail update formula is presented, and the various parameters that lead to better convergence are tested. Results on speech classification problem show that the proposed algorithm achieves better performance than both greedy and genetic algorithm based feature selection methods.
Please use this identifier to cite or link to this item: