کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482773 | 1446229 | 2006 | 13 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Solving feature subset selection problem by a Parallel Scatter Search Solving feature subset selection problem by a Parallel Scatter Search](/preview/png/482773.png)
The aim of this paper is to develop a Parallel Scatter Search metaheuristic for solving the Feature Subset Selection Problem in classification. Given a set of instances characterized by several features, the classification problem consists of assigning a class to each instance. Feature Subset Selection Problem selects a relevant subset of features from the initial set in order to classify future instances. We propose two methods for combining solutions in the Scatter Search metaheuristic. These methods provide two sequential algorithms that are compared with a recent Genetic Algorithm and with a parallelization of the Scatter Search. This parallelization is obtained by running simultaneously the two combination methods. Parallel Scatter Search presents better performance than the sequential algorithms.
Journal: European Journal of Operational Research - Volume 169, Issue 2, 1 March 2006, Pages 477–489