Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/2490

 Title: On the Time Complexity of the Problem Related to Reducts of Consistent Decision Tables Authors: Janos, DemetrovicsThi, Vu DucGiang, Nguyen LongDuong, Tran Huy Keywords: Decision TableReductRelationRelation SchemaMinimal SetTime Complexity Issue Date: 2015 Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences Citation: Serdica Journal of Computing, Vol. 9, No 2, (2015), 167p-176p Abstract: In recent years, rough set approach computing issues concerning reducts of decision tables have attracted the attention of many researchers. In this paper, we present the time complexity of an algorithm computing reducts of decision tables by relational database approach. Let DS = (U, C ∪ {d}) be a consistent decision table, we say that A ⊆ C is a relative reduct of DS if A contains a reduct of DS. Let s = be a relation schema on the attribute set C ∪ {d}, we say that A ⊆ C is a relative minimal set of the attribute d if A contains a minimal set of d. Let Qd be the family of all relative reducts of DS, and Pd be the family of all relative minimal sets of the attribute d on s. We prove that the problem whether Qd ⊆ Pd is co-NP-complete. However, the problem whether Pd ⊆ Qd is in P . URI: http://hdl.handle.net/10525/2490 ISSN: 1312-6555 Appears in Collections: Volume 9 Number 2

Files in This Item:

File Description SizeFormat