An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
From MaRDI portal
Recommendations
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
- Reduction algorithms based on discernibility matrix: The ordered attributes method
- A core algorithm of attribute sets based on the discernibility matrix
- An algorithm for relative reduction based on simplified binary discernibility matrix
Cites work
Cited in
(9)- scientific article; zbMATH DE number 6612574 (Why is no real title available?)
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- Structural features of attribute reduction matrix and layer fast algorithm
- An efficient genetic reduction algorithm for rough sets
- Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
- A heuristic algorithm for attribute reduction based on discernibility and equivalence by attributes
- The attribute reduction algorithm based on parallel computing
- An algorithm for relative reduction based on simplified binary discernibility matrix
- Reduction algorithms based on discernibility matrix: The ordered attributes method
This page was built for publication: An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1933428)