An Efficient Algorithm for Determining the Set of All Reductive Attributes in Incomplete Decision Tables

Autor:	Demetrovics Janos, Thi Vu Duc, Giang Nguyen Long
Jazyk:	angličtina
Rok vydání:	2013
Předmět:	rough sets reducts incomplete decision tables tolerance matrix tolerance function Cybernetics Q300-390
Zdroj:	Cybernetics and Information Technologies, Vol 13, Iss 4, Pp 118-126 (2013)
Druh dokumentu:	article
ISSN:	1314-4081 2013-0058
DOI:	10.2478/cait-2013-0058
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/1b4f9ae096894c78928582fcafaee8de Zobrazit plný text záznamu View record in DOAJ