Searching for Reductive Attributes in Decision Tables
Most decision support systems based on rough set theory are related to the minimal reduct calculation problem, which is NP-hard. This paper investigates the problem of searching for the set of useful attributes that occur in at least one reduct. By complement, this problem is equivalent to searching for the set of redundant attributes, i.e. the attributes that do not occur in any reducts of the given decision table. We show that the considered problem is equivalent to a Sperner system for relational data base system and prove that it can be solved in polynomial time. On the base of these theoretical results, we also propose two different algorithms for elimination of redundant attributes in decision tables.
KeywordsRough sets Reducts Relational database Minimal keys Sperner system
- 1.Pawlak, Z.: Rough Sets-Theoretical Aspect of Reasoning About Data. Kluwer Academic Publishers, Norwell (1991)Google Scholar
- 4.Nguyen, L.G., Nguyen, H.S.: On elimination of redundant attributes in decision tables. In: 2012 Federated Conference on Computer Science and Information Systems (FedCSIS). IEEE, pp. 317–322 (2012)Google Scholar
- 10.Yao, Y.: Duality in rough set theory based on the square of opposition. Fundam. Inf. 127(1–4), 49–64 (2013)Google Scholar