Abstract—Attribute reduction of an information system is a key problem in rough set theory and its application. It has been proven that finding the minimal reduct of an information system is a NP-hard problem. Main reason of causing NP-hard is combination problem. In this paper, we theoretically study covering rough sets and propose an attribute reduction algorithm of decision systems. It based on results of Chen Degang et al in consistent and inconsistent covering decision system. The time complexity of this algorithm is O(|Δ||U|2). Two illustrative examples are provided that shows the application potential of the algorithm.
Index Terms—Attribute Reduction, Covering Decision System, Covering Rough Sets, Consistent and Inconsistent Decision System.
Thuan Nguyen Duc was born in Hue, Vietnam, 1962
Brief Biographical History:
-1985, Bachelor in Mathematics- Lecturer of Hue University, Vietnam.
-1998, Master in Information Technology, Lecturer of Nha Trang University, Vietnam.
-2006, Ph.D Student in Institute of Information Technology, Vietnamese academy of Science and Technology.
Current research: Rough set, Datamining, Distributed Database...
[PDF]
Cite: Nguyen Duc Thuan, "A Family of Covering Rough Sets Based Algorithm for Reduction of Attributes,"
International Journal of Computer Theory and Engineering vol. 2, no. 2, pp. 180-184, 2010.
