Professional Documents
Culture Documents
Lesson 1 (Fuzzy Sets)
Lesson 1 (Fuzzy Sets)
Fuzzy Logic
Fuzzy Logic - Lotfi A. Zadeh, Berkeley Superset of conventional (Boolean) logic that has been extended to handle the concept of partial truth Truth values (in fuzzy logic) or membership values (in fuzzy sets) belong to the range [0, 1], with 0 being absolute Falseness and 1 being absolute Truth. Deals with real world vagueness
Real-World Applications
ABS Brakes Expert Systems Control Units Bullet train between Tokyo and Osaka Video Cameras Automatic Transmissions
Example:
Note that:
A1 (1) = {K, 3, 1,1,3,K} A1 (0) = {K, 4, 2, 0, 2, 4, K}
Fuzzy Sets
Human reasoning often uses vague predicates
Individuals cannot be classified into two groups! (either true or false)
A : E [0,1]
A(x)
=y
Individual x belongs to some extent (y) to subset A y is the degree to which the individual x is tall
A(x) A(x)
=0 =1
Example
E = {0, , 100} (Age) Fuzzy sets: Young, Mature, Old
Membership Functions
Membership functions represent distributions of possibility rather than probability For instance, the fuzzy set Young expresses the possibility that a given individual be young Membership functions often overlap with each others
A given individual may belong to different fuzzy sets (with different degrees)
Membership Functions
For practical reasons, in many cases the universe of discourse (E) is assumed to be discrete
E = { x1 , x2 , K, xn }
The pair ( A(x), x), denoted by A(x)/x is called fuzzy singleton Fuzzy sets can be described in terms of fuzzy singletons
A = {( A ( x) / x)} = U A ( xi ) / xi
i =1 n
A ( x) = 0, x E
Equality: two fuzzy subsets A and B defined over E are equivalent iff
A ( x) = B ( x), x E
Union:
Complement:
A ( x) = 1 A ( x )
Examples:
C ( x) = 1 x C ( x) = 1 x 1 x
1 w w
Std . negation
(0, )
w (0, )
Sugeno Yager
C ( x) = (1 x )
Required properties:
T ( x, y ) = T ( y , x) x, y E commutativity T (T ( x, y ), z ) = T ( x, T ( y, z )) x, y, z E associativity ( x y ), ( w z ) T ( x, w) T ( y , z ) x, y, w, z E monotony T ( x, 0) = 0 x E absorption T ( x,1) = x x E neutrality
Required properties:
S ( x, y ) = S ( y , x) x, y E commutativity S ( S ( x, y ), z ) = S ( x, S ( y, z )) x, y, z E associativity ( x y ), ( w z ) S ( x, w) S ( y, z ) x, y, w, z E monotony S ( x,1) = 1 x E absorption S ( x, 0) = x x E neutrality
The minimum is the biggest t-norm The maximum is the smallest t-conorm
Only some tuples (T, S, C) meet this property In such cases the t-norm and the t-conorm are said to be dual w.r.t. the fuzzy complement
Examples:
(max, min, 1-id) (prod, sum, 1-id)
T ( x, S ( y , z )) = S (T ( x, y ), T ( x, z )) S ( x, T ( y, z )) = T ( S ( x, y ), S ( x, z ))
The only tuple satisfying this property is (max, min, 1-id)
It can be proved that S is a t-conorm s.t. tuple (T, S, C) is dual w.r.t. c-norm C Similarly, given S and an involutive C, we can define a dual T for S w.r.t. C as:
T (a, b) = C ( S (C (a), C (b)))
T ( x, C ( x)) =
It can be proved that distributive laws do not hold in such cases
Choice of T, S, and C
The selection of T, S, and C always depend on the concrete case or application
We need to determine which properties are required for our application
Example
Let us suppose that we are thirsty and we are thinking about going to a bar to have a drink However, we are reluctant to go to whatever bar We want to go to a bar satisfying the following requirements:
We want the bar to be traditional We want to go to a bar close to our home We want the drinks to be cheap
Example
To decide to which bar to go, we will make the following assumptions:
We consider that a bar is traditional if it started working 5 years or more ago A bar is close to our home if it is not farther than ten blocks A drink is cheap if it costs 1 Euro or less
Example
We know four different bars to which we can go:
Years 3 7 4 5
Blocks 3 12 9 10
Example
Using the classical set theory to solve this problem, we have that the chosen bar must satisfy the following logical formula:
Example
Using the classic set theory we are bounded to stay at home L
None of the bars satisfy our requirements!
This is not consistent with the fact we are thirsty We need a more flexible approach Let us now try the fuzzy set based approach
Example
We distinguish three fuzzy sets described by the following predicates:
The bar is traditional The bar is close to home The drink is cheap
Example
MF for the predicate the bar is traditional
Example
MF for the predicate the bar is close to home
Example
Membership function for the predicate the drink is cheap
Example
Now, the second step involves the selection of the fuzzy operators needed for this application In this case, we will use the following operators:
T = min, S = max, C = 1-id
In other cases we will have to carefully choose the fuzzy operators depending on the required properties for the concrete application
Example
Results obtained using fuzzy sets theory:
Blocks 1 0,6667 1 1