A Granular Reduction Algorithm Based on Covering Rough Sets
Joint Authors
Li, Zhaowen
Yang, Tian
Yang, Xiaoqing
Source
Journal of Applied Mathematics
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-13, 13 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-08-30
Country of Publication
Egypt
No. of Pages
13
Main Subjects
Abstract EN
The granular reduction is to delete dispensable elements from a covering.
It is an efficient method to reduce granular structures and get rid of theredundant information from information systems.
In this paper, we developan algorithm based on discernability matrixes to compute all the granularreducts of covering rough sets.
Moreover, a discernibility matrix is simplifiedto the minimal format.
In addition, a heuristic algorithm is proposed as wellsuch that a granular reduct is generated rapidly.
American Psychological Association (APA)
Yang, Tian& Li, Zhaowen& Yang, Xiaoqing. 2012. A Granular Reduction Algorithm Based on Covering Rough Sets. Journal of Applied Mathematics،Vol. 2012, no. 2012, pp.1-13.
https://search.emarefa.net/detail/BIM-1029064
Modern Language Association (MLA)
Yang, Tian…[et al.]. A Granular Reduction Algorithm Based on Covering Rough Sets. Journal of Applied Mathematics No. 2012 (2012), pp.1-13.
https://search.emarefa.net/detail/BIM-1029064
American Medical Association (AMA)
Yang, Tian& Li, Zhaowen& Yang, Xiaoqing. A Granular Reduction Algorithm Based on Covering Rough Sets. Journal of Applied Mathematics. 2012. Vol. 2012, no. 2012, pp.1-13.
https://search.emarefa.net/detail/BIM-1029064
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1029064
