Experimental Comparison of Feature Subset Selection Using GA and ACO Algorithm

Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be classified. Exhaustive evaluation of possible feature subsets is usually infeasible in practice because of the large amount of computational effort required. Bio-inspired algorithms offer an attractive approach to find near-optimal solutions to such optimization problems. This paper presents an approach to feature subset selection using bioinspired algorithms. Our experiments with several benchmark real–world pattern classification problems demonstrate the feasibility of this approach to feature subset selection in the automated design of neural networks for pattern classification and knowledge discovery.

• Type: Conference
• Year: 2006
• Where: ADMA
• Authors: Keunjoon Lee, Jinu Joo, Jihoon Yang, Vasant Honavar
• Keywords: ADMA 2006, Data Mining, Feature Subset, Pattern Classification, Subset Selection