AIDec 5, 2016

On a Well-behaved Relational Generalisation of Rough Set Approximations

arXiv:1612.01857v2
Originality Synthesis-oriented
AI Analysis

This work addresses a theoretical issue in rough set theory, likely of interest to researchers in formal methods or data analysis, but appears incremental as it builds on existing extensions and prior observations.

The paper tackles the problem of generalizing rough set approximations to non-dual relational extensions, finding an extension that satisfies many usual properties, and uses it to explain an observation from a prior survey on rough set systems and modal logics.

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].

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes