On a Well-behaved Relational Generalisation of Rough Set Approximations

12/05/2016
by   Alexa Gopaulsingh, et al.
0

We examine non-dual relational extensions of rough set approximations and find an extension which satisfies surprisingly many of the usual rough set properties. We then use this definition to give an explanation for an observation made by Samanta and Chakraborty in their recent paper [P. Samanta and M.K. Chakraborty. Interface of rough set systems and modal logics: A survey. Transactions on Rough Sets XIX, pages 114-137, 2015].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2021

Rough Sets in Graphs Using Similarity Relations

In this paper, we use theory of rough set to study graphs using the conc...
research
06/28/2011

Class-based Rough Approximation with Dominance Principle

Dominance-based Rough Set Approach (DRSA), as the extension of Pawlak's ...
research
01/21/2021

Fire Threat Detection From Videos with Q-Rough Sets

This article defines new methods for unsupervised fire region segmentati...
research
04/10/2019

Efficient Retrieval of Logos Using Rough Set Reducts

Searching for similar logos in the registered logo database is a very im...
research
11/17/2018

Logics for Rough Concept Analysis

Taking an algebraic perspective on the basic structures of Rough Concept...
research
02/01/2011

Information-theoretic measures associated with rough set approximations

Although some information-theoretic measures of uncertainty or granulari...
research
01/04/2020

Restricted Rules of Inference and Paraconsistency

We present here two logical systems - intuitionistic paraconsistent weak...

Please sign up or login with your details

Forgot password? Click here to reset