On Covering Approximation Subspaces
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
910 2
Ultima descărcare din IBN:
2017-04-28 17:36
Căutarea după subiecte
similare conform CZU
519.147+512.567.7+517.988 (1)
Analiză combinatorică. Teoria grafurilor (114)
Algebră (400)
Ecuații diferențiale. Ecuații integrale. Alte ecuații funcționale. Diferențe finite. Calculul variațional. Analiză funcțională (242)
SM ISO690:2012
GE, Xun. On Covering Approximation Subspaces . In: Computer Science Journal of Moldova, 2009, nr. 1(49), pp. 74-88. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 1(49) / 2009 / ISSN 1561-4042 /ISSNe 2587-4330

On Covering Approximation Subspaces
CZU: 519.147+512.567.7+517.988

Pag. 74-88

Ge Xun
 
Jiangsu University of Science and Technology, China
 
 
Disponibil în IBN: 6 decembrie 2013


Rezumat

Let (U0 ; C0) be a subspace of a covering approximation space (U; C) and X ½ U0 . In this paper, we show that C0(X) = C(X)TU0 and B0(X) ½ B(X)TU0 . Also, C(X) = C0(X)TC(U0) i® (U; C) has Property Multiplication. Furthermore, some connections between outer (resp. inner) definable subsets in (U; C) and outer (resp. inner) definable subsets in (U0 ; C0) are established. These results answer a question on covering approximation subspace posed by J. Li, and are helpful to obtain further applications of Pawlak rough set theory in pattern recognition and artificial intelligence.

Cuvinte-cheie
Rough set, covering approximation subspace, covering approximation operator, definable, outer definable