Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Montazeri, Mitraa; b
Affiliations: [a] Computer Engineering Department, Shahid Bahonar University, Kerman, Iran | [b] Medical Informatics Research Center, Institute for Futures Studies in Health, Kerman University of Medical Sciences, Kerman, Iran E-mail: mmontazeri@eng.uk.ac.ir
Abstract: Feature selection is an important machine learning field which can provide a key role for the challenging problem of classifying high-dimensional data. This problem is finding effective features among the set of all features in such that the final feature set can improve accuracy and reduce complexity. Since feature selection is an NP-Hard problem, many heuristic algorithms have been studied so far to solve this problem. In this paper, we propose a novel method based on hyper-heuristic approach to find an efficient proper feature subset which is named Hyper-Heuristic Feature Selection (HHFS). In the proposed method, Low level heuristics are categorized into two groups: the first group contains exploiters which cause to exploit the search space efficiently by improving the quality of the candidate solution at hand; the second one includes explorer heuristics which explore the solution space by dwelling on random perturbations. Since each region of the solution space can have its own characteristics, an appropriate low level heuristic should be selected and applied to the current solution. We propose Genetic Algorithm to select among the set of low level heuristic and balance between exploitation and exploration. It chooses the low level heuristic based on the existing functional history of low level heuristic. We aim to investigate the role of cooperation between low level heuristics within a hyper-heuristic framework to find the best feature subset. Since different low level heuristics have different strengths and weaknesses, we believe that cooperation can allow the strengths of one low level heuristic to compensate for the weaknesses of another. In this study, we also propose Adaptive Hyper-Heuristic Feature Selection (AHHFS) which is an extension of HHFS. Empirical study of the proposed method on several commonly used data sets from UCI repository indicates that it outperforms recent methods in the literature for feature selection.
Keywords: Feature selection, hyper-heuristic approach, meta-heuristic algorithms, memetic algorithms, local search
DOI: 10.3233/IDA-160840
Journal: Intelligent Data Analysis, vol. 20, no. 4, pp. 953-974, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl