![]() |
|
|||
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
|
![]() |
[an error occurred while processing this directive]
4.4.3. Fuzzy Hebbian learning and associative memory as a realization of rule-based systemsLet us remind that in any associative memory we are concerned with the mechanisms of an efficient storage and recall. The data (items) to be handled are organized as the finite family of input-output pairs (associations), Here we confine ourselves to the pairs xi, yi lying in the unit hypercubes, [0,1]n and [0,1]m, respectively. Those are nothing but fuzzy sets in the condition and conclusion parts of the individual rules. The basic formulation of the associative memory problem is as follows: store the associations and propose a recall mechanism capable of retrieving the data without any corruption (error). Let for any x = x1, x2, ... , xn thus y becomes y1, y2,...,yn, respectively. Note that this nothing but the testing condition promoted during the design of the rule-based system at its linguistic (conceptual) level. In what follows we outline a generic form of the transformation scheme. The functional concept of the rule-based system splits into two phases:
The above general scheme can be realized in various ways (by coming up with the different realizations of the summarization and association steps). The standard way is the one exploiting fuzzy Hebbian learning and recall (this becomes an essence of the processing module). Before getting to that, let us summarize some of the basic facts about associative memories, cf. (Kosko, 1992). In this setting the association structure This form of the aggregation is known as Hebbian learning.1 The recall scheme is also of a linear nature producing the recall vector,
for a given item x. The fundamental issue of error-free recall can be addressed by analyzing the character of the associations to be stored in the memory. It is easy to verify that if the inputs of the associations are mutually orthonormal, viz. then the recall is error-free. To validate this claim, simply put as the first term of the expression vanishes because of the orthonormality condition. Note also that if the orthonormality requirement does not hold, then y ≠ yk0; the first term forms a crosstalk component that is responsible for any distortions in the recall process. Two observations arise:
We have concentrated on this scheme of the associative memory as the fuzzy controller forms a straightforward analog of this construct; the only technical difference lies in the different operations being used in the associative memory and fuzzy controller. Similarly, the strengths and weaknesses of the discussed structure can be also found in the fuzzy controller. Let us focus on the input-output associations (conditions - conclusions), with Ak and Bk viewed as fuzzy sets defined in the corresponding finite universes of discourse, namely Ak ∈ [0, 1]n, Bk ∈ [0, 1]m. The crosstalk between the rules occurring due to Hebbian learning and the introduced architecture can be well illustrated in Fig. 4.6 where for clarity of presentation the rules include overlapping sets (as opposed to fuzzy sets). This figure illustrates that in the regions of their overlap the result of the mapping generates a sum of B1 and B2.
The following are the fundamental information processing properties of the Hebbian realization of the rule-based system:
This relationship is a manifestation of the crosstalk phenomenon; refer to Fig. 4.6.
Copyright © CRC Press LLC
![]() |
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |