A Granular Reduction Algorithm Based on Covering Rough Sets

A Granular Reduction Algorithm Based on Covering Rough Sets

The granular reduction is to delete dispensable elements from a covering. It is an efficient method to reduce granular structures and get rid of the redundant information from information systems. In this paper, we develop an algorithm based on discernability matrixes to compute all the granular re...

Full description

Bibliographic Details
Main Authors: Tian Yang, Zhaowen Li, Xiaoqing Yang
Format: Article
Language:English
Published: Hindawi Limited 2012-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2012/970576
id doaj-cff66d44a0e44788a4a604467dde23ce
record_format Article
spelling doaj-cff66d44a0e44788a4a604467dde23ce2020-11-24T21:02:24ZengHindawi LimitedJournal of Applied Mathematics1110-757X1687-00422012-01-01201210.1155/2012/970576970576A Granular Reduction Algorithm Based on Covering Rough SetsTian Yang0Zhaowen Li1Xiaoqing Yang2College of Science, Central South University of Forestry and Technology, Changsha 410004, ChinaCollege of Mathematics and Computer Science, Guangxi University for Nationalities, Nanning 530006, ChinaSchool of Economics and Management, Changsha University of Science and Technology, Changsha 410004, ChinaThe granular reduction is to delete dispensable elements from a covering. It is an efficient method to reduce granular structures and get rid of the redundant information from information systems. In this paper, we develop an algorithm based on discernability matrixes to compute all the granular reducts of covering rough sets. Moreover, a discernibility matrix is simplified to the minimal format. In addition, a heuristic algorithm is proposed as well such that a granular reduct is generated rapidly.http://dx.doi.org/10.1155/2012/970576
collection DOAJ
language English
format Article
sources DOAJ
author Tian Yang
Zhaowen Li
Xiaoqing Yang
spellingShingle Tian Yang
Zhaowen Li
Xiaoqing Yang
A Granular Reduction Algorithm Based on Covering Rough Sets
Journal of Applied Mathematics
author_facet Tian Yang
Zhaowen Li
Xiaoqing Yang
author_sort Tian Yang
title A Granular Reduction Algorithm Based on Covering Rough Sets
title_short A Granular Reduction Algorithm Based on Covering Rough Sets
title_full A Granular Reduction Algorithm Based on Covering Rough Sets
title_fullStr A Granular Reduction Algorithm Based on Covering Rough Sets
title_full_unstemmed A Granular Reduction Algorithm Based on Covering Rough Sets
title_sort granular reduction algorithm based on covering rough sets
publisher Hindawi Limited
series Journal of Applied Mathematics
issn 1110-757X
1687-0042
publishDate 2012-01-01
description The granular reduction is to delete dispensable elements from a covering. It is an efficient method to reduce granular structures and get rid of the redundant information from information systems. In this paper, we develop an algorithm based on discernability matrixes to compute all the granular reducts of covering rough sets. Moreover, a discernibility matrix is simplified to the minimal format. In addition, a heuristic algorithm is proposed as well such that a granular reduct is generated rapidly.
url http://dx.doi.org/10.1155/2012/970576
work_keys_str_mv AT tianyang agranularreductionalgorithmbasedoncoveringroughsets
AT zhaowenli agranularreductionalgorithmbasedoncoveringroughsets
AT xiaoqingyang agranularreductionalgorithmbasedoncoveringroughsets
AT tianyang granularreductionalgorithmbasedoncoveringroughsets
AT zhaowenli granularreductionalgorithmbasedoncoveringroughsets
AT xiaoqingyang granularreductionalgorithmbasedoncoveringroughsets
_version_ 1716775457733476352

Similar Items