An efficient algorithm for Pawlak reduction based on simplified discernibility matrix (Q1933428): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s12543-010-0061-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080250161 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rough sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rough sets: probabilistic versus deterministic approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ROUGH SET THEORY AND ITS APPLICATIONS TO DATA ANALYSIS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reduction algorithms based on discernibility matrix: The ordered attributes method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rough reduction in algebra view and information view / rank | |||
Normal rank | |||
Latest revision as of 02:43, 6 July 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
24 January 2013
0 references
rough set
0 references
discernibility matrix
0 references
simplified discernibility matrix
0 references
attribute reduction
0 references
complexity
0 references
