An efficient algorithm for Pawlak reduction based on simplified discernibility matrix (Q3079440)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5859631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for Pawlak reduction based on simplified discernibility matrix |
scientific article; zbMATH DE number 5859631 |
Statements
An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix (English)
0 references
2 March 2011
0 references
rough set
0 references
discernibility matrix
0 references
simplified discernibility matrix
0 references
attribute reduction
0 references
complexity
0 references
0.9859861731529236
0 references
0.9267183542251588
0 references
0.8645639419555664
0 references
0.8627914190292358
0 references
0.8576376438140869
0 references
