FCA is a mathematical formalism having many applications in data mining and knowledge discovery. Originally it deals with binary data tables. However, there is a number of extensions that enrich standard FCA. In this paper we consider two important extensions: fuzzy FCA and pattern structures, and discuss the relation between them. In particular we introduce a scaling procedure that enables rep...

We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

in structural time seriesregression models, binary (classic) dummy variables are used to quantify the effects of economic structural breaks, changes or qualitative variables. the binary dummy variable can be challenged using this dummy variable in which 0 or 1 represent absence or presence of structural breaks(or changes), but presence of the structural breaks(or changes) may not have uniform e...

in a recent paper, de baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. in this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. the reasoninglargely ...

Recently, we have introduced six types of composition ternary fuzzy relations. These compositions are close in spirit to the binary Based on these composition, several transitivity a relation and investigated their basic properties. In this paper, prove additional properties characterizations relation. Also, provide representation theorem for relations satisfying transitivity. Finally, focus pr...

We study the transitivity of fuzzy preference relations, often considered as a fundamental property providing coherence to a decision process. We consider the transitivity of fuzzy relations w.r.t. conjunctors, a general class of binary operations on the unit interval encompassing the class of triangular norms usually considered for this purpose. Having fixed the transitivity of a large prefere...

The aim of this thesis is to develop the fuzzy relational calculus. To develop this calculus, we study four algebraic formalisations of fuzzy relations which are called fuzzy relation algebras, Zadeh categories, relation algebras and Dedekind categories, and we strive to arrive at their representation theorems. The calculus of relations has been investigated since the middle of the nineteenth c...

In this paper, we consider the problem of solving systems of fuzzy relation equations in a space with fuzzy preorder. Two types of these systems with different compositions are considered. New solvability criteria are proposed for systems of both types. The new criteria are weaker than all the known ones that are based on the assumption that fuzzy sets on the left-hand side of a system establis...

In this paper, we first use a fuzzy preference relation with a membership function representing preference degree forcomparing two interval-valued fuzzy numbers and then utilize a relative preference relation improved from the fuzzypreference relation to rank a set of interval-valued fuzzy numbers. Since the fuzzy preference relation is a total orderingrelation that satisfies reciprocal and tra...

A neural network architecture is introduced for incremental supervised learning of recognition categories and multidimensional maps in response to arbitrary sequences of analog or binary input vectors, which may represent fuzzy or crisp sets of features. The architecture, called fuzzy ARTMAP, achieves a synthesis of fuzzy logic and adaptive resonance theory (ART) neural networks by exploiting a...