Rough Sets and Infomorphisms: Towards Approximation of Relations in Distributed Environments
نویسندگان
چکیده
We discuss the relationships between information systems and classifications as well as between infomorphisms and definability of relations (between whole objects and their parts) in information systems. Infomorphisms between information systems (classifications) and make it possible to define some formulas over by means of formulas over The remaining formulas over can be approximatively defined by means of formulas over The approximation operations are defined using the rough set approach. We present definitions and examples of such approximations. The research has been supported by the State Committee for Scientific Research of the Republic of Poland (KBN) research grant 8 T11C 025 19 and partially by the Wallenberg Foundation grant. The paper has been prepared within the framework of COST Action 274 “Theory and Application of Relational Structures as Knowledge Instruments”. Address for correspondence: Institute of Mathematics, University of Warsaw, Banacha 2, 02-097 Warszawa, Poland The research has been supported by the State Committee for Scientific Research of the Republic of Poland (KBN) research grant 8 T11C 025 19. The research has been supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) research grant 185986. 264 A. Skowron et al. / Rough Sets and Infomorphisms
منابع مشابه
On $L$-double fuzzy rough sets
ur aim of this paper is to introduce the concept of $L$-double fuzzy rough sets in whichboth constructive and axiomatic approaches are used. In constructive approach, a pairof $L$-double fuzzy lower (resp. upper) approximation operators is defined and the basic properties of them are studied.From the viewpoint of the axiomatic approach, a set of axioms is constructed to characterize the $L...
متن کاملConstrained Sums of Information Systems
We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrained sums, for short) that are some operations on information systems. Applications of approximation spaces, used in rough set theory, to study properties of infomorphisms are included.
متن کاملA Note on Belief Structures and S-approximation Spaces
We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory...
متن کاملT-Rough Sets Based on the Lattices
The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...
متن کاملUncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space
Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 54 شماره
صفحات -
تاریخ انتشار 2003