Abstract
Feature selection aims to determine a minimal feature subset from a problem domain while retaining a suitably high accuracy in representing the original features. Rough set theory (RST) has been used as such a tool with much success. RST enables the discovery of data dependencies and the reduction of the number of attributes contained in a dataset using the data alone, requiring no additional information. This chapter describes the fundamental ideas behind RST-based approaches and reviews related feature selection methods that build on these ideas. Extensions to the traditional rough set approach are discussed, including recent selection methods based on tolerance rough sets, variable precision rough sets and fuzzy-rough sets. Alternative search mechanisms are also highly important in rough set feature selection. The chapter includes the latest developments in this area, including RST strategies based on hill-climbing, genetic algorithms and ant colony optimization.
| Original language | English |
|---|---|
| Title of host publication | Rough Computing |
| Subtitle of host publication | Theories, Technologies and Applications |
| Editors | Aboul-Ella Hassanien, Zbigniew Suraj, Dominik Slezak, Pawan Lingras |
| Publisher | Information Science Reference |
| Pages | 70-107 |
| Number of pages | 38 |
| ISBN (Print) | 978-1599045528 |
| DOIs | |
| Publication status | Published - 15 Nov 2007 |