Independence of Redundant Attributes in the Attribute Reduction Algorithm

Abstract

We proposed an attribute reduction algorithm of decision system. It based on a family covering rough set. In this Algorithm, the independence of redundant attributes is critical to the correctness and complexity of the algorithm. This paper presents removing a redundant attribute does not affect the property of a nonredundant attribute.

Keywords: redundant attribute, attribute reduction, decision system, covering rough sets, consistent decision system.