 |
International Journal of Computer Science and Research
ISSN : 2210-9668
|
|
|
|
Abstract
| Title |
: |
ROUGH SET ON GENERALIZED COVERING APPROXIMATION SPACES |
| Authors |
: |
Dr Debadutta Mohanty |
| Keywords |
: |
Lower approximation, upper approximation, indiscernibility, rough sets, covering. 2000 AMS Classification No. 68 T 30, 92 J 40, 68 T 37.
|
| Issue Date |
: |
September 2010 |
| Abstract |
: |
An approach to capture impreciseness, Pawlak introduced the notion of rough sets, which is an excellent tool to capture indiscernibility of objects. An equivalence relation is the simplest formulization of the indiscernibility. The basic assumption of rough set theory is that human knowledge about a universe depends upon their capability to classify its objects. Classifications of a universe and equivalence relations defined on the universe are known to be interchangeable notions. So, for mathematical point of view, equivalence relations are considered to define rough set. An inexact set (A rough set) is represented by a pair of exact sets called the lower approximation and upper approximation of the set. The lower approximation of a rough set comprises of those elements of the universe which can be said to belong to it definitely with the available knowledge. The upper approximation comprises of those elements which are possibly in the set with respect to the available information (knowledge). In this note we introduced Covering Based Rough Sets which is an extension to the traditional (Z. Pawlak) Rough Sets. |
| Page(s) |
: |
43-49 |
| ISSN |
: |
2210-9668 |
| Source |
: |
Vol. 1, No.1 |
|
|
|
|
|