in this paper, we introduce the notion of ($epsilon $, $epsilon $ $vee$ q_{k})− fuzzy subnear-ring which is a generalization of ($epsilon $, $epsilon $ $vee$ q)−fuzzy subnear-ring. we have given examples which are ($epsilon $, $epsilon $ $vee$ q_{k})−fuzzy ideals but they are not ($epsilon $, $epsilon $ $vee$ q)−fuzzy ideals. we have also introduced the notions of ($epsilon $, $epsilon $ $vee$ ...

This paper investigates roughness of fuzzy soft sets. A pair of fuzzy soft rough approximations is proposed and their properties are given. Based on fuzzy soft rough approximations, the concept of fuzzy soft rough sets is introduced. New types of fuzzy soft sets such as full, intersection complete and union complete fuzzy soft sets are defined and supported by some illustrative examples. We obt...

Since upper and lower approximations could be induced from the rough set structures, rough sets are considered as approximations. The concept of fuzzy rough sets was proposed by replacing crisp binary relations with fuzzy relations by Dubois and Prade. In this paper, we introduce and investigate some properties of intuitionistic fuzzy rough approximation operators and intuitionistic fuzzy relat...

Soft set theory, fuzzy set theory and rough set theory are all mathematical tools for dealing with uncertainties and are closely related. Feng et al. introduced the notions of rough soft set, soft rough set and soft rough fuzzy set by combining fuzzy set, rough set and soft set all together. This paper is devoted to the discussions of the combinations of intervalvalued intuitionistic fuzzy set,...

let $s$ be an ordered semigroup. a fuzzy subset of $s$ is anarbitrary mapping   from $s$ into $[0,1]$, where $[0,1]$ is theusual interval of real numbers. in this paper,  the concept of fuzzygeneralized bi-ideals of an ordered semigroup $s$ is introduced.regular ordered semigroups are characterized by means of fuzzy leftideals, fuzzy right ideals and fuzzy (generalized) bi-ideals.finally, two m...

This article introduces a general framework of multi-granulation fuzzy probabilistic roughsets (MG-FPRSs) models in multi-granulation fuzzy probabilistic approximation space over twouniverses. Four types of MG-FPRSs are established, by the four different conditional probabilitiesof fuzzy event. For different constraints on parameters, we obtain four kinds of each type MG-FPRSs...

Granular structure plays a very important role in the model construction, theoretical analysis and algorithm design of a granular computing method. The granular structures of classical rough sets and fuzzy rough sets have been proven to be clear. In classical rough set theory, equivalence classes are basic granules, and the lower and upper approximations of a set can be computed by those basic ...

Fuzzy rough sets, generalized from Pawlak’s rough sets, were introduced for dealing with continuous or fuzzy data. This model has been widely discussed and applied these years. It is shown that the model of fuzzy rough sets is sensitive to noisy samples, especially sensitive to mislabeled samples. As data are usually contaminated with noise in practice, a robust model is desirable. We introduce...

The concept of the rough set was originally proposed by Pawlak as a formal tool for modelling and processing incomplete information in information systems, then in 1990, Dubois and Prade first introduced the rough fuzzy sets and fuzzy rough sets as a fuzzy extension of the rough sets. The aim of this paper is to present a new extension of the rough set theory by means of integrating the classic...

Kernel methods and rough sets are two general pursuits in the domain of machine learning and intelligent systems. Kernel methods map data into a higher dimensional feature space, where the resulting structure of the classification task is linearly separable; while rough sets granulate the universe with the use of relations and employ the induced knowledge granules to approximate arbitrary conce...