In 2004, G. Ganesan and C. Raghavendra Rao introduced the concept of Rough Fuzzy Groups. In this paper, we have adapted this approach in defining the algebraic closure of a given fuzzy graph using each vertex.

Algebraic structures and lattice structures of rough sets are basic and important topics in rough sets theory. In this paper we pointed out that a basic problem had been overlooked, that is the closeness of union and intersection operations of rough approximation pairs, i.e. (lower approximation, upper approximation). We present that the union and intersection operations of rough approximation ...

Fuzzy-rough sets play an important role in dealing with imprecision and uncertainty for discrete and real-valued or noisy data. However, there are some problems associated with the approach from both theoretical and practical viewpoints. These problems have motivated the hybridisation of fuzzy-rough sets with kernel methods. Existing work which hybridises fuzzy-rough sets and kernel methods emp...

It is well known that lattice-valued rough sets are important branches of fuzzy sets. The axiomatic characterization and related topology the main research directions For L=(L,⊛), a complete co-residuated lattice (CCRL), Qiao recently defined an L-fuzzy lower approximation operator (LFLAO) on basis relation. In this article, we give further study Qiao’s LFLAO around induced L-topology. Firstly,...

This article outlines conceptualization and implementation of an intelligent system capable of extracting knowledge from databases. Use of hybridized features of both the Rough and Fuzzy Set theory render the developed system flexibility in dealing with discreet as well as continuous datasets. A raw data set provided to the system, is initially transformed in a computer legible format followed ...

Watermarking is done in digital images for authentication and to restrict its unauthorized usages. Watermarking is sometimes invisible and can be extracted only by authenticated party. Encrypt a text or information by public – private key from two fuzzy matrix and embed it in image as watermark. In this paper we proposed two fuzzy compositions Product-Mod-Minus, and Compliment-Product-Minus. Em...

The purpose of this paper is to introduce and discuss the concept of T-rough (prime, primary) ideal and T-rough fuzzy (prime, primary) ideal in a commutative ring . Our main aim in this paper is, generalization of theorems which have been proved in [6, 7, 11]. At first, T-rough sets introduced by Davvaz in [6]. By using the paper, we define a concept of T-rough ideal , T-rough quotient ideal an...

While desi ning radial basis function neural networks for classification, kzzy clustering is often used to position the hidden nodes in the input space. The main assumption of the clustering is that similar inputs produce similar out uts. In other words, it means that any two in ut patterns t o m the same cluster must be from the same cfass. Generalization is possible in the radial basis functi...

This keynote talk considers how one might utilize fuzzy sets, near sets, and rough sets, taken separately or taken together in hybridizations in solving a variety of problems commonly faced in science and engineering. These technologies offer set theoretic approaches to solving problems such as classifying sensor output, image retrieval and image correspondence. Fuzzy sets result from the intro...

The starting point of the paper is the (well-known)observation that the “classical” Rough Set Theory as introduced by PAWLAK is equivalent to the S5 Propositional Modal Logic where the reachability relation is an equivalence relation. By replacing this equivalence relation by an arbitrary binary relation (satisfying certain properties, for instance, reflexivity and transitivity) we shall obtain...