International Journal of Recent Development in Engineering and Technology

Website: www.ijrdet.com (ISSN 2347-6435 (Online)) Volume 10, Issue 5, May 2021)

A Note on Covering Based Soft Rough Set

Kedar Chandra Parida1, Debadutta Mohanty 2
1
Reader in Mathematics, B.B.College(MSCBDU), Baiganbadia, Mayurbhanj, Odisha, India, 757105
2
Reader in Mathematics, SMV, Jharpokharia, Mayurbhanj, Odisha, India, 757086

Abstract— Revising the theories and examining the The mathematical approaches are probability theory,
principles of rough sets, the scholars of mathematics fuzzy set theory, rough set theory, vague set theory,
have advanced the model of covering based rough set and
covering based soft sets to address the domain of the soft set theory, neutrosophic set theory etc. Moreover,
impreciseness of the objects. Further the combination combination of these theories is advanced by so many
of the theory of rough set and soft set are adduced with researchers to address the difficulties of uncertainty
approximation operators to develop new model
more effectively. Rough Fuzzy set, Fuzzy rough set,
“Covering Based Soft Rough Set” for dealing the
problem of impreciseness. This paper is aimed at intuitionstic fuzzy set and rough intuitionstic fuzzy
defining covering based soft rough set without using set, soft rough set, rough soft set, fuzzy soft set,
full soft set a new model to handle the issues of the rough fuzzy soft set, covering based rough set,
vagueness of objects.
In addition, this new model has been defined in four covering based soft set and so many are the developed
different manners with the help of lower and upper theories of the combination of theories. In this
approximation operators. . article we aim at introducing a new type of
combination i.e. covering based soft rough set to handle
Keywords— Rough set, soft set, covering based rough the issues of impreciseness of objects arid imperfect
set, soft rough set, covering based soft rough set.
knowledge convincingly.
I. INTRODUCTION This new type combination would hopefully add a
From time immemorial the problem of imperfect new leaf in the field of research on soft set theory
knowledge has been a crucial issue for one and all and application introduced by Molodstov in 1999 to
especially for the philosophers, logicians and tackle the problem of uncertainty.
mathematicians. Their innov a t i v e a p p r o a c h e s h a v e
addressed the problem for long time. After Z Pawlak [8], the researchers define a notion
H o w e v e r , i n this age of knowledge explosion and covering based rough set in various ways in
information bombardment Professor Z.Pawlak, the ([1],[5],[10],[13],[15]). Soft set (1999) is introduced by
great Polish mathematician and computer scientist D.Molodstov ([7]) and then covering soft set is
has left a milestone in Mathematics introducing defined by Saziye Yuksel et al ([12]) using the full
Rough Set Theory a new mathematical application in soft set. Soft rough set ,the combination of rough
1982 to tackle the serious problem of imperfect set and soft set is studied by Feng Feng et al ([2])
knowledge related to uncertainty, ambivalence, and D.Mohanty ([6]). In this note we introduced
impreciseness and vagueness of object and four types of covering based soft rough set which are
information. The introduction and application of different from soft covering based rough set given by
rough set theory has encouraged enormous research ([11],[12]). At the end we find covering based soft
during the years in different areas giving new rough set in a new manner in which full soft set is not
mathematical approaches to deal with considered.
thecomplicated problems of uncertainty emerge in
different fields in our everyday life as well as different
branches of knowledge.
1
 International Journal of Recent Development in Engineering and Technology
Website: www.ijrdet.com (ISSN 2347-6435 (Online)) Volume 10, Issue 5, May 2021)
II. ROUGH SET D. Definion (Minimum Description of x)
The main advantage of rough set theory is that it does not
need any preliminary or additional information about data. Let (U, C) be a covering approximation space .
The rough set approach is based on knowledge with Then the minimal description of x ( x U ) is defined
as
granular structure, which is caused by the situation when
Md(x) = {K : K Cx ∧ ( ∀ S C x (S ⊆ K
objects of interest can be distinguished and may appear to
K = S ) } , where C x = {K C : x K }. For any x
be identical. The indiscernibility relation (that is U, C x is called the indiscernible neighbor hood of
equivalence relation or knowledge) thus generated is the x. Also P(U),the power set of U , be defined as the
mathematical basis of Pawlak’s Rough Set Theory. set of all subsets of U.

A. Definition : (Approximation Space)

E. Example:
Let U = {a, b, c, d}, C = {{a, b}, {b, d}, {c}, {c,d},{b,
Let U be a universe of discourse, a finite set and R be
c, d}}, be a covering of U .Then Md(a) = {a,b}, Md (b)
an equivalence relation (knowledge) on U. R will
provide a partition U/R = {Z1, Z2, Z3, ... Zn} on U, where = {a,b} {b, d}, as {b, d} is a subset of {b,c,d},
Z1 , Z2, Z3, ... Zn are the equivalence classes generated Md(c) ={c}, as {c} is a subset of {c, d} and {b, c,
by R. Then the pair (U, R) is called approximation d}, Md(d)={b, d} {c, d}, as {b.d} is asubset of
space. {b,c,d} and {c,d} is also subset of { b,c,d}.

B. Definition( Rough Set[8],[9]) F. Definition(Covering Based Rough Set [1],[13])

For X ⊆ U, the lower and upper approximation of Let (U, C) be the covering approximation space.
X are defined as LR(X) = {Z i U/R | Z i ⊆ X} and The operators L, H : P(U)→P(U) are defined as
follows, for all X U.
HR(X) = {Z i U/R|Zi X ≠ ф, respectively. The
set X is termed as Rough set with respect to L(X) = {K C:K X}and
kno wledge R if LR(X) ≠ HR(X), and X is said to H(X) = L(X) {Md(x) : x X - L(X)}, where L(X)
be R - definable or an exact set with respect to and H(X) are known as the covering lower and
knowledge R . The positive region , negative region , covering upper approximation operators respectively.
and boundary region of X with respect to knowledge R The set X U is called the covering based rough
is given by set if L(X) ≠ H(X), otherwise X is said to be an exact
POS R (X) = LR(X) set (definable set ).
NEG R (X) = U- HR(X) and The boundary region or border line regi on of X
BND R (X) = HR(X) - LR(X) = R - border line region of is defined by BND F (X) = H(X) - L(X).
of X , respectively.
G. Example:
C. Definition (Covering [12])
Let U = {a, b, e, d}, C = {{a, b}, {b, c},
Let U be a universe of discourse of finite set and {b,c,d},{d}} be a covering of U. If X = {a, c},
C is the family of non empty sub sets of U . Then C Then we find covering based lower and upper
is called the covering of U if and only if Ci = U, approximation, as
for Ci C. Here L(X) = ф, X - L(X) = X .
The ordered pair (U, C) is known as covering Md(a) = {a, b}, Md(c) = {b, c} as {b,c} {b, c, d} and
approximation space. Md(X) = Md(a) Md(c) = {a, b} {b, c} = {a, b, c}
So H(X) ={a,b ,c}.Hence X is a co verin g b ased
ro ugh set as L(X) ≠ H(X). .

2
 International Journal of Recent Development in Engineering and Technology
Website: www.ijrdet.com (ISSN 2347-6435 (Online)) Volume 10, Issue 5, May 2021)
III. COVERING OF SOFT SET AND SOFT ROUGH SET (F, A) = { Expensive house / {h 2 , h 4 }, beautiful
Here we present the soft set introduce by Molodtsov house /{h1, h3}, wooden houses / {h 3, h4, h5}. cheap house
([7]) and covering of soft set introduced by ([4]),
Suziye Yuksel et al ([11],[12]). Some application on /{ h1, h4, h5}, cheap house green surrounding / { hI}} =
soft set theory is given by P.K.Maji et al ([4],[3]). {e l / { h2, h4},e 2 /{h 1 , h 3 }, e 3 /{h 3 , h4, h5},e 4 /{ hI, h3, h5},
e 5 /{ h1}}
A. Definition:( Soft Set [3],[4],[7])
Here So (F, A) is not a full soft
Let U be the universe of discourse, a finite set. E set, but it is a Soft set.
denotes Set of parameter, P(U) is the Power set of U.
In defining a mapping F : A → P(U), where A 2) Example:
E. Thus a pair (F, A) is called a soft set over U.
Here F(e) be the set of e-approximate element of the Let U = { h 1, h 2, h 3, h 4, h 5, h 6, h 7, h 8}, A ={a 1, a 2, a 3,
soft set (F, A) , for e A.
a 4, a 5 } and F is a mapping F : A → P(U), where F(a 1)
= { h1, h 3 , h 5 } , F ( a 2 ) = { h 4 } , F ( a 3 ) = {h 3 , h 4 , h 6 },
B. Definition: ( Full Soft Set [11],[12] ) F(a 4 ) = {h 3 , h 7 , h 8 } F ( a 5 ) = { h 2 , h 4 , h 6 }.
Let S = (F, A) be a soft set over U, If F(a)= U, Here and F (a) for any a A.
then S is said to be a full soft set. So ( F, A ) is a soft set, which is a full soft set and also
{F(a 1 ), F(a 2 ), F(a 3 ) , F(a 4 ), F(a 5 )} is a covering of U.
C. Definition: ( Covering Soft Set [11],[12] )
3) Example:
A full soft set S = (F, A) over U is called as a
covering soft set if F(a) , for each a A. Let U ={ h 1, h 2, h 3, h 4, h 5, h 6, h 7, h 8},
A={ a 1, a 2, a 3, a 4, a 5 } and F is a mapping F : A→P(U)
D. Examples: where F(a 1 ) ={ h1, h 2 , h 3 }, F (a 2 ) = ,
F(a3) = { h3, h5, h7, } ,F(a4) = { h4, h6, h8 } ,
1) Example: F(a 5 ) = { h1, h6, h7 } . Here
So (F, A) is a full soft set, but not a covering soft set
Suppose U be the set of houses under of U as F(a 2 ) = .
consideration, E is this set of parameters. Each
parameter is a word or a sentence. Let E =
{expensive, beautiful, wooden, cheap, in green E. Soft Rough Set
surrounding, modern, repaired, dilapited } = {e1, e 2, e 3,
e4, e 5, e6, e7, e8 } say. Hybridization of two theories, soft set theory
and rough set theory is yield rough soft set and soft
To define a soft set, We have to point out expensive rough set given by ([2],[6],[14]). Here we produce the
houses, beautiful houses and so on. The soft set (F, A) definition of Soft Rough Set only.
describes the “attractiveness of the houses" which
Mr.Y (say) is going to purchage
1) Definition: (Soft lower and upper approximation )
Let U = {h 1, h 2, h 3, h 4, h 5, h 6} be the houses, A =
{el, e 2, e3, e4, e 5}, where A E. We d e fi ne a Let S = (F, A) be a soft set over U. The pair P =
(U, S) is called a soft approximation space. Based on
map p i n g F : A → P (U ) b y F(el ) = {h2, h 4 } ,F(e 2 ) =
the soft approximation space P, we define the
{h 1 , h 3 }, F(e 3 ) = {h 3 , h 4 , h 5 } , F(e 4 ) = {h 1, h 3 , h 5 }, following two operations for X ⊆ U,
F(e 5 ) ={h 1 }. Then (F, A) is a soft set over U and
3
 International Journal of Recent Development in Engineering and Technology
Website: www.ijrdet.com (ISSN 2347-6435 (Online)) Volume 10, Issue 5, May 2021)
L(apr p (X)) = { U: a A|u F(a) ⊆ X} = Here L(apr p (X)) ≠ H(apr p (X)) , So X is a soft
{F(a) : F(a) ⊆ X}. rough set. But X ⊈ H(apr p (X)).

H (a p r p (X )) = { u U a A|u F(a) X } 2) Example:

= X≠ ø },are called the soft P -
lower and P - upper approximation of X with
respect to P. Let U = {h 1, h 2, h 3, h 4, h 5, h 6, h 7, h 8} be the
Universal set, E = {el, e2, e3, e4, e5, e6} b e t he se t o f
2) Definition: ( Soft Rough Set [2]) p ara me ter s. Let F : A →P (U ) , b e a m a p p i n g
g i v e n b y F (e 1 ) = {h 1 , h 3 , h 5 }, F(e 4 ) = {h 7 , h 8 } , F(e 5 )
= {h 8 }, F(e 6 ) = {h 4 , h 6 , h 8 }.
Feng Feng et al has given the definition of Soft
Rough Set as: Considering A = {e l, e4 , e5, e 6} ⊆ E and
X = { h 2, h 6, h 7, h 8 } , Then L (aprp (X)) = {h7, h8},
The soft P - positive region ,the soft P - negative H(aprp(X)) = {h4, h6, h7, h8}.
region and the soft P - boundary region of X ⊆ U , can
be defined and denoted by It is clear that L(apr p (X)) ≠ H(a p r p (X)). He nce X
is a so ft ro ugh set b ut he re X ⊈ H(apr p (X)).
P O S p (X ) = L (a p r p ( X ) ) ,
To overcome the difficulties, we find the following
N E G p (X ) = U - H (a p r p ( X ) ) ,
definition.
BNDp(X) = H(apr p (X)) - L(apr p (X)), respectively. G. Definitions
X is said to be soft P - rough set if L(apr p (X))≠ 1) Definition:( Not Set of A )
H(apr p (X)), otherwise X is said to be soft P -
definable. From the definition, we have X as a soft
definable set, if BNDp(X) = ф .
Let E = {e1, e2, e3, e4, …………….en, } be the set of
parameters. The not set E denoted by E and defined
In [2] Feng Feng et al has established the fact that
by E = { e1, e2, e3, e4, …………. en}, Where
L(arp p (X)) ⊆ X and L(apr p (X)) ⊆ H(apr p (X)) for all
ei = not ei , for each i .
X ⊆ U, but X ⊆ H(apr p (X)) does not hold in general.
This is illustrated by the following examples.
2) Definition:( Complement of soft set )
F. Examples:
1) Example:[2]
The complete of a soft set (F,A) is denoted by (F,
A)' and given by (F,A)' = (F', A ) , w h e r e F ' :
Let U ={u1, u2, u3, u4 u5, u6 }, E ={a1, a2, a3, a4 a 5, a6 }, A→ P(U) is a mapping defined by F' ( a )
considering A= {a1, a2, a3, a4 }, wh e r e = U - F( a), for all a A.
F(a1)={u2,u4}, F(a2) ={u1}, F(a3)=ø,F(a4) =
{ u 2 , u 3 , u 6 } , F ( a 5 ) = {u l ,u 5 }, F(a 6 ) = {n 3 , u 4 }. 3) Definition( Modified Soft Rough Set , [6] )
Let G = (F, A) be a soft set over U and then P =
(U, G) is the soft approximation space.
Let S = (F, A) be a soft set over U. Then the
triplet P = (U, F, A) is called soft approximation
Considering X = {u 1, u 5, u 6} ⊆ U. space. The soft lower and soft upper approximation
We have defined as , for X ⊆ U ,
L(apr p (X)) = {u l }, H(aprp(X)) = {u1, u2, u3, u6 },
4
 International Journal of Recent Development in Engineering and Technology
Website: www.ijrdet.com (ISSN 2347-6435 (Online)) Volume 10, Issue 5, May 2021)
L * (apr F (X)) = {u U: e |u F(e) ⊆ X} =
{F(e) : F(e) ⊆ X} , and 2) Example : ( D. Mohanty [6])

H*(aprF (X)) = M, for X ⊆ M Considering the data given in the example in

M N for X ⊈ M III.F.2, We again illustrate lower and upper
approximation of X according to definition given in
respectively, where III.G.
L * (apr F (X)) = {h 7 , h 8 } ⊆ X,
M={u U: e A|u F(e),F(e) X≠ ø} = M = {h4, h6, h7, h8 },N = { h2 }
{ F ( e ) : F ( e ) X ≠ ф} , a n d H * (apr F(X)) = M N = { h 2,h 4 ,h 6,h 7,h 8 }
N = { F'(e) : e (-A)}. Here X ⊆ H * (apr F (X)).

The L * (apr F(X)) and H * (apr F (X)) are referred to soft However, from these two examples we infer that
the definition given for soft rough set in ([4]) is better
rough lower and upper approximation of X with
than the previous one. (Soft rough set define in [2])
respect to parameterized mapping F A , where F A :
A→ P(U) be the illustrated mapping. The set X ⊆ U
I. Proposition: [6]
is called F-soft rough set, if L * (apr F (X)) ≠
H * (apr F (X)), otherwise X is called F-soft definable Le t S = (F , A ) b e a s o ft s e t o v er U a n d A ⊆
E b e a s e t o f p ar a me t e r s a n d P = (U, F, A) be
set . Here we denote the notation F A to indicate the
the corresponding soft approximation space. The F-
parameter set A and the mapping F. That is F A and F Rough lower and F-Rough upper approximation
have the same mapping from A to P(U). In this satisfy the following properties for every X, Y ⊆ U.
article we use the notation F instead of F A L*(aprF( ф)) = ф , H*(aprF(ф)) = ф
everywhere.
L * (ap r F (U)) = U, H* (apr F (U) = U
The F-soft positive region, F-Soft negative region L * (a p r F (X Y ) ) = L * (a p r F (X ) ) L * ( a p r F (Y ) )
and F-soft boundary region of X may be defined as L * (a p r F (X Y)) ⊇ L * (a p r F (X )) L * (a p r F (Y ))
POS F (X) = L * (apr F (X)),
X ⊆ Y L*(aprF(X)) ⊆ L*(aprF(Y)) and
NEG F (X) = {F(e) : F(e) X ≠ø = U- M, for X
* *
⊆ M, H (aprF(X)) ⊆ H (aprF(Y))
BND F (X) = H * (apr F (X)) - L * (apr F (X)), respectively.
H * (a p r F (X Y ) = H * (a p r F (X )) H * (a p rF (Y ))
H * (a p r F (X Y ) ) ⊆ H * (a p r F (X ) ) H * (a p r F (Y ) ).
H. Examples:

1) Example: In the next section we define four types of soft rough

set with covering based which is different from Saziye
yuksel et al[12] and J Zhan and Q Wang [14].
Considering the example in III.F,1 , we are now
calculate lower and upper approximation of X IV. COVERING BASED SOFT ROUGH SET
according to definition given in III.G, In III. C.,it is given the definition of covering soft
L * (apr F (X)) = {u 1 } ⊆ X set written by Saziye Yuksel et al ( [11],[12]). In these
M = {u1, u2, u3, u6} two articles ([11],[12]),Saziya Yuksel consider full
A = {e1, e2, e3, e4} , So ~ A = {~ el, ~ e2, ~ e3, ~ e4 } soft set to define soft rough set and soft set is
N = F'(~el ) F'(~e 2 ) F'(~e 3 ) F'(~e 4 ) = {u 5 } considered as covering of U.
H * (apr F (X)) = M N = { u 1 , u 2 , u 3 , u 5 , u 6 },
as X ⊈ M. Then X ⊆ H * (apr F (X)).

5
 International Journal of Recent Development in Engineering and Technology
Website: www.ijrdet.com (ISSN 2347-6435 (Online)) Volume 10, Issue 5, May 2021)
But, in this section we define covering of U first and compare the definition giving by Saziye
then we define soft covering of U and the soft Yuksel et al ([11] ) with our definition of
covering approximation spaces. This notion is totally First type covering soft rough set.
different from the definition given in ([11],[12] )..
Let U = {a, b, c, d, e, f, g, h}, A = {a1, a2, a3, a4, a5} ⊆ E ,
C is covering of U, where C 1 = {a, b}, C 2 = {b, c}, C 3
A. Definition:( Covering rewriting ) = {d}, C 4 = {e}, C 5 = {f}, C 6 = {g}, C 7 = {g, h}.
Let C = { C1, C2, C3, …….. Cn}, Ci U, 1 ≤ i ≤ n,
then C is called covering of U if Ci = U F is a mapping from A to C such that
F(a 1 ) = C 1 , F(a 2 ) = C 2 C 3 , F(a 3 )= C 4 U C 5 , ,
B. Definition: ( Soft Covering Approximation Space) F(a 4 ) = C 6 . F(a 5 ) = C 7 .. Let X = { b, d, e},then to
Let K = (F, A) be a soft set on U and A⊆ E. find out lower and upper soft covering approximation.
Then(C,K) ba a soft covering of U,for each a A, FL F (X) = {d} {e} = {d, e}, X - FL F (X) = {b}.
F (a) = C i . Then triplet P = (U, C, K) be called a F HF (X) = {d, e} Md A(b) = {d, e} {a, b} {b,c} =
soft covering approximation space. {a, b, c, d. e}. -
According to Saziye Yuksel el at, the lower
C. D e f i n i t i o n : ( Minimum Description ) approximation S * ( X ) = ø and upper approximation
S * ( X ) = Md A (b) Md A (d) MdA(e) = {a, b} {b, c, d}
Let C is a covering of U and K = (F, A) be a soft
{e, f } = {a, b, c, d, e, f }.
set of U. And (U, C, K) be a soft covering
approximation space. We denote F( A ) = { F(a ) : a
We note that our definition is better than that of
A} and C x = { T C: x T} .Then minimum Saziye et al ([12]).
description of x U, can be defined as M d A ( x ) =
{T Cx : T F(A) ∧ (∀ S ⊆ Cx ∧ (S ⊆ T T Next we define other three types of covering soft
= S))}. rough set with an example.
D. Definition :(First type of covering based Soft Rough
set:) E. Definition:(Second type of covering based soft rough
Let P = (U, C, K) be a Soft covering set)
approximation space for a set X ⊆ U, the soft Let P = (U, C, K) be a soft covering
covering Lower and upper approximation are , approximation space. For a set X ⊆ U, the soft
respectively defined as covering lower and upper approximatio n are
FL F (X) = {C i : C i ⊆ X} respectively defined as :
FH F (X) = FL F (X) { Md A (x) :x X - FL F (X)}. SL F (X) = {C i : C i ⊆ F(e) X}
If FL F (X) ≠ FH F (X), then X is said to be the First SHF (X) = {C i ⊆ F(e) : F(e) ≠ ф }.
type of Covering Based Soft Rough Set, otherwise If SLF(X) ≠ SH F (X). then X is said to be second
X is called covering based soft definable. type o f co vering based soft ro ugh set, otherwise X
is called covering based soft definable.
1) Example A. Definition :(Third type of covering based soft rough
set:)
Let P = (U, C, K ) be a soft covering
We note that in ( [12] ) Saziye Yuksel et al define soft approximation space. For a set X ⊆ U, the soft
lower and soft upper approximations as covering lower and upper approximation are,
respectively defined as
S*( X ) = { F(a) :F(a) ⊆ X }, TL F (X) = C i : C i ⊆ F(e) X} .
TH F (X) = {Md A (x) : x X },
S* ( X ) = { Md S ( X ) : x X } and Minimum If TLF(X) ≠ TH F (X), then X is called third type of
description Md S ( x )= { F(a) : a A ∧ x F ( a ) ∧ (∀ covering based soft rough set, otherwise X is said
e A ∧ x F(e) ⊆ F(a) F(a)= F(e)))}.We to be covering based soft definable set.
6
 International Journal of Recent Development in Engineering and Technology
Website: www.ijrdet.com (ISSN 2347-6435 (Online)) Volume 10, Issue 5, May 2021)
B. Definition :(Fourth type of covering based soft rough 1) Lower approximation ( X ) ⊆ X ⊆ upper
set:) approximation ( X )
Let P = (U, C, K) be a soft covering 2) Lower approximation ( ф ) = ф ,
approximation space. For a set X ⊆ U, the soft Upper approximation (ф ) = ф
covering lower and upper approximation are , 3) Lower approximation ( U ) = U,
respectively defined as : Upper approximation ( U ) = U
FhL F (X) = {C i : C i ⊆ F(e) X} 4) X ⊆ Y Lower approximation ( X ) ⊆ Lower
FhH F (X) = approximation ( Y ) and Upper approximation (X ) ⊆
FhL F (X) {Z : Z C and Z (X- FhL F (X)) ≠ ф }. Upper approximation ( Y ).

If FhL F (X) ≠ FhH F (X), then X is said to be fo urth We note here that, we consider full soft set to define all the
type covering based soft r ough set, otherwise X is
four types of covering based soft rough set.
said to be covering based soft definable.
C. Example: V. NEW TYPE COVERING BASED SOFT ROUGH SET
Let U = { h1, h2, h3, h4, h5, h6, h7, h8 }, E = { e1, e2, e3,
e4, e5, e6 } . Let A = { e1, e2, e3, e5 }, C is covering of
U, where C 1 = {h 1 ,h 7 },C 2 = { h1, h2, },C 3 = { h2, h4, We name it as new type of covering based
h6}, C4 = { h1, h3, h5}, C5 = { h2, h5, h7}, C6 = { h1, h6, soft rough set since it is different from all fo ur
h8},C7 = { h8 }, C 8 = { h2, h6, } types of covering based soft rough set. In the new
F is a mapping from A to C such that type we define Covering Based Soft Rough Set
F(e I ) = C 1 C 4 , F(e 2 ) = C 3 C 5 , F(e 3 ) = C 7 , without using full soft set, that is, F (a) = C i for
F(e 5 )=C 2 C 8 . some i, but F (a) ≠ U for a A.
Let us consider X = { h2, h6, h7, h8,}, then to find out
first , second , third and fourth type of soft covering A. Definition:( Not Set of A, rewriting )
lower and upper approximation. Let E = {e1, e2, e3, e4, …………….en, } be the set of
FLF(X) = C7 C 8 = { h2, h6, h8} = S L F ( X ) = parameters. The Not set E denoted by E and
T L F ( X ) = F h L F ( X ) , Md A(h 2 ) = C 2 C8 C5 as defined by E = { e1, e2, e3, e4, …………. en},
C 8 ⊆ C 3 , Md A (h 6 ) = C 8 , a s C 8 ⊆ C 3 , Md A (h 7 ) = Where ei = not ei , for each i .
C1 C 5 , Md A (h 8 ) = C 7 ,
MdA( x ) =C 1 C2 C5 C7 C 8 = { h1, h2, h3, B. Definition:( Complement of soft set , rewriting )
h5, h6, h7, h8 } for all x X.
FH F (X) = (C 7 C 8 ) (C 1 C 5 ) = { h1, h2, h5, h5, h6, h7, The complete of a soft set (F,A) is denoted by
h8 }, (F, A)' and given by (F,A)' = (F', A ) , w h e r e
SH F (X) = C 1 C2 C3 C5 C7 C 8 = {h1, h2, , F': A→ P(U) is a mapping defined by
h4, h5, h6, h7, h8 } F' ( a ) = U - F ( a ) , f o r a l l a A. Thus for
TH F (X)=C 1 C 2 C 5 C 7 C 8 ={h1,h2 ,h3,h5,h6,h7, h8}, b A, F' ( ~ b ) = U – F ( b . ) It is seen that
X - FhL F (X) = X - (C 7 C 8 ) = {h 7 }, complement of a soft set is not necessarily a s oft set
FhH F (X) = (C 7 C 8 ) (C 1 C 5 ) ={ h1, h2, h5, h6, h7, h8 }. as the parameter a ∉ A.
C. Definition:( New Type of Covering Based Soft Rough
D. Properties Set )
Let P = ( U, C, K ) be a soft covering approximation space. Let K = (F, A) is a soft set of U and may not be
The soft covering lower and upper approximations of First full soft set, then ( C, K ) be soft covering of U. P =
(U, C, K ) be a soft covering approximation space.
type , Second type , Third type and Fourth type is satisfied
For a set X ⊆ U, the soft covering lower and upper
the following properties, for X ⊆ U approximations are respectively, defined as
NL F (X) = ∪ {C i : C i ⊆ F(e) X}, and

7
 International Journal of Recent Development in Engineering and Technology
Website: www.ijrdet.com (ISSN 2347-6435 (Online)) Volume 10, Issue 5, May 2021)
NHF(X) = M, for X M So Ne w type covering based soft rough se t is
M ∪ N for X ⊈ M b e t t e r approach than other models.

Where VI. CONCLUSION

M= { C i ⊆ F(e) : F (e) X ≠ ø }, and
N = {F'(e) : e ϵ (~ A)} . If NL F (X) ≠ NH F (X), Combination of theories has not only advanced
then X is said to be new typ e covering based soft research but also helped in tackling the issues of
rough set, otherwise X is said to be covering based uncertainties in real life situations. This new extension
soft definable. of theory i.e. Covering Based Soft Rough Set has
A. Example: been modeled in four different types illustrating
examples. We introduced four types of covering
Let U = { h1, h2, h3, h4, h5, h6, h7, h8, h9, h10 }, E = {e1,
e2, e3, e4, e5, e6, e7}, Let A = { e1, e2, e3, e5}, C K is based soft rough set which are different from soft
covering of U, where C1 = { h1, h7 }, C2 = { h2, h8 }, covering based rough set given by Saziye Yuksel et
C3 = { h3, h6, h9 }, C4 = { h4, h7 }, C5 = { h1, h7, h10 }, al ([12]). To conclude along with introducing new
C6 = {h2, h9 },C7= {h2, h4, h6 }, C8 = {h2, h3, h5 }, and extended models, this article also presents the different
F is a mapping from A to C such that F ( e 1 ) = C 1 ∪ problem in Covering Based Soft Rough Set inviting
C 2 , F ( e 2 ) = C 3 , F ( e 3 ) = C 4 , F ( e 4 ) = C7 ∪ C8, further investigations to find the more properties
F(e 5 ) = C 2 ∪ C 6 , F(e 6 ) = C 5 ∪ C 1, F(e 7 ) = C 3 ∪ C 8.
related to four types of Covering Based Soft Rough
Here F(e) ≠ U that is, (F,A) is not a full
soft set. Sets.

Let us consider X = { h1, h2, h5, h7, h10 } ,then to find out We also define the New type of covering based
first , second and new type of soft covering lower and soft rough set without taking full soft set which is
upper approximations. more effective.
FLF(X) = C1 = {h1, h7} = SLF(X)= NLF(X),
Md A (h 1 ) = C 1 , Md A (h 2 ) = C 2 ∪ C 6 ,Md A (h5) = ø, VII. ACKNOWLEDGMENT
Md A (h 7 ) = C 4 , Md A (h 1 0 ) = ø, We are very much thankful to Dr. B. Kar ,
X - F L F (X ) = { h 2 , h 5 , h 1 0 } , S.M.V and Dr. J. Nayak, Baripada College, for
∪ Md A (x) = C 2 ∪ C 6 ∪ ø = { h 2 , h 8 , h 9 } , their continuous encouragement and help.
for all x ϵ (X - FL F (X) ).
FHF(X) = C1 ∪ (C2 ∪ C6) = { h 1 , h 2 , h 7 , h 8 , h 9 } , References
SH F(X) = C 1 ∪ C 2 ∪ C 4 ∪ C 6 ={ h 1 , h 2 , h 4 , h 7 , h 8 , h 9 },
M = C 1 ∪ C 2 ∪ C 4 ∪ C 6 = { h 1 , h 2 , h 4 , h 7 , h 8 , h 9 }, [1] Zbigniew Bonikowski, Edward Bryniarski, and Urszula
Here X ⊈ M. Then we have to find out N. Wybraniec-Skardowska. Extensions and intentions in the
N = F' (e 1 ) F' (e 2 ) F'(e 3 ) F' (e 5 ) = { h 3 , h 4 , h 5 , rough set theory. Information sciences, 107(1-4):149167,
1998.
h 6 , h 9 , h 1 0 } }, { h 1 , h 2 , h 4 , h 7 , h 8 , h 9 , h 1 0 } , { h 1 ,
h2, h3, h5,h6, h8, h9, h10 }, {h1, h3, h4, h5,h6, h8, [2] Feng Feng, Xiaoyan Liu, Violeta Leoreanu-Fotea, and
h9, h10 } = { h5,h10} Young Bae Jun. Soft sets and soft rough sets. Information
Sciences, 181(6):1125-1137, 2011.
NHF (X) = M ∪ N = { h 1 , h 2 , h 4 , h 7 , h 8 , h 9 , h 1 0 } .
[3] P.K.Maji,AR Roy and R.Biswas. An Application of Soft
Here X is a Ne w typ e covering based so ft Sets in a Decision Making Problem. Computer and
Mathematics with Applications, 44(4-5):1077-1083, 2002.
r o u g h s e t s i n c e N L F ( X ) ≠NH F(X) and N L F ( X )
X NH F(X). But X ⊈ F H F ( X ) , X ⊈ S H F ( X ) , X [4] P.K.Maji, Biswas R and Roy AR. Soft set theory. Computer
NHF(X).This is due to F(A) is not a full soft and Mathematics with Applications, 45(4-5):555-562, 2003
set.

8
 International Journal of Recent Development in Engineering and Technology
Website: www.ijrdet.com (ISSN 2347-6435 (Online)) Volume 10, Issue 5, May 2021)
[5] Debadutta Mohanty. Covering based approximation—a new
type approach. International Journal of Computational Vision
and Robotics, 1(3):335-345, 2010.

[6] Debadutta Mohanty. Comparative analysis of hybrid soft

set methods. In Global Trends in Intelligent Computing
Research and Development. pages 360-383. IGI Global, 2014.

[7] Dmitriy Molodtsov. Soft set theoryfirst results.

Computers Mathematics with
Applications, 37(4-5):19-31, 1999.

[8] Zdzislaw Pawlak. Rough sets. International journal of

computer 4 information sciences, 11(5):341-356, 1982.

[9] Zdzislaw Pawlak. Rough sets: Theoretical aspects of reasoning

about data, volume 9. Springer Science & Business Media,
2012.

[10] Lech Polkowski. Rough Sets and Current Trends in

Computing: First International Conference, RSCTC98
Warsaw, Poland, June 22-26, 1998 Proceedings, volume 1424.
Springer, 2003.

[11] Saziye Yuksel, Zehra Giizel Ergiil, and Naime Tozlu. Soft
covering based rough sets and their application. The
Scientific World Journal. 2014, 2014.

[12] $aziye Yuksel, Naime Tozlu, and Tugba Han Dizman. An

application of multicriteria group decision making by soft
covering based rough sets. Filomat, 29(1):209-219, 2015.

[13] Wojciech Zakowski. Approximations in the space (u, 7).

Demonstratio mathematica, 16(3):761-770, 1983.

[14] Jianming Zhan and Qiumei Wang. Certain types of

soft coverings based rough sets with applications.
International Journal of Machine Learning and Cybernetics,
10(5):1065-1076, 2019.

[15] William Zhu and Fei-Yue Wang. A new type of covering

rough set. In 2006 3rd international IEEE conference
intelligent systems, pages 444-449. IEEE, 2006.