Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
The Paradox of the Heap of Grains in Respect to Roughness, Fuzziness and Negligibility
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Preimage Relations and Their Matrices
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
On the Structure of Rough Approximations
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Rough Set Theory from a Math-Assistant Perspective
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Rough Set Based Personalized Recommendation in Mobile Commerce
AMT '09 Proceedings of the 5th International Conference on Active Media Technology
A note on a formal approach to rough operators
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Rough set and ensemble learning based semi-supervised algorithm for text classification
Expert Systems with Applications: An International Journal
A modal logic for multiple-source tolerance approximation spaces
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Generalized rough sets and implication lattices
Transactions on rough sets XIV
International Journal of Approximate Reasoning
Attribute reduction of data with error ranges and test costs
Information Sciences: an International Journal
On the Structure of Rough Approximations
Fundamenta Informaticae
| Hi-index | 0.00 |
In rough set theory it is supposed that the knowledge about objects is limited by an indiscernibility relation. Commonly indiscernibility relations are assumed to be equivalences interpreted so that two objects are equivalent if we cannot distinguish them by their properties. However, there are natural indiscernibility relations which are not transitive, and here we assume that the knowledge about objects is restricted by a tolerance relation R. We study R-approximations, R-definable sets, R-equalities, and investigate briefly the structure of R-rough sets.