|
|
|
|
A granular reduction algorithm based on covering rough sets
|
|
|
|
|
|
|
|
نویسنده
|
yang t. ,li z. ,yang x.
|
|
منبع
|
journal of applied mathematics - 2012 - دوره : 2012 - شماره : 0
|
|
چکیده
|
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. © 2012 tian yang et al.
|
|
|
|
|
آدرس
|
college of science,central south university of forestry and technology, China, college of mathematics and computer science,guangxi university for nationalities, China, school of economics and management,changsha university of science and technology, China
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|