摘要: Feature selection (FS) aims to determine a minimal feature (attribute) 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 paper describes the fundamental ideas behind RST-based approaches, reviews related FS methods built on these ideas, and analyses more frequently used RST-based traditional FS algorithms such as Quickreduct algorithm, entropy based reduct algorithm, and relative reduct algorithm. It is found that some of the drawbacks in the existing algorithms and our proposed improved algorithms can overcome these drawbacks. The experimental analyses have been carried out in order to achieve the efficiency of the proposed algorithms.