This work presents a novel GA-Taguchi-based feature selection method. Genetic algorithms are utilized with randomness for "global search" of the entire search space of the intractable search problem. Various genetic operations, including crossover, mutation, selection and replacement are performed to assist the search procedure in escaping from sub-optimal solutions. In each iteration in the proposed nature-inspired method, the Taguchi methods are employed for "local search" of the entire search space and thus can help explore better feature subsets for next iteration. The two-level orthogonal array is utilized for a well-organized and balanced comparison of two levels for features-a feature is or is not selected for pattern classification-and interactions among features. The signal-to-noise ratio (SNR) is then used to determine the robustness of the features. As a result, feature subset evaluation efforts can be significantly reduced and a superior feature subset with high classification performance can be obtained. Experiments are performed on different application domains to demonstrate the performance of the proposed nature-inspired method. The proposed hybrid GA-Taguchi-based approach, with wrapper nature, yields superior performance and improves classification accuracy in pattern classification. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Yang, C. H., Huang, C. C., Wu, K. C., & Chang, H. Y. (2008). A novel GA-Taguchi-based feature selection method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5326 LNCS, pp. 112–119). Springer Verlag. https://doi.org/10.1007/978-3-540-88906-9_15
Mendeley helps you to discover research relevant for your work.