The attribute reduction algorithm based on parallel computing
From MaRDI portal
Publication:4597758
Recommendations
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- A parallel reduction algorithm of ordered information systems based on attribute partition
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- Parallel attribute reduction algorithms using MapReduce
- Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
Cited in
(7)- Parallel attribute reduction algorithm for unlabeled data based on fuzzy discernibility matrix and soft deletion behavior
- Rough Sets and Current Trends in Computing
- Parallel attribute reduction in dominance-based neighborhood rough set
- Parallel attribute reduction algorithms using MapReduce
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- Rough Sets and Current Trends in Computing
- A parallel reduction algorithm of ordered information systems based on attribute partition
This page was built for publication: The attribute reduction algorithm based on parallel computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4597758)