A distance based incremental filter-wrapper algorithm for finding reduct in incomplete decision tables

Abstract

Tolerance rough set model is an effective tool for attribute reduction in incomplete decision tables. In recent years, some incremental algorithms have been proposed to find reduct of dynamic incomplete decision tables in order to reduce computation time. However, they are classical filter algorithms, in which the classification accuracy of decision tables is computed after obtaining reduct. Therefore, the obtained reducts of these algorithms are not optimal on cardinality of reduct and classification accuracy. In this paper, we propose the incremental filter-wrapper algorithm to find one reduct of an incomplete desision table in case of adding multiple objects. The experimental results on some datasets show that the proposed filter-wrapper algorithm is more effective than the filter algorithm on classification accuracy and cardinality of reduct.