Computing Approximations of Dominance-Based Rough Sets by Bit-Vector Encodings
From MaRDI portal
Recommendations
- Dominance-Based Rough Set Approach and Bipolar Abstract Rough Approximation Spaces
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Variable-Precision Dominance-Based Rough Set Approach
- A parallel matrix-based approach for computing approximations in dominance-based rough sets approach
- Dominance-based rough set approach: basic ideas and main trends
- Several reducts in dominance-based rough set approach
- Covering based rough set approximations
- A Semantical Approach to Rough Sets and Dominance-Based Rough Sets
- scientific article; zbMATH DE number 1927336
Cites work
- scientific article; zbMATH DE number 3976764 (Why is no real title available?)
- scientific article; zbMATH DE number 1931900 (Why is no real title available?)
- scientific article; zbMATH DE number 1424339 (Why is no real title available?)
- Rough approximation of a preference relation by dominance relations
- Rough set-based logics for multicriteria decision analysis
- Rough sets methodology for sorting problems in presence of multiple attributes and criteria
- Rough sets theory for multicriteria decision analysis
- Transactions on Rough Sets II
This page was built for publication: Computing Approximations of Dominance-Based Rough Sets by Bit-Vector Encodings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541054)