Читать книгу Artificial Intelligence and Quantum Computing for Advanced Wireless Networks - Savo G. Glisic - Страница 67

Now consider an input fuzzy set to the model, A′ = [1, 0.6, 0.3, 0], which can be denoted as SomewhatLow traffic volume, as it is close to Low but does not equal Low. The result of max‐min composition defined by Eq. (4.34) gives

Similarly, by using the same procedure for the input set A′ = [0, 0.2, 1, 0.2] we obtain B ′ = max (A′ ∧ R) = [0.2, 0.2, 0.3, 0.9, 1].

Max‐min (Mamdani) inference: In the previous section, we have seen that a rule base can be represented as a fuzzy relation. The output of a rule‐based fuzzy model is then computed by the max‐min relational composition. In this section, it will be shown that the relational calculus can be bypassed. This is advantageous, as the discretization of domains and storing of the relation R can be avoided. To show this, suppose an input fuzzy value , for which the output value B′ is given by the relational composition:

(4.36)

After substituting for μ_R(x, y) from Eq. (4.33), the following expression is obtained:

(4.37)

Since the max and min operations are taken over different domains, their order can be changed as follows:

(4.38)

Denote as the degree of fulfillment of the i‐th rule’s antecedent. The output fuzzy set of the linguistic model is thus

(4.39)

The entire algorithm, called the max‐min or Mamdani inference, is summarized in Algorithm 4.1 and visualized in Figure 4.5.

Figure 4.5 A schematic representation of the Mamdani inference algorithm.