scispace - formally typeset
Open AccessBook ChapterDOI

Generalized Ideals and Co-granular Rough Sets

A. Mani
- pp 23-42
Reads0
Chats0
TLDR
This research will be of relevance for a number of logico-algebraic approaches to rough sets that proceed from point-wise definitions of approximations and also for using alternative approximation in spatial mereological contexts involving actual contact relations.
Abstract
Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to obtain nice properties comparable to those of classical rough approximations. In this research paper, these ideas are generalized in a severe way by the present author and associated semantic features are investigated by her. Granules are used in the construction of approximations in implicit ways and so a concept of co-granularity is introduced. Knowledge interpretation associable with the approaches is also investigated. This research will be of relevance for a number of logico-algebraic approaches to rough sets that proceed from point-wise definitions of approximations and also for using alternative approximations in spatial mereological contexts involving actual contact relations. The antichain based semantics invented in earlier papers by the present author also applies to the contexts considered.

read more

Citations
More filters
Journal ArticleDOI

Granulation selection and decision making with multigranulation rough set over two universes

TL;DR: This paper defines several measurements to compare the granularity of neighborhood granulations, and generates “OR” and “AND” decision rules based on multigranulation fusion strategies that are employed to make decisions in the presence of disease diagnosis problems.
Book ChapterDOI

Comparative Approaches to Granularity in General Rough Sets

TL;DR: This expository paper is intended to explain basic aspects of granular computing from a critical perspective, their range of applications and provide directions relative to general rough sets and related formal approaches to vagueness.
Posted Content

High Granular Operator Spaces, and Less-Contaminated General Rough Mereologies

TL;DR: Higher order versions of granular operator spaces and variants are presented uniformly as partial algebraic systems for generalizing Skowron-Polkowski style of rough mereology and further algorithms grounded in mereological nearness, suited for decision-making in human-machine interaction contexts, are proposed.
Book ChapterDOI

Algebraic Representation, Dualities and Beyond

TL;DR: In this research chapter, dualities and representations of various kinds associated with the semantics of rough sets are explained, critically reviewed, new proofs have been proposed, open problems are specified and new directions are suggested.
References
More filters
Book ChapterDOI

Antichain Based Semantics for Rough Sets

TL;DR: It is shown that even when the approximation operators are poorly behaved, some semantics with good structure and computational potential can be salvaged.
Journal Article

Ontology, rough Y-systems and dependence

TL;DR: The philosophical connections between Rough YSystems RYS, mereology and concepts in applied ontology, the concept of contamination-free rough dependence is introduced and this is compared to possible concepts of probabilistic dependence.
Book ChapterDOI

Knowledge and Consequence in AC Semantics for General Rough Sets

TL;DR: The epistemological aspects of the semantics are studied in this chapter in some depth and revolve around nature of knowledge representation, Peircean triadic semiotics and temporal aspects of parthood.
Proceedings ArticleDOI

Contamination-free measures and algebraic operations

TL;DR: In this paper, the authors propose methods and semantics for handling possibly contaminated operations and structured bigness in rough Y-systems (RYS) for developing on granular correspondences, which are used for comparison of rough algebraic semantics across different semantic domains by way of correspondences that preserve rough evolution and try to avoid contamination.
Journal Article

Super Rough Semantics

TL;DR: In this paper, a new algebraic semantics of rough set theory including additional meta aspects is proposed, which is based on enhancing the standard Rough Set Theory with notions of "relative ability of subsets of approximation spaces to approximate".