Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
Dominance-Based Rough Set Approach Using Possibility and Necessity Measures
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Brouwer-Zadeh posets and three-valued Ł ukasiewicz posets
Fuzzy Sets and Systems
Dominance-Based Rough Set Approach and Bipolar Abstract Rough Approximation Spaces
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Dominance-Based Rough Set Approach to Interactive Multiobjective Optimization
Multiobjective Optimization
Dominance-based rough set approach as a proper way of handling graduality in rough set theory
Transactions on rough sets VII
Algebraic structures for dominance-based rough set approach
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Bitopological duality for distributive lattices and heyting algebras
Mathematical Structures in Computer Science
Algebraic structures for rough sets
Transactions on Rough Sets II
Topological characterizations of covering for special covering-based upper approximation operators
Information Sciences: an International Journal
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Hi-index | 0.00 |
In this article, we characterize the Dominance-based Rough Set Approach (DRSA) from the point of view of its topological properties. Using the concept of a bitopological space, we extend to DRSA the classical results known for the original rough set approach. Moreover, we introduce a topological approach to ordinal classification. These considerations intend to strengthen theoretical foundations of DRSA, giving a deeper knowledge of its specific characteristics.