2. Soft Computing
β’ Introduced by Lotfi A. Zadeh, University of California, Berkley
β’ Collection of computational methods
β’ Includes Fuzzy Systems, Neural Networks and Evolutionary Algorithms
β’ Deployment of soft computing for the solution of machine learning problems has led to high Machine Intelligence
Quotient
UITE221 SOFT COMPUTING 2
Image Credit: Electrical Engineering and Computer Sciences, UC, Berkeley
βSoft computing differs from hard computing (conventional computing) in its tolerance to
imprecision, uncertainty and partial truthβ
-Lotfi A. Zadeh
4. Fuzzy Logic
βAs the complexity of a system increases, it becomes more difficult and
eventually impossible to make a precise statement about its behavior, eventually arriving
at a point of complexity where the fuzzy logic method born in humans is the only way to
get at the problem.β
-Lotfi A. Zadeh
UITE221 SOFT COMPUTING 4
Image Credit: Electrical Engineering and Computer Sciences, UC, Berkeley
5. Fuzzy Logic (Contd.)
Introduced in they year 1965
Japanese have utilized the full potential of fuzzy sets by commercializing the technology
Fuzziness means βvaguenessβ
Mathematical tool to handle uncertainty arising due to vagueness
Understanding human speech, handwriting recognition
UITE221 SOFT COMPUTING 5
6. Fuzzy Logic (Contdβ¦)
UITE221 SOFT COMPUTING 6
Fuzz Logic System
Imprecise and
vague data Decisions
0.5
1.0 Tall
150 180 210
Membership
Height (cm)
0.5
1.0 Tall
150 180 210
Membership
Height (cm)
Short Medium
7. Fuzzy Logic (Contdβ¦)
β’ Describe tall or short or medium heightβ¦
β’ βshortβ and βtallβ are linguistic variables
β’ Set membership helps appropriately to distinguish linguistic variables
β’ Various degree of membership on a real continuous interval [0,1]
β’ Fuzzy sets accommodate the degrees of membership
UITE221 SOFT COMPUTING 7
This Photo by Unknown Author is
licensed under CC BY-SA-NC
8. Fuzzy Logic (Contdβ¦)
β’ A fuzzy set π΄ contains an object π₯ to degree π(π₯)
β’ π π₯ = π·πππππ(π₯ β π΄) and the map π: π β {πππππππ βππ π·ππππππ } is called a set function or a membership function
β’ Fuzzy set π΄ can be expressed as A = π₯, π π₯ , π₯ β π which defines the possibility distribution
β’ Fuzzy sets form the building blocks for fuzzy IF-THEN rules which is of general form βIF X is A THEN Y is Bβ
β’ Fuzzy systems refer to the systems governed by fuzzy IF-THEN rules
β’ IF part of the implication is called antecedent and THEN part is called precedent
β’ Possess partial matching capability
UITE221 SOFT COMPUTING 8
9. Fuzzy Logic (Contdβ¦)
β’ Rule based system constructed from the collection of linguistic rules on one hand
β’ Non-linear mappings of inputs (stimuli) to outputs (response) on the other hand
β’ Inputs and outputs can be numbers or vectors of numbers
β’ Rule-based systems can be any system with arbitrary accuracy, i.e., they work as universal approximators
β’ Smart rules give smart system
β’ Number of rules increases exponentially with the dimension of the input space
β’ Rule explosion is called the curse of dimensionality
UITE221 SOFT COMPUTING 9
10. Classical sets (Crisp sets)
β’ Set is a collection of objects sharing certain characteristics
β’ No partial membership exist in crisp sets
β’ Crisp set is defines by its characteristic function
UITE221 SOFT COMPUTING 10
11. Universe of discourse
β’ Also known as universal set (U)
β’ Contains all possible elements having the same characteristics, from which sets can be formed
β’ Crisp set A in universe U
β’ An object π₯ is a member of given set π΄ (π₯ β π΄) ; π₯ belongs to π΄
β’ An object x is not a member of given set A (π₯ β π΄); x does not belong to A
UITE221 SOFT COMPUTING 11
U
A
12. Defining a set
β’ List of all the members of a set may be given
π΄ = 2,4,6,8,10
β’ The properties of the set of elements may be specified
π΄ = {π₯|π₯ππ ππ£ππ ππ’ππππ β€ 10}
β’ The formula for the definition of a set may be mentioned
π΄ = π₯π =
π₯π + 1
5
, π = 1 π‘π 10, π€βπππ π₯π = 1
UITE221 SOFT COMPUTING 12
13. Defining a set (Contdβ¦)
β’ Basis of the results of a logical operation
π΄ = π₯|π₯ ππ ππ πππππππ‘ πππππππππ π‘π π π΄ππ· π
β’ There exist a membership function, usually denoted by π
ππ΄ π₯ =
1 ππ π₯π π΄
0 ππ π₯ β π΄
β’ Empty set or null set is usually denoted by π, which indicates the occurrence of an impossible event
β’ Set containing the possible subsets of a given set A is called a power set
π π΄ = {π₯|π₯ β π΄}
UITE221 SOFT COMPUTING 13
14. Operations on Classical Sets: Union
π΄ βͺ π΅ = {π₯|π₯ β π΄ ππ π₯ β π΅}
UITE221 SOFT COMPUTING 14
A B
15. Operations on Classical Sets: Intersection
π΄ βͺ π΅ = {π₯|π₯ β π΄ πππ π₯ β π΅}
UITE221 SOFT COMPUTING 15
A B
16. Operations on Classical Sets: Complement
π΄ = {π₯|π₯ β π΄ , π₯ β π}
UITE221 SOFT COMPUTING 16
A
21. Fuzzy Set Operations: Union
The union of fuzzy sets Type equation here.
UITE221 SOFT COMPUTING 21
22. References
Rajasekaran, S., & Pai, G. V. (2017). Neural Networks, Fuzzy Systems and Evolutionary Algorithms: Synthesis and
Applications. PHI Learning Pvt. Ltd..
Haykin, S. (2010). Neural Networks and Learning Machines, 3/E. Pearson Education India.
Sivanandam, S. N., & Deepa, S. N. (2007). Principles of soft computing. John Wiley & Sons.
UITE221 SOFT COMPUTING 22