An Efficient Algorithm for Determining the Set of All Reductive Attributes in Incomplete Decision Tables
, and | Dec 31, 2013
Cybernetics and Information Technologies
The publishing of the present issue (Volume 13, No 4, 2013) of the journal “Cybernetics and Information Technologies” is financially supported by FP7 project “Advanced Computing for Innovation” (ACOMIN), grant agreement 316087 of Call FP7 REGPOT-2012-2013-1.
About this article
Published Online: Dec 31, 2013
Page range: 118 - 126
DOI: https://doi.org/10.2478/cait-2013-0058
This content is open access.
In rough set theory, the number of all reducts for a given decision table can be exponential with respect to the number of attributes. This paper investigates the problem of determining the set of all reductive attributes which are present in at least one reduct of an incomplete decision table. We theoretically prove that this problem can be solved in polynomial time. This result shows that the problem of determining the union of all reducts can be solved in polynomial time, and the problem of determining the set of all redundant attributes which are not present in any reducts can also be solved in polynomial time.