doi: 10.7763/IJCTE.2010.V2.137
A Family of Covering Rough Sets Based Algorithm for Reduction of Attributes
- 1University, Vietnam.
- 2Institute of Information Technology, Vietnamese academy of Science and Technology.
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.
Keywords
- Attribute Reduction
- Covering Decision System
- Covering Rough Sets
- Consistent and Inconsistent Decision System
How to 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. https://doi.org/10.7763/IJCTE.2010.V2.137
Copyright & License
Copyright © 2010 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).