Successes with kernel-based classification methods have spawned many recent efforts to kernelize clustering algorithms for object data. We extend this idea to the relational data case by proposing kernelized forms of the non-Euclidean relational fuzzy (NERF) and hard (NERH) c-means algorithms. We show that these relational forms are dual to kernelized forms of fuzzy and hard c-means (FCM, HCM) ...

In this paper it has been studied the sequence of membership functions and of join spaces (see [7]), determined by a class of 1–hypergroups which are not complete (see [2]).

We provide a self contained survey of the state of art of the fuzzy binary relations and some of their applications.

This paper studies a fuzzy graph rewriting with single pushout approach from a viewpoint of fuzzy relational calculus. Two possible kinds of matchings for fuzzy graph rewritings are given, namely, a rigorous matching which just generalizes matchings for crisp (or ordinary) graph rewritings, and an "-matching which represents rather ambiguous or fuzzy one. Finally the pullback structure of fuzzy...

In a previous work, we have explored a proximity-based approach for relaxing queries involving fuzzy predicates. This proximity was defined in a relative way. In this paper we consider an absolute proximity and we show how it can be used for the purpose of query weakening. The main features of the weakening mechanism resulting from the use of this kind of proximity are investigated as well. Las...

Preface What is referred to as a genomic revolution can be summarised by the following tasks: Analysis of the DNA sequence of a genome, identification of genes, study of gene products (usually proteins). While the identification of components, cataloguing of products and their classification is very exciting, the interrelationships and interactions of these components is what makes organisms li...

The representation of imprecise, uncertain or inconsistent information is not possible in relational databases, thus they require addonns to handle these types of information. One possible add-on is to allow the attributes to have values that are fuzzy sets on the attribute domain, which result in fuzzy relational databases (FRDB). From the implementational point of view, values are limited to ...

Flexible querying aims at expressing preferences inside queries instead of strict requirements. We consider ordinary relational databases and flexible querying calling on fuzzy sets. The topic of this paper is to define new types of flexible conditions : the ones involving the count operator. The main difficulty is to handle cardinalities of fuzzy sets. keywords : databases, flexible querying, ...

Although signi cant progress has been made in developing multidatabase systems that integrate component databases containing crisp data, little has been reported on integrating fuzzy databases in such systems. In this paper, we investigate the problem of integrating fuzzy relational databases in a multidatabase system. We identify new types of con icts that may occur in schemas and data due to ...

The fuzzy Lyapunov method is investigated for use with a class of interconnected fuzzy systems. The interconnected fuzzy systems consist of J interconnected fuzzy subsystems, and the stability analysis is based on Lyapunov functions. Based on traditional Lyapunov stability theory, we further propose a fuzzy Lyapunov method for the stability analysis of interconnected fuzzy systems. The fuzzy Ly...