Lower Assignment Reduction Algorithm for Relation Decision Systems

Abstract

Attribute reduction is an important and meaningful research in the field of rough set theory. Many reduction algorithms have been proposed based on different criteria. We now give an attribute reduction algorithm based on new criterion called the lower approximation assignment reductions, which enriches and improves the concept of assignment reductions in this paper. In addition, all reduction sets could be obtained by using our algorithms, while heuristic algorithms only return one reduction set. Also, we extend the lower assignment reduction algorithm for ordered decision systems and decision tables.