• Tidak ada hasil yang ditemukan

Soft Computing

N/A
N/A
Protected

Academic year: 2025

Membagikan "Soft Computing"

Copied!
8
0
0

Teks penuh

(1)

FACULTY OF EGINEERING AND TECHNOLOGY

LECTURE -10

Umesh Kumar Gera Assistant Professor

Computer Science & Engineering

Soft Computing

(2)

OUTLINE

Fuzzy Operations

Union

Intersection

Complement

Fuzzy Operators

Fuzzy set vs. Crisp Set

Reference

(3)

FUZZY OPERATIONS

Fuzzy Operations Union:

Let µAand µBbe membership functions that define the fuzzy sets A and B, respectively, on the universe X. The union of fuzzy sets A and B is a fuzzy set defined by the membership function:

µAUB(x) = Max(µA(x),µB(x))

Intersection:

Let µA and µBbe membership functions that define the fuzzy sets A y B, respectively, on the universe X. The intersection of fuzzy sets A and B is a fuzzy set defined by the membership function:

µA∩B(x) = Min(µA(x),µB(x))

Complement:

Let µAbe a membership function that defines the fuzzy set A, on the universe X. The complement of A is a fuzzy set defined by the membership function:

µAc(x) = 1 - µA(x)

(4)

FUZZY OPERATORS

Fuzzy Operators

t-norms and t-conorms are binary operators that generalize intersection and union operations, respectively.

t-norm: it is a binary operation T: [0,1] x [0,1] → [0,1] which satisfies the following properties:

Commutativity: T(a,b) = T(b,a)

Associativity: T(a, T(b,c)) = T(T(a,b), c)

Identity element: T(a,1) = T(1,a) = a

Monotonicity: if a ≤ c and b ≤ d then T(a,b) ≤ T(c,d)

These operators represent the intersection of two fuzzy sets. Some examples of t-norms are the minimum min(a,b), the productprod(a,b) = a•b and

Lukasiewicz W(a,b)=max(0,a+b-1).

(5)

t-conorm:

. it is a binary operation S: [0,1] x [0,1] → [0,1] which satisfies the following properties:

Commutativity: S(a,b) = S(b,a)

Associativity: S(a, S(b,c)) = S(S(a,b), c)

Identity element: S(a,0) = S(0,a) = a

Monotonicity: if a ≤ c and b ≤ d then S(a,b) ≤ S(c,d)

These operators represent the union of two fuzzy sets. Some examples of t-conorms are the maximummax(a,b), the probabilistic sum or sum-productsum-prod (a,b) = a+b -a•b and LukasiewiczW*(a,b)=min(1,a+b).

FUZZY OPERATORS

(6)

Fuzzy set vs. Crisp Set

.

FUZZY OPERATORS

(7)

MULTIPLE CHOICE QUESTION

6. A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0.

a) True b) False

c) Sometimes – it can also output intermediate values as well

d) Can’t say

7. What is the name of the function in the following statement “A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0”?

a) Step function b) Heaviside function c) Logistic function d) Perceptron function

8. Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results.

a) True – this works always, and these multiple perceptrons learn to classify even complex problems

b) False – perceptrons are mathematically incapable of solving linearly inseparable functions, no matter what you do

c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded

d) False – just having a single perceptron is enough

9. The network that involves backward links from output to the input and hidden layers is called _________

a) Self organizing maps b) Perceptrons

c) Recurrent neural network d) Multi layered perceptron

10. Which of the following is an application of NN (Neural Network)?

a) Sales forecasting b) Data validation c) Risk management d) All of the mentioned

(8)

REFERENCES

http://www.dma.fi.upm.es/recursos/aplicaciones/logica_borrosa/web/fuzzy_inferencia/fuzzyop_en.htm

https://cse.iitkgp.ac.in/~dsamanta/courses/archive/sca/Archives/Chapter%201%20Fuzzy%20set.pdf

Referensi

Dokumen terkait

In this search we need to introduce two new fuzzy sets: the Maximizing Fuzzy Set, M, and the minimizing Fuzzy Set, m, associated to the function (crisp or fuzzy), f.. We define

This section elucidates the theory of fuzzy sets relating to satisfaction on performance and the fuzzy conjoint analysis method. In classical set theory, a set is defined as

The candidate summary can be written as z=ITI T = U,=, t,, a union of fuzzy sets and, the fuzzy recall score can be computed as T F = 3 The S-Norm operator V 3.1 MAX union

Real Analysis: Review of differentiation and integration, Real numbers a complete ordered field, Limit Point, Closed and Open sets, Union and Intersection of such sets; Concept of

Maji et alintroduced the concept of Fuzzy Soft Set and some properties regarding fuzzy soft union, intersection, complement of a fuzzy soft set, De Morgan Law etc.. In this paper, I

First to be introduced is the Bellman–Zadeh 1970 approach, according to which decision making is defined as intersection of goals and constraints described by fuzzy sets.. The second

We define a new class of hesitancy fuzzy graph, the intuitionistic hesitancy fuzzy graph in which the degree of hesitancy of a vertex is independent of the degree of its membership and