A reduct derived from feature selection

摘要

In this paper, the relationship between a selected subset of attribute set of a decision system via feature selection by an optimal algorithm and a reduct of attribute set under the meaning of Pawlak's rough set is discussed. This selected subset is considered as a solution of the optimal algorithm. It is verified that a locally optimal solution is surely not a reduct while a reduct must be a globally optimal solution. Based on these assertions, a new optimal algorithm, called blindly deleting algorithm with an inverse ordering (BDAIO), is proposed to find a real reduct of a decision information system by remedying the selected attribute subset. Several standard data sets from UCI repository are implemented showing validity of the proposal.