کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1134274 | 1489099 | 2014 | 8 صفحه PDF | دانلود رایگان |
• Exponential Monte-Carlo algorithm for feature selection problem.
• The proposed algorithm has few parameters that need to be set in advance.
• The proposed algorithm produced new best results compared to other methods.
Feature selection problems (FS) can be defined as the process of eliminating redundant features while avoiding information loss. Due to that fact that FS is an NP-hard problem, heuristic and meta-heuristic approaches have been widely used by researchers. In this work, we proposed an Exponential Monte-Carlo algorithm (EMC-FS) for the feature selection problem. EMC-FS is a meta-heuristic approach which is quite similar to a simulated annealing algorithm. The difference is that no cooling schedule is required. Improved solutions are accepted and worse solutions are adaptively accepted based on the quality of the trial solution, the search time and the number of consecutive non-improving iterations. We have evaluated our approach against the latest methodologies in the literature on standard benchmark problems. The quality of the obtained subset of features has also been evaluated in terms of the number of generated rules (descriptive patterns) and classification accuracy. Our research demonstrates that our approach produces some of the best known results.
Journal: Computers & Industrial Engineering - Volume 67, January 2014, Pages 160–167