Attribute reduction using functional dependency relations in rough set theory

This paper presents some functional dependency relations defined on the attribute set of an information system. We establish some basic relationships between functional dependency relations, attribute reduction, and closure operators. We use the partial order for dependencies to show that reducts of an information system can be obtained from the maximal elements of a functional dependency relation