An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix (Q3079440): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:48, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix |
scientific article |
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
