Scribd
Upload
69 views15 pages

Rule-Based Fuzzy Model

Rule-based fuzzy models represent relationships between variables using fuzzy if-then rules. There are two main types: linguistic fuzzy models where both antecedent and consequent are fuzzy propositions, and Takagi-Sugeno (TS) models where the antecedent is fuzzy and consequent is crisp. Linguistic fuzzy models capture qualitative knowledge as rules linking linguistic input and output variables defined by membership functions. The rules can be represented as a fuzzy relation and the model output computed using max-min composition of the input and this relation.

Uploaded by

Vivekanandhan Vijayan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
69 views15 pages

Rule-Based Fuzzy Model

Rule-based fuzzy models represent relationships between variables using fuzzy if-then rules. There are two main types: linguistic fuzzy models where both antecedent and consequent are fuzzy propositions, and Takagi-Sugeno (TS) models where the antecedent is fuzzy and consequent is crisp. Linguistic fuzzy models capture qualitative knowledge as rules linking linguistic input and output variables defined by membership functions. The rules can be represented as a fuzzy relation and the model output computed using max-min composition of the input and this relation.

Uploaded by

Vivekanandhan Vijayan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

Rule-Based Fuzzy Model

Rule-Based Fuzzy Model

In rule-based fuzzy systems, the relationships between variables are


represented by means of fuzzy if–then rules of the following general form:

If antecedent proposition then consequent proposition

The antecedent proposition is always a fuzzy proposition of the type


“~ x is A”
Where
~x is a linguistic variable and
A is a linguistic constant (term).
The proposition’s truth value (a real number between zero and one) depends on
the degree of match (similarity) between ~x and A.
Rule-Based Fuzzy Model

Depending on the form of the consequent two main types of rule-based fuzzy
models are distinguished:

•Linguistic fuzzy model: both the antecedent and the consequent are fuzzy
propositions.

•Takagi–Sugeno (TS) fuzzy model: the antecedent is a fuzzy proposition, the


consequent is a crisp function.
Rule-Based Fuzzy Model
Linguistic fuzzy model

The linguistic fuzzy model (Zadeh, 1973; Mamdani, 1977) has been introduced as a
way to capture available (semi-)qualitative knowledge in the form of if–then rules:

Here
~x is the input (antecedent) linguistic variable, and
Ai are the antecedent linguistic terms (constants).
Similarly,
~y is the output (consequent) linguistic variable and
Bi are the consequent linguistic terms.
Rule-Based Fuzzy Model
Linguistic fuzzy model
The linguistic fuzzy model (Zadeh, 1973; Mamdani, 1977) has been introduced as a
way to capture available (semi-)qualitative knowledge in the form of if–then rules:

The values of ~x (~y) and the linguistic terms Ai (Bi) are fuzzy sets defined in the
domains of their respective base variables. The membership functions of the
antecedent (consequent) fuzzy sets are then the mappings:

The linguistic terms Ai and Bi are usually selected from sets of predefined
terms, such as Small, Medium, etc. By denoting these sets by A and B
respectively, we have “Ai belongs to A” and “Bi belongs to B”.

The rule base and sets A and B constitute


the knowledge base of the linguistic model
Rule-Based Fuzzy Model
Linguistic fuzzy model
Example 1: Consider a simple fuzzy model which qualitatively describes how the
heating power of a gas burner depends on the oxygen supply (assuming a constant
gas supply). We have a scalar input, the oxygen flow rate (x), and a scalar output,
the heating power (y).
Rule-Based Fuzzy Model
Linguistic fuzzy model
Example:
the set of antecedent linguistic terms:
A = {Low, OK, High}
and the set of consequent linguistic terms:
B = {Low, High}
The qualitative relationship between the model input and output can be
expressed by the following rules:

R1: If O2 flow rate is Low then heating power is Low:


R2: If O2 flow rate is OK then heating power is High:
R3: If O2 flow rate is High then heating power is Low:

The meaning of the linguistic terms is defined by their membership functions


Rule-Based Fuzzy Model
Linguistic fuzzy model
Relational representation of a linguistic model
Each rule in the rule base, can be regarded as a fuzzy relation

This relation can be computed in two basic ways:

•by using fuzzy conjunctions (Mamdani method) and


•by using fuzzy implications (fuzzy logic method)
Rule-Based Fuzzy Model
Linguistic fuzzy model
Relational representation of a linguistic model
•fuzzy conjunctions (Mamdani method)
The relation R is computed by the minimum (^) operator:

Note that the minimum is computed on the Cartesian product space of X and Y , i.e.,
for all possible pairs of x and y.

The fuzzy relation R representing the entire model is given by the disjunction (union)
of the K individual rule’s relations Ri:

Now the entire rule base is encoded in the fuzzy relation R

The output of the linguistic model can be computed by the relational max-min
composition (o):
Rule-Based Fuzzy Model
Linguistic fuzzy model
Relational representation of a linguistic model

Example 1: Consider a simple fuzzy model which qualitatively describes how the
heating power of a gas burner depends on the oxygen supply (assuming a constant
gas supply). We have a scalar input, the oxygen flow rate (x), and a scalar output,
the heating power (y).

Example 2 Let us compute the fuzzy relation for the linguistic model of Example 1.
Consider an input fuzzy set to the model, A’ = [1; 0:6; 0:3; 0], which can be denoted
as Somewhat Low flow rate, as it is close to Low but does not equal Low. The result
of max-min composition is the fuzzy set B’ which gives the expected approximately
Low heating power. For A’ = [0; 0:2; 1; 0:2] (approximately OK), we obtain B’ i.e.,
approximately High heating power.

First we discretize the input and output domains,


for instance: X = {0; 1; 2; 3} and Y = {0; 25; 50; 75; 100}.
Rule-Based Fuzzy Model
Linguistic fuzzy model
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 by-passed.

Suppose an input fuzzy value ~x = A’, for which the output value B’ is given by the
relational composition:
Rule-Based Fuzzy Model
Linguistic fuzzy model
Max-min (Mamdani) Inference
Suppose an input fuzzy value ~x = A’, for which the output value B’ is given by the
relational composition:
Rule-Based Fuzzy Model
Linguistic fuzzy model
Max-min (Mamdani) Inference

Algorithm of Mamdani (max-min) inference


Rule-Based Fuzzy Model
Linguistic fuzzy model
Max-min (Mamdani) Inference

The entire algorithm, called the max-min or Mamdani inference, is visualized in


above fig.
Rule-Based Fuzzy Model
Linguistic fuzzy model
Max-min (Mamdani) Inference

Example 3: Let us take the input fuzzy set A’ = [1; 0.6; 0.3; 0] from Example 2 and
compute the corresponding ouput fuzzy set by the Mamdani inference method.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy