Algorithms for solving fuzzy relational equations in a probabilistic setting
β Scribed by W. Pedrycz
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 709 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we discuss the solution of a system of fuzzy linear equations, X = AX + U , and its iteration algorithms where A is a real n Γ n matrix, the unknown vector X and the constant U are all vectors consisting of n fuzzy numbers, and the addition, scale-multiplication are deΓΏned by Zadeh's
In this paper, we first design a fuzzy neuron which possesses some generality. This fuzzy neuron is founded by replacing the operators of the traditional neuron with a pair of abstract fuzzy operators as (~, ~ ) which we call fuzzy neuron operators. For example, it may be (+, o), (A, "), (V, o), or
In our previous work (Li and Ruan, 1997) we proposed a max-min operator network and a series of training algorithms, called fuzzy rules, which could be used to solve fuzzy relation equations. The most basic and important result is the convergence theorem of fuzzy perceptron based on max-min operator