Scribd
Upload
43 views21 pages

SC Chap3Fall2016 PART I

This document discusses fuzzy rules and fuzzy reasoning. It begins by introducing linguistic variables, fuzzy if-then rules, and fuzzy reasoning. It then explains the extension principle and how it can extend functions from crisp to fuzzy domains. Some examples are provided to illustrate fuzzy addition and other arithmetic operations using the extension principle. The document also discusses fuzzy relations, fuzzy Cartesian products, and properties of fuzzy relations like union and intersection.

Uploaded by

Mohammed Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
43 views21 pages

SC Chap3Fall2016 PART I

This document discusses fuzzy rules and fuzzy reasoning. It begins by introducing linguistic variables, fuzzy if-then rules, and fuzzy reasoning. It then explains the extension principle and how it can extend functions from crisp to fuzzy domains. Some examples are provided to illustrate fuzzy addition and other arithmetic operations using the extension principle. The document also discusses fuzzy relations, fuzzy Cartesian products, and properties of fuzzy relations like union and intersection.

Uploaded by

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

‫مساق الحوسبة البرمجية‬

Soft Computing 8702661

Dr. Labib Arafeh,


Associate Professor
[email protected]

Ch3 SC Fall 2016 1


Fuzzy Rules and Fuzzy
Reasoning
• Introduction;
• Extension principle and Fuzzy Relations:
–Extension Principle;
–Fuzzy Relations.
• Fuzzy If-Then Rules:
–Linguistic Variables;
–Fuzzy If-Then Rules.
•Fuzzy Reasoning:
–Compositional Rule of Inference;
–Fuzzy Reasoning.
Ch3 SC Fall 2016 2
Introduction
• Linguistic Variables and values: Are efficient tools for
quantitative modeling of words or sentences in a natural
or artificial language;
• Fuzzy Rules & Fuzzy Reasoning: Are the backbone of fuzzy
inference systems, the most important modeling tool is
based on fuzzy set theory;
• Different schemes to accomplish these goals depending
on our understanding and boundary conditions of the
world.
• Extending:
– Crisp domains to fuzzy domains Extension Principle;
– n-ary (Binary (OR, XOR, AND), Ternary (?:  e1 ? e2 : e3),
Quaternary (4-D/Variables), Quinary (5-D/Variables))
fuzzy relations: Fuzzy Relations.
Ch3 SC Fall 2016 3
⁻ Fuzzy domains to Fuzzy domains: Fuzzy Inference (fuzzy
rules, compositional rules of inference)
• Basics: Consider a function y = f (x).
• If we know x, it is possible to determine y.
• Is it possible to extend this mapping when the input, x, is a
fuzzy value?
• The extension principle developed by Zadeh (1975) and
later by Yager (1986) establishes how to extend the domain
of a function on a fuzzy sets.
• A crisp function maps its crisp input argument to its image.
• Fuzzy arguments have membership degrees.
• When computing a fuzzy mapping, it is necessary to
compute the image and its membership value.
Ch3 SC Fall 2016 4
• Extension principle: provides a general procedure for
extending crisp domains of mathematical expressions or
equations to fuzzy domains.
– Thus, the procedure generalizes a common point-to-
point mapping of a function f(.) to a mapping between
fuzzy sets.
• A function f from X to Y and a fuzzy set A on X defined as:
A   A ( x1 ) / x1   A ( x2 ) / x2     A ( xn ) / xn
• The image of fuzzy set A under the mapping f(.) is a fuzzy
set B (extension principle):
B  f ( A)   B ( x1 ) / y1   B ( x2 ) / y2     B ( xn ) / yn
Where, y i = f ( x i ) , i = 1 , … . , n .
Ch3 SC Fall 2016 5
• In a general form:

• Crisp Mappings

Ch3 SC Fall 2016 6


• Application of the extension principle to fuzzy sets
with discrete universes:
Let A = 0 . 1 / - 2 + 0 . 4 / - 1 + 0 . 8 / 0 + 0 . 9 / 1 + 0 . 3 / 2
and f(x) = x 2 – 3
• Upon applying the extension principle (The image of fuzzy
set A under the mapping f(x) is a fuzzy set B), we have:
B = 0.1/1 + 0.4/-2 + 0.8/-3 + 0.9/-2 + 0.3/1
= 0.8/-3 + (0.4 V 0.9)/-2 + (0.1 V 0.3)/1
= 0.8/-3 + 0.9/-2 + 0.3/1

Ch3 SC Fall 2016 7


• Extension Principle for Continuous Variables:
Let 𝝁𝑨 𝒙 = 𝒃𝒆𝒍𝒍(𝒙; 𝟏. 𝟓, 𝟐, 𝟎. 𝟓) and

(𝒙 − 𝟏)𝟐 −𝟏 𝒊𝒇 𝒙 ≥ 𝟎
f(x) = ൝
𝒙 𝒊𝒇 𝒙 < 𝟎

Ch3 SC Fall 2016 8


• Consider Around-4=0.3/2+0.6/3+1.0/4+0.6/5+0.3/6
and Y = f(x) = x2 -6x +11
y = 0.3 / f(2) + 0.6 / f(3) + 1.0 / f(4) + 0.6 / f(5) + 0.3 /f(6)
y = 0.3 / 3 + 0.6 / 2 + 1 / 3 + 0.6 / 6 + 0.3 / 11
y = 0.6 / 2 + (0.3 v 1) / 3 + 0.6 / 6 + 0.3 / 11
y = 0.6 / 2 + 1 / 3 + 0.6 / 6 + 0.3 / 11

Ch3 SC Fall 2016 9


• Let the function: y = f(x) = 0.6*x + 4
• Input: Fuzzy number: around-5
Around-5 = 0.3 / 3 + 1.0 / 5 + 0.3 / 7
f(around-5) = 0.3 / f(3) + 1 / f(5) + 0.3 / f(7)
f(around-5)= 0.3 / (0.6*3 + 4) + 1.0 / (0.6*5 + 4) +
0.3 / (0.6*7 + 4)
f(around-5) = 0.3 / 5.8 + 1.0 / 7 + 0.3 / 8.2

Ch3 10
y
y

u(y)
u(x)

Ch3 SC Fall 2016 11


Fuzzy addition - Example
• A = (3~) = 0.3/1+0.6/2+1/3+0.6/4+0.3/5
• B =(11~)= 0.5/10 + 1/11 + 0.5/12
• A+B=(0.3^0.5)/(1+10) + (0.6^0.5)/(2+10) + (1^0.5)/(3+10) +
(0.6^0.5)/(4+10) + (0.3^0.5)/(5+10) + (0.3^1)/(1+11) +
(0.6^1)/(2+11) + (1^1)/(3+11) + (0.6^1)/(4+11) +
(0.3^1)/(5+11) + ( 0.3^0.5)/(1+12) + (0.6^0.5)/(2+12) +
(1^0.5)/(3+12) + (0.6^0.5)/(4+12) + (0.3^0.5)/(5+12)
• A+B=0.3/11 + 0.5/12 + 0.5/13 + 0.5/14 + 0.3/15 + 0.3/12 + 0.6/13 +
1/14 + 0.6/15 + 0.3/16 + 0.3/13 + 0.5/14 + 0.5/15 + 0.5/16 + 0.3/17
• Getting the maximum of the duplicated values
• A+B=0.3/11+0.5/12+0.6/13+1.0/14+0.6/ 15 + 0.5 / 16 + 0.3 / 17
A, x=3 B, y=11 C, x=14

0.
0.
6
0.
5
Ch3
3 12
Fuzzy Other Arithmetic
• Using the extension principle the remaining fuzzy
arithmetic fuzzy operations are defined as:
 A B ( z )    A ( x )   B ( y )
x, y
x y z

 A*B ( z )    A ( x)   B ( y )
x, y
x* y  z

 A / ( z )    A ( x)   B ( y )
x, y
x / yz
Ch3 SC Fall 2016 13
• Cartesian Product:
– The Cartesian product of two crisp sets X and Y is
defined as X  Y  {( x, y ) | x  X , y  Y }
– For n sets (Xi) the Cartesian product is defined as
X 1  X 2  X n  {( x1 , x2 ,, xn ) | xi  X i , i  1..n}
• Crisp Relations:
– A relation is a subset of the Cartesian product
– The Cartesian product can be considered a relation
without restrictions.
R ( X 1 , X 2 , , X n )  X 1  X 2    X n
– A relation is also a set, therefore the basic set concepts
such as union, intersection, complement, … can be
applied.
Ch3 SC Fall 2016 14
• Characteristic Function:
– Shows the strength of the relation between the pairs.
1 ( x, y )  R
 R ( x, y )  
0 ( x, y )  R
– Every tuple that belongs to the relation receives a value
1 and 0 otherwise.
• Binary Relations:
– A relation between two sets X and Y is called a binary
relation (R (X, Y)).
– Binary relations can be defined on a single set (R(X, X)).
– These relations are often referred as directed graphs or
digraphs
Ch3 SC Fall 2016 15
Fuzzy Relations
• Fuzzy relations R map elements from a set (X) into a set (Y)
• The strength of the relations is given by membership
functions that can vary between 0 and 1. R:XY[0:1]
• Let Ai be fuzzy sets.
• A fuzzy relation is a subset of the Cartesian product
R( A1 , A2 ,, An )  A1  A2   An
• The Cartesian product can be considered a relation
without restrictions.
• Binary Fuzzy R relations: Fuzzy sets with 2-D MFs (Two
Inputs, each in a different universe of discourse) in X x Y
that map element in X x Y to a membership grade between
0 and 1.
• That is, A fuzzy relation R is a 2D MF:
Ch3 SC Fall 2016 16
R  {((x, y), µ R (x, y)) | (x, y)  X  Y}
• Properties of Fuzzy Relations
– Let X and Y two fuzzy subsets defined on an Universe U.
– Let the elements x  X and y  Y with membership
degrees X(x) , Y(y).
– Let S be the Cartesian product X Y .
– Let R be a fuzzy relation on S.
• Operations with Fuzzy Relations:
Union :
R  S   R  S ( x, y )  max[  R ( x, y ),  S ( x, y )]
Intersecti on :
R  S   R  S ( x, y )  min[  R ( x, y ),  S ( x, y )]
Complement :
Ch3
 R ( x, y )  1   R ( x, y ) 17
• Fuzzy Cartesian Product
–A˜Let
B˜
be a fuzzy set on universe X, and
be a fuzzy set on universe Y, then

A˜  B˜  R˜  X  Y

R˜ (x, y)   A˜ xB˜ (x, y)  min(  A˜ (x),  B˜ (y))


Where the fuzzy relation R has membership function

Ch3 SC Fall 2016 18


• Fuzzy Cartesian Product: Example
– Let A˜ defined on a universe of three discrete
temperatures, X = {x1, x2, x3}, and
B˜ defined on a universe of two discrete pressures, Y =
{y1, y2}
– Fuzzy set A˜ represents the “ambient” temperature and
Fuzzy set B˜ the “near optimum” pressure for a certain
heat exchanger, and the Cartesian product might
represent the conditions (temperature-pressure pairs) of
the exchanger that are associated with “efficient”
operations. For example, let
y1 y2
0.2 0.5 1
A˜ 

}
  x1 0.2 0.2
x1 x 2 x3
and A˜  B˜  R˜  x 2 0.3 0.5
B˜ 
0.3 0.9
 x 3 
0.3 0.9

y1 y2
Ch3 19
• Example:

Let X = Y = R+ (+ve. Real line), and

R = “y is much greater than x”

The MF of the fuzzy relation R can be subjectively


(personally), defined as:

 yx
 , if y  x
 R ( x, y )   x  y  2
 0 , if y  x

Ch3 SC Fall 2016 20
 yx
 , if y  x
 R ( x, y )   x  y  2
 0 , if y  x

If X = {3,4,5} & Y = {3,4,5,6,7}, then it is convenient to
express the fuzzy relation R as a relation matrix:
where R { i , j } =  [ x i , y j ] 0 0.111 0.200 0.273 0.333
R  0 0 0.091 0.167 0.231
Examples (Others):  
0 0 0 0.077 0.143 
– x is close to y (x and y are numbers)
– x depends on y (x and y are events)
– x and y look alike (x and y are persons or objects)
– If x is large, then y is small (x is an observed reading
and Y is a corresponding action).
Ch3 SC Fall 2016 21

You might also like