A Comparative Study of Some Generalized Rough Approximations
نویسنده
چکیده
In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive relation. We aim at finding the best of several candidates for generalized rough approximation mappings, where both definability of sets by elementary granules of information as well as the issue of distinction among positive, negative, and border regions of a set are taken into account.
منابع مشابه
Topological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملExistence and Iterative Approximations of Solution for Generalized Yosida Approximation Operator
In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...
متن کاملRough ideals based on ideal determined varieties
The paper is devoted to concern a relationship between rough set theory and universal algebra. Notions of lower and upper rough approximations on an algebraic structure induced by an ideal are introduced and some of their properties are studied. Also, notions of rough subalgebras and rough ideals with respect to an ideal of an algebraic structure, which is an extended notion of subalgebras and ...
متن کاملRough Entropy Based on Generalized Rough Sets Covering Reduction
In generalized rough set covering reduction theory, it is necessary to find a new measure to knowledge and rough set because the upper and lower approximations of rough sets are determined by their covering reduction. In this paper, information entropy is introduced to discuss the rough entropy of knowledge and the roughness of rough set, based on generalized rough set covering reduction. A new...
متن کاملGeneralized Parameterized Approximations
We study generalized parameterized approximations, defined using both rough set theory and probability theory. The main objective is to study, for a given subset of the universe U , all such parameterized approximations, i.e., for all parameter values. For an approximation space (U,R), where R is an equivalence relation, there is only one type of such parameterized approximations. For an approx...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 51 شماره
صفحات -
تاریخ انتشار 2002