DocumentCode
3301990
Title
Definability of approximations in reflexive relations
Author
Yu-Ru Syau ; Lixing Jia ; En-Bing Lin
Author_Institution
Dept. of Inf. Manage., Nat. Formosa Univ., Huwei, Taiwan
fYear
2013
fDate
13-15 Dec. 2013
Firstpage
276
Lastpage
280
Abstract
Considering a reflexive relation R on a fixed nonempty set U, four different constructions of lower and upper approximations are described by using the so-called R-successor or/and R-predecessor sets of each object of the set U. The first two of the four constructions of lower and upper approximations are well known, and one pair is presented in this paper for the first time. The lower and upper approximations in each pair are mutually dual, and all the four upper approximations discussed in this paper are extensive and monotonic. If the reflexive relation R is further assumed to be symmetric, the four constructions of lower and upper approximations are induced to the commonly used lower and upper approximations. The primary goal of this paper is to study definability of approximations in reflexive relations via a special kind of neighborhood systems, called total pure reflexive neighborhood systems. It is shown that such neighborhood systems give a unified framework for definability of the four constructions.
Keywords
approximation theory; rough set theory; R-predecessor sets; R-successor sets; approximation definability; fixed-nonempty set; lower-approximation construction; neighborhood systems; reflexive relations; rough set theory; total-pure-reflexive neighborhood systems; unified framework; upper-approximation construction; Approximation methods; Conferences; Educational institutions; Electronic mail; Rough sets; Topology; definability; lower and upper approximations; neighborhoods; reflexive relations; rough sets;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing (GrC), 2013 IEEE International Conference on
Conference_Location
Beijing
Type
conf
DOI
10.1109/GrC.2013.6740421
Filename
6740421
Link To Document