You are on page 1of 21

Fuzzy Inference Systems

Linguistic Hedges
Assist. Prof. Dr. Mohammed Najm Abdullah
https://itswtech.academia.edu/MohammedAlSalam
Linguistic Hedges
In linguistics, fundamental atomic terms are often modified with adjectives (nouns) or
adverbs (verbs) like very, low, slight , more or less, fairly, slightly, almost, barely, mostly,
roughly, approximately, and so many more that it would be difficult to list them all. We
will call these modifiers linguistic hedges: that is, the singular meaning of an atomic term
is modified, or hedged, from its original interpretation. Using fuzzy sets as the calculus
of interpretation, these linguistic hedges have the effect of modifying the membership
function for a basic atomic term (Zadeh, 1972). As an example, let us look at the basic
linguistic atom, α, and subject it to some hedges.
Linguistic Variable: Mean Delay, m
Linguistic Value Notation Numerical Range (normalised)
Very Short VS [0, 0.3]
Short S [0.1, 0.5]
Medium M [0.4, 0.7]
Linguistic Variable: Number of Servers, s
Linguistic Value Notation Numerical Range (normalised)
Small S [0, 0.35]
Medium M [0.30, 0.70]
Large L [0.60, 1]
Linguistic Variable: Repair Utilisation Factor, 
Linguistic Value Notation Numerical Range
Low L [0, 0.6]
Medium M [0.4, 0.8]
High H [0.6, 1]
Linguistic Variable: Number of Spares, n
Linguistic Value Notation Numerical Range (normalised)
Very Small VS [0, 0.30]
Small S [0, 0.40]
Rather Small RS [0.25, 0.45]
Medium M [0.30, 0.70]
Rather Large RL [0.55, 0.75]
Large L [0.60, 1]
Very Large VL [0.70, 1]
Fuzzy Systems

Inference
Input Fuzzifier Defuzzifier Output
Engine

Fuzzy
Knowledge base
Fuzzy Control Systems

Input
Inference
Fuzzifier Defuzzifier Plant Output
Engine

Fuzzy
Knowledge base
Inference
Input Fuzzifier Defuzzifier Output
Engine

Fuzzifier
Fuzzy
Knowledge base

Converts the crisp input to a linguistic


variable using the membership functions
stored in the fuzzy knowledge base.
Inference
Input Fuzzifier Defuzzifier Output
Engine

Fuzzifier
Fuzzy
Knowledge base

Converts the crisp input to a linguistic


variable using the membership functions
stored in the fuzzy knowledge base.
Inference
Input Fuzzifier Defuzzifier Output
Engine

Inference Engine
Fuzzy
Knowledge base

Using If-Then type fuzzy rules converts the


fuzzy input to the fuzzy output.
Inference
Input Fuzzifier Defuzzifier Output
Engine

Defuzzifier
Fuzzy
Knowledge base

Converts the fuzzy output of the inference


engine to crisp using membership functions
analogous to the ones used by the fuzzifier.
Fuzzy Inference Systems

Tsukamoto
Fuzzy models
Tsukamoto Fuzzy models

The consequent of each fuzzy if-then-


rule is represented by a fuzzy set with a
monotonical MF.
Tsukamoto Fuzzy models
R1: If X is small then Y is C1
R2: If X is medium then Y is C2
R3: if X is large then Y is C3
Example
Fuzzy Inference Systems

Partition Styles for Fuzzy


Models
Review Fuzzy Models

If <antecedence> then <consequence>.


The same style for Different styles for
• Mamdani Fuzzy models • Mamdani Fuzzy models
• Sugeno Fuzzy Models • Sugeno Fuzzy Models
• Tsukamoto Fuzzy models • Tsukamoto Fuzzy models

You might also like