Infobright Analytic Database Engine Using Rough Sets and Granular Computing

2010 ◽  
Author(s):  
Dominik Slezak ◽  
Piotr Synak ◽  
Jakub Wróblewski ◽  
Graham Toppin
Keyword(s):  
Rough Sets ◽  
Granular Computing ◽  
Database Engine

Granular Computing and Rough Sets

2006 ◽  
pp. 535-561 ◽  
Author(s):  
Tsau Young (’T. Y.’) Lin ◽  
Churn-Jung Liau
Keyword(s):  
Rough Sets ◽  
Granular Computing

Multi-Granular Computing through Rough Sets

2014 ◽  
pp. 1-34 ◽  
Author(s):  
B. K. Tripathy
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Equivalence Relation ◽  
Rough Sets ◽  
Intelligent Systems ◽  
Granular Computing ◽  
Rough Set Theory ◽  
Point Of View ◽  
Information Granules ◽  
Computing Platform

Granular Computing has emerged as a framework in which information granules are represented and manipulated by intelligent systems. Granular Computing forms a unified conceptual and computing platform. Rough set theory put forth by Pawlak is based upon single equivalence relation taken at a time. Therefore, from a granular computing point of view, it is single granular computing. In 2006, Qiang et al. introduced a multi-granular computing using rough set, which was called optimistic multigranular rough sets after the introduction of another type of multigranular computing using rough sets called pessimistic multigranular rough sets being introduced by them in 2010. Since then, several properties of multigranulations have been studied. In addition, these basic notions on multigranular rough sets have been introduced. Some of these, called the Neighborhood-Based Multigranular Rough Sets (NMGRS) and the Covering-Based Multigranular Rough Sets (CBMGRS), have been added recently. In this chapter, the authors discuss all these topics on multigranular computing and suggest some problems for further study.

Algebraic Properties of Rough Set on Two Universal Sets based on Multigranulation

2014 ◽  
Vol 1 (2) ◽  
pp. 49-61 ◽  
Author(s):  
Mary A. Geetha ◽  
D. P. Acharjya ◽  
N. Ch. S. N. Iyengar
Keyword(s):  
Information System ◽  
Rough Set ◽  
Equivalence Relation ◽  
Rough Sets ◽  
Granular Computing ◽  
Real Life ◽  
Equivalence Relations ◽  
Life Problems ◽  
Algebraic Properties ◽  
The Universe

The rough set philosophy is based on the concept that there is some information associated with each object of the universe. The set of all objects of the universe under consideration for particular discussion is considered as a universal set. So, there is a need to classify objects of the universe based on the indiscernibility relation (equivalence relation) among them. In the view of granular computing, rough set model is researched by single granulation. The granulation in general is carried out based on the equivalence relation defined over a universal set. It has been extended to multi-granular rough set model in which the set approximations are defined by using multiple equivalence relations on the universe simultaneously. But, in many real life scenarios, an information system establishes the relation with different universes. This gave the extension of multi-granulation rough set on single universal set to multi-granulation rough set on two universal sets. In this paper, we define multi-granulation rough set for two universal sets U and V. We study the algebraic properties that are interesting in the theory of multi-granular rough sets. This helps in describing and solving real life problems more accurately.

Sign in / Sign up

Export Citation Format

Share Document