Super Fuzzy Matrices and Super Fuzzy Models for Social Scientists

This book introduces the concept of fuzzy super matrices and operations on them. This book will be highly useful to social scientists who wish to work with multi-expert models. Super fuzzy models using Fuzzy Cognitive Maps, Fuzzy Relational Maps, Bidirectional Associative Memories and Fuzzy Associative Memories are defined here. The authors introduce 13 multi-expert models using the notion of fuzzy supermatrices. These models are described with illustrative examples. This book has three chapters. In the first chaper, the basic concepts about super matrices and fuzzy super matrices are recalled. Chapter two introduces the notion of fuzzy super matrices adn their properties. The final chapter introduces many super fuzzy multi expert models.Comment: 280 page

An exact algorithm for linear optimization problem subject to max-product fuzzy relational inequalities with fuzzy constraints

Fuzzy relational inequalities with fuzzy constraints (FRI-FC) are the generalized form of fuzzy relational inequalities (FRI) in which fuzzy inequality replaces ordinary inequality in the constraints. Fuzzy constraints enable us to attain optimal points (called super-optima) that are better solutions than those resulted from the resolution of the similar problems with ordinary inequality constraints. This paper considers the linear objective function optimization with respect to max-product FRI-FC problems. It is proved that there is a set of optimization problems equivalent to the primal problem. Based on the algebraic structure of the primal problem and its equivalent forms, some simplification operations are presented to convert the main problem into a more simplified one. Finally, by some appropriate mathematical manipulations, the main problem is transformed into an optimization model whose constraints are linear. The proposed linearization method not only provides a super-optimum (that is better solution than ordinary feasible optimal solutions) but also finds the best super-optimum for the main problem. The current approach is compared with our previous work and some well-known heuristic algorithms by applying them to random test problems in different sizes.Comment: 29 pages, 8 figures, 7 table

Max-min Learning of Approximate Weight Matrices from Fuzzy Data

In this article, we study the approximate solutions set $\Lambda_b$ of an inconsistent system of $\max-\min$ fuzzy relational equations $(S): A \Box_{\min}^{\max}x =b$. Using the $L_\infty$ norm, we compute by an explicit analytical formula the Chebyshev distance $\Delta~=~\inf_{c \in \mathcal{C}} \Vert b -c \Vert$, where $\mathcal{C}$ is the set of second members of the consistent systems defined with the same matrix $A$. We study the set $\mathcal{C}_b$ of Chebyshev approximations of the second member $b$ i.e., vectors $c \in \mathcal{C}$ such that $\Vert b -c \Vert = \Delta$, which is associated to the approximate solutions set $\Lambda_b$ in the following sense: an element of the set $\Lambda_b$ is a solution vector $x^\ast$ of a system $A \Box_{\min}^{\max}x =c$ where $c \in \mathcal{C}_b$. As main results, we describe both the structure of the set $\Lambda_b$ and that of the set $\mathcal{C}_b$. We then introduce a paradigm for $\max-\min$ learning weight matrices that relates input and output data from training data. The learning error is expressed in terms of the $L_\infty$ norm. We compute by an explicit formula the minimal value of the learning error according to the training data. We give a method to construct weight matrices whose learning error is minimal, that we call approximate weight matrices. Finally, as an application of our results, we show how to learn approximately the rule parameters of a possibilistic rule-based system according to multiple training data

Interval linear systems as a necessary step in fuzzy linear systems

International audienceThis article clarifies what it means to solve a system of fuzzy linear equations, relying on the fact that they are a direct extension of interval linear systems of equations, already studied in a specific interval mathematics literature. We highlight four distinct definitions of a systems of linear equations where coefficients are replaced by intervals, each of which based on a generalization of scalar equality to intervals. Each of the four extensions of interval linear systems has a corresponding solution set whose calculation can be carried out by a general unified method based on a relatively new concept of constraint intervals. We also consider the smallest multidimensional intervals containing the solution sets. We propose several extensions of the interval setting to systems of linear equations where coefficients are fuzzy intervals. This unified setting clarifies many of the anomalous or inconsistent published results in various fuzzy interval linear systems studies