.png){kind=icon}
.png){kind=icon}
Return
Matrix-based fast granularity reduction algorithm of multi-granulation rough set
.png){kind=icon}
PRE
AI
DOI：10.1007/s10462-022-10276-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In order to overcome the limitation of low efficiency of existing granularity reduction algorithms in multi-granulation rough sets, based on matrix method, a fast granularity reduction algorithm is proposed and the time complexity is O(vertical bar U vertical bar(2) . vertical bar A vertical bar + vertical bar U vertical bar . vertical bar A vertical bar(2)). First, the definitions of positive region matrix and granularity column matrix of multi-granulation space are proposed. Second, through the quantity product of these two matrices, the definition of positive region column matrix is presented. Based on the positive region column matrix, cut matrix and matrix norm are defined, respectively. Third, the matrix-based calculation methods of multi-granulation approximation quality and granularity significance are proposed. Finally, a heuristic rule is designed according to the granularity significance, and a matrix-based fast granularity reduction algorithm is proposed. Experimental results demonstrate the effectiveness of the proposed methods.
Keywords:
Multi-granulation rough set
Granularity reduction
Matrix
Granularity significance
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W