An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix (Q3079440): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-88914-4_75 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2407618088 / rank | |||
Normal rank | |||
Latest revision as of 22:42, 19 March 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
