Fuzzy Logic (1) Intelligent System Course. Apples, oranges or in between? A O Group of appleGroup of orange A A AA A A O O O O O O.

Slides:



Advertisements
Similar presentations
1.5 Set Operations. Chapter 1, section 5 Set Operations union intersection (relative) complement {difference}
Advertisements

Union Definition: The union of sets A and B, denoted by A B, contains those elements that are in A or B or both: Example: { 1, 2, 3} {3, 4, 5} = { 1,
Computational Intelligence Winter Term 2010/11 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
 Union  Intersection  Relative Complement  Absolute Complement Likened to Logical Or and Logical And Likened to logical Negation.
Computational Intelligence Winter Term 2014/15 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Fuzzy Set and Opertion. Outline Fuzzy Set and Crisp Set Expanding concepts Standard operation of fuzzy set Fuzzy relations Operations on fuzzy relations.
Prof. Johnnie Baker Module Basic Structures: Sets
Robert Jackson Marks II2 Based on intuition and judgment No need for a mathematical model Relatively simple, fast and adaptive Less sensitive to system.
Discrete Structures & Algorithms Basics of Set Theory EECE 320 — UBC.
(CSC 102) Discrete Structures Lecture 14.
Fuzzy Sets and Applications Introduction Introduction Fuzzy Sets and Operations Fuzzy Sets and Operations.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
SET.   A set is a collection of elements.   Sets are usually denoted by capital letters A, B, Ω, etc.   Elements are usually denoted by lower case.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
PART 1 From classical sets to fuzzy sets 1. Introduction 2. Crisp sets: an overview 3. Fuzzy sets: basic types 4. Fuzzy sets: basic concepts FUZZY SETS.
CLASSICAL RELATIONS AND FUZZY RELATIONS
Fuzzy Logic C. Alternate Fuzzy Logic F1F1. General Fuzzy Complement Axioms Boundary Conditions: c(0)=1; c(1)=0 Monotonicity: If a > b, then c(a)  c(b)
CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.
PART 3 Operations on fuzzy sets
Fuzzy Logic B. Logic Operations. Conventional or crisp sets are binary. An element either belongs to the set or doesn't. Fuzzy sets, on the other hand,
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.
Boolean Algebra Computer Organization 1 © McQuain Boolean Algebra A Boolean algebra is a set B of values together with: -two binary operations,
Fuzzy Logic Conception Introduced by Lotfi Zadeh in 1960s at Berkley Wanted to expand crisp logic.
Classical Sets and Fuzzy Sets
1 Sets CS 202, Spring 2007 Epp, chapter 5 Aaron Bloomfield.
Michaelmas Term 2004 Discrete Mathematics CSC 141 Discrete Mathematics Dr. Corina Sas and Ms. Nelly Bencomo
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
Lecture 2.2: Set Theory* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
CS201: Data Structures and Discrete Mathematics I
Fuzzy Sets and Control. Fuzzy Logic The definition of Fuzzy logic is a form of multi-valued logic derived frommulti-valued logic fuzzy setfuzzy set theory.
Chapter 2 The Operation of Fuzzy Set. 2.1 Standard operations of fuzzy set Complement set Union A  B Intersection A  B difference between characteristics.
Topic 2 Fuzzy Logic Control. Ming-Feng Yeh2-2 Outlines Basic concepts of fuzzy set theory Fuzzy relations Fuzzy logic control General Fuzzy System R.R.
Slides for Fuzzy Sets, Ch. 2 of Neuro-Fuzzy and Soft Computing Provided: J.-S. Roger Jang Modified: Vali Derhami Neuro-Fuzzy and Soft Computing: Fuzzy.
Introduction to Set theory. Ways of Describing Sets.
Discrete Mathematics SETS. What is a set? ^A set is a unordered collection of “objects”  People in a class: {A yşe, B arış, C anan }  Cities in Turkey.
Lecture # 12 Set Identities
Computational Intelligence Winter Term 2015/16 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
CLASSICAL RELATIONS AND FUZZY RELATIONS
Discrete Mathematics. Set Theory - Definitions and notation A set is an unordered collection of elements. Some examples: {1, 2, 3} is the set containing.
Lecture 2.2: Set Theory CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Chapter 2: FUZZY SETS Introduction (2.1)
Discrete Mathematics CS 2610 January 27, part 2.
Discrete Mathematics Set.
George Boole Set Theory More Set Theory – Union (“OR”) X is the set of men, Y is the set of women X + Y = ? Y + X = ?
1 Vagueness The Oxford Companion to Philosophy (1995): “Words like smart, tall, and fat are vague since in most contexts of use there is no bright line.
Fuzzy Sets Neuro-Fuzzy and Soft Computing: Fuzzy Sets ...
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Computational Intelligence Winter Term 2015/16 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Introduction to Computational Intelligence Abraham varghese
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
Chapter 1: Outcomes, Events, and Sample Spaces men 1.
Set Operations CS 202, Spring 2008 Epp, chapter 5.
Discrete Structures – CNS 2300
Discrete Mathematical The Set Theory
Computational Intelligence
Sets Section 2.1.
Computational Intelligence
Set Operations Section 2.2.
Computational Intelligence
Computational Intelligence
Discrete Mathematics R. Johnsonbaugh
Fuzzy Logic Colter McClure.
Principles of Computing – UFCFA Lecture-2
CS 250, Discrete Structures, Fall 2013
Classical Sets and Fuzzy Sets
Computational Intelligence
CSC102 - Discrete Structures (Discrete Mathematics) Set Operations
Introduction to Fuzzy Set Theory
Intelligent System Course
Presentation transcript:

Fuzzy Logic (1) Intelligent System Course

Apples, oranges or in between? A O Group of appleGroup of orange A A AA A A O O O O O O

Lotfi Zadeh

Thinking in Fuzzy A O A A A A A A O O O OO O Fuzzy group of applesFuzzy group of oranges

Crisp vs Fuzzy Crisp sets handle only 0s and 1s Fuzzy sets handle all values between 0 and 1 Crisp NoYes Fuzzy NoSlightlyMostlyYes

Fuzzy Set Notation Continuous Discrete

Continuous Fuzzy Membership Function x B (x) The set, B, of numbers near to two is

Discrete Fuzzy Membership Function The set, B, of numbers near to two is x B (x)

Example Example Fuzzy Sets to Aggregate... A = { x | x is near an integer} B = { x | x is close to 2} x A (x) x B (x) 1

Fuzzy Union Fuzzy Union (logic or) 4Meets crisp boundary conditions 4Commutative 4Associative 4Idempotent

Fuzzy Union - example A OR B = A+B ={ x | (x is near an integer) OR (x is close to 2)} = MAX [ A (x), B (x) ] x A+B (x)

Fuzzy Intersection Fuzzy Intersection (logic and) 4Meets crisp boundary conditions 4Commutative 4Associative 4Idempotent

Fuzzy Intersection - example A AND B = A·B ={ x | (x is near an integer) AND (x is close to 2)} = MIN [ A (x), B (x) ] x A B (x)

Fuzzy Complement The complement of a fuzzy set has a membership function... 4Meets crisp boundary conditions 4Two Negatives Should Make a Positive 4Law of Excluded Middle: NO! 4Law of Contradiction: NO!

Fuzzy Complement - example x 1 complement of A ={ x | x is not near an integer}

Fuzzy Associativity (1) Min-Max fuzzy logic has intersection distributive over union... since min[ A,max(B,C) ]=min[ max(A,B), max(A,C) ]

Fuzzy Associativity (2) Min-Max fuzzy logic has union distributive over intersection... since max[ A,min(B,C) ]= max[ min(A,B), min(A,C) ]

Fuzzy and DeMorgans Law (1) Min-Max fuzzy logic obeys DeMorgans Law #1... since 1 - min(B,C)= max[ (1-B), (1-C)]

Fuzzy and DeMorgans Law (2) Min-Max fuzzy logic obeys DeMorgans Law #2... since 1 - max(B,C)= min[(1-B), (1-C)]

Fuzzy and Excluded Middle Min-Max fuzzy logic fails The Law of Excluded Middle. since min( A,1- A ) 0 Thus, (the set of numbers close to 2) AND (the set of numbers not close to 2) null set

Fuzzy and the Law of Contradiction Min-Max fuzzy logic fails the The Law of Contradiction. since max( A,1- A ) 1 Thus, (the set of numbers close to 2) OR (the set of numbers not close to 2) universal set

Cartesian Product The intersection and union operations can also be used to assign memberships on the Cartesian product of two sets. Consider, as an example, the fuzzy membership of a set, G, of liquids that taste good and the set, LA, of cities close to Los Angeles

Cartesian Product We form the set... E = G · LA = liquids that taste good AND cities that are close to LA The following table results... LosAngeles(0.0) Chicago (0.5) New York (0.8) London(0.9) Swamp Water (0.0) Radish Juice (0.5) Grape Juice (0.9)