2012
DOI: 10.1016/j.ins.2012.04.005
|View full text |Cite
|
Sign up to set email alerts
|

Topological characterizations of covering for special covering-based upper approximation operators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 34 publications
(14 citation statements)
references
References 65 publications
0
14
0
Order By: Relevance
“…The covering generated by a reflexive and symmetric relation is characterized. It establishes the equivalence of the unary covering and the covering with the property that the intersection of any two elements is the union of finite elements in this covering [18][19][20][21][22][23][24][25][26][27][28].…”
Section: Covering Rough Setsmentioning
confidence: 99%
See 2 more Smart Citations
“…The covering generated by a reflexive and symmetric relation is characterized. It establishes the equivalence of the unary covering and the covering with the property that the intersection of any two elements is the union of finite elements in this covering [18][19][20][21][22][23][24][25][26][27][28].…”
Section: Covering Rough Setsmentioning
confidence: 99%
“…upper approximation) as the union of covering components intersecting the set. It is multi-mapping items for inadequate information about the genuine characteristic [18][19][20][21][22][23][24][25][26][27][28]. Hybrid rough set systems have been used in different applications for feature selections [29][30][31][32][33][34], classifications [35][36][37][38][46][47][48] and image segmentation [39].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Chen and Li defined open sets, closed sets, rough inclusion, rough equality on covering rough sets and studied some of their properties [7][8][9]. Ge, Bai, Yun, Bian and Wang gave topological characterizations of the covering C for covering upper approximation operators to be closure operators [2,12]. Restrepo and Gómez investigated properties of covering approximation operators being closure and topological closure in a framework of sixteen pairs of dual approximation operators [28].…”
Section: Introductionmentioning
confidence: 99%
“…Naturally, it is a significative work to investigate Question 1.3 by using rough-set theory. In the past years, with development of information sciences and computer science, applications of rough-set theory have been extended from Pawlak approximation spaces to covering approximation spaces (see [1,[9][10][11]20,33,36,46,[50][51][52][53][54][55][56], for example).…”
Section: Introductionmentioning
confidence: 99%