Lecture 3.1.3

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 29

UNIVERSITY INSTITUTE OF ENGINEERING

DEPARTMENT OF AIT - CSE


Bachelor of Engineering (CSE)
SOFT COMPUTING (22CSH-345 )
By: Ms. Aarti (E15380)

DISCOVER . LEARN . EMPOWER


Course Objectives
To introduce soft computing concepts and techniques of artificial neural networks,
fuzzy sets, fuzzy logic and genetic algorithms

To understand the various techniques from the application point of view.

To analyze various soft computing techniques and decide the technique to be used in
a particular problem situation.

To implement soft computing based solutions for real-world problems

2
Course Outcomes
CO Identify and describe soft computing techniques and 1
1 their roles in building intelligent. Machines
CO Recognize the feasibility of applying a soft 2,4
2 computing methodology for a particular problem.
CO Apply fuzzy logic and reasoning to handle 3
3 uncertainty and solve engineering problems, genetic
algorithms to combinatorial optimization problems
and neural networks to pattern classification and
regression problems.
CO Effectively use modern software tools to solve real 3
4 problems using a soft computing approach.
CO Evaluate various soft computing approaches for a 4 3
Syllabus
Conta
Unit-3 Advanced Theories
ct
Hours
:15

Fuzzy Logic Fuzzy Set theory, Fuzzy versus Crisp set, Fuzzy Relation,
Fuzzification, Fuzzy Logic

Fuzzy Systems Fuzzy Rule based systems, Predicate logic, Fuzzy


Decision Making Fuzzy Control Systems, Fuzzy
Classification., Minmax Composition, Defuzzification
Method.

Genetic History of Genetic Algorithms (GA), Fundamentals of


Algorithms Genetic Algorithms, Encoding, Operators of Genetic
Algorithm, Basic Genetic Algorithm.
4
RELATIONS
 Relations represent mappings between sets and connectives in
logic.

 A classical binary relation represents the presence or absence of


a connection or interaction or association between the elements
of two sets.

 Fuzzy binary relations are a generalization of crisp binary


relations, and they allow various degrees of relationship
(association) between elements.

DISCOVER . LEARN . EMPOWER


CRISP CARTESIAN PRODUCT

DISCOVER . LEARN . EMPOWER


CRISP RELATIONS

DISCOVER . LEARN . EMPOWER


DISCOVER . LEARN . EMPOWER
CRISP BINARY RELATIONS

Examples of binary relations

DISCOVER . LEARN . EMPOWER


OPERATIONS ON CRISP RELATIONS

DISCOVER . LEARN . EMPOWER


PROPERTIES OF CRISP RELATIONS

The properties of crisp sets (given below) hold good for crisp relations
as well.

 Commutativity,
 Associativity,
 Distributivity,
 Involution,
 Idempotency,
 DeMorgan’s Law,
 Excluded Middle Laws.

DISCOVER . LEARN . EMPOWER


COMPOSITION ON CRISP RELATIONS

DISCOVER . LEARN . EMPOWER


COMPOSITION ON CRISP RELATIONS

DISCOVER . LEARN . EMPOWER


FUZZY CARTESIAN PRODUCT
Let R be a fuzzy subset of M and S be a fuzzy subset of N. Then the
Cartesian product R  S is a fuzzy subset of N  M such that

Example:

Let R be a fuzzy subset of {a, b, c} such that R = a/1 + b/0.8 + c/0.2


and S be a fuzzy subset of {1, 2, 3} such that S = 1/1 + 3/0.8 +
2/0.5. Then R x S is given by

DISCOVER . LEARN . EMPOWER


FUZZY RELATION

DISCOVER . LEARN . EMPOWER


DISCOVER . LEARN . EMPOWER
OPERATIONS ON FUZZY RELATION
The basic operation on fuzzy sets also apply on fuzzy relations.

DISCOVER . LEARN . EMPOWER


DISCOVER . LEARN . EMPOWER
PROPERTIES OF FUZZY RELATIONS
The properties of fuzzy sets (given below) hold good for fuzzy
relations as well.

 Commutativity,
 Associativity,
 Distributivity,
 Involution,
 Idempotency,
 DeMorgan’s Law,
 Excluded Middle Laws.

DISCOVER . LEARN . EMPOWER


COMPOSITION OF FUZZY RELATIONS

DISCOVER . LEARN . EMPOWER


DISCOVER . LEARN . EMPOWER
DISCOVER . LEARN . EMPOWER
DISCOVER . LEARN . EMPOWER
CLASSICAL EQUIVALENCE RELATION

DISCOVER . LEARN . EMPOWER


CLASSICAL TOLERANCE RELATION

DISCOVER . LEARN . EMPOWER


FUZZY EQUIVALENCE RELATION

DISCOVER . LEARN . EMPOWER


FUZZY TOLERANCE RELATION
A binary fuzzy relation that possesses the properties of reflexivity and
symmetry is called fuzzy tolerance relation or resemblance relation.

The equivalence relations are a special case of the tolerance relation.


The fuzzy tolerance relation can be reformed into fuzzy equivalence
relation in the same way as a crisp tolerance relation is reformed
into crisp equivalence relation, i.e.,

where ‘n’ is the cardinality of the set that defines R1.

DISCOVER . LEARN . EMPOWER


• TEXT BOOKS
T1. Timothy J. Ross, “Fuzzy Logic with Engineering
Applications”.
T2. S.N.Sivanandam, S.N Deepa, “Principles of Soft
Computing”
T3. Lofti Zadeh “Fuzzy Logic and Soft Computing”
Word Scientific, 1995.

Referen T4 Samir Roy,Udit Chakraborty, “Introduction to


Soft Computing:Neuro-Fuzzy and Genetic
Algorithms”, Pearson.
ces • REFERENCE BOOKS

R1. Bart Kosko, “Neural Network and Fuzzy


Systems: A Dynamic System Approach to
Machine” Prentice-Hall 1998

R2. Fausett, “Fundamentals of Neural Networks:


Architectures, Algorithms, and Applications”,
Prentice-Hall, 1994
R3. Jack M. Zurada, “Introduction to Artificial Neural
Systems”, PWS Publishing Co., Boston, 2000.
R4. J S R Jang, “Neuro-Fuzzy & Soft Computing,”,
Pearson.
DISCOVER . LEARN . EMPOWER
THANK YOU

For Queries:
aarti.e15380@cumail.in

29

You might also like