- Title
- A fast meta-heuristic approach for the (α, ß) - k-feature set problem
- Creator
- Rocha de Paula, Mateus; Berretta, Regina; Moscato, Pablo
- Relation
- Journal of Heuristics Vol. 22, Issue 2, p. 199-220
- Publisher Link
- http://dx.doi.org/10.1007/s10732-015-9307-0
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2016
- Description
- The feature selection problem aims to choose a subset of a given set of features that best represents the whole in a particular aspect, preserving the original semantics of the variables on the given samples and classes. In 2004, a new approach to perform feature selection was proposed. It was based on a NP-complete combinatorial optimisation problem called (α, ß)-k-feature set problem. Although effective for many practical cases, which made the approach an important feature selection tool, the only existing solution method, proposed on the original paper, was found not to work well for several instances. Our work aims to cover this gap found on the literature, quickly obtaining high quality solutions for the instances that existing approach can not solve. This work proposes a heuristic based on the greedy randomised adaptive search procedure and tabu search to address this problem; and benchmark instances to evaluate its performance. The computational results show that our method can obtain high quality solutions for both real and the proposed artificial instances and requires only a fraction of the computational resources required by the state of the art exact and heuristic approaches which use mixed integer programming models.
- Subject
- (α, β)-k feature set problem; GRASP; tabu search; metaheuristics; set multi cover problem
- Identifier
- http://hdl.handle.net/1959.13/1321400
- Identifier
- uon:24348
- Identifier
- ISSN:1381-1231
- Language
- eng
- Reviewed
- Hits: 8357
- Visitors: 3006
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|