SRI MUTHUKUMARAN INSTITUTE OF TECHNOLOGY

Chikkarayapuram, Near Mangadu Chennai -600 069

Academic Year 2023 -2024 / Even Semester
Notes of Lesson
Branch : IT – VIth Semester
Sub Code: CCS 364
Subject : Soft Computing
Unit - I
Part A
1.What is soft computing?
Soft computing is defined as a group of computational techniques based on artificial intelligence (human like
decision) and natural selection that provides quick and cost effective solution to very complex problems for which
analytical (hard computing) formulations do not exist.
2.Define bias and threshold in soft computing.
Threshold is a guard deciding the activation of a neuron while bias is the smooth operator influencing the output.
3. ist the commonly used activation function in soft computing
An Activation Function decides whether a neuron should be activated or not. This means that it will decide
whether the neuron's input to the network is important or not in the process of prediction using simpler
mathematical operations.
4.What are the unique properties of soft computing?
Soft computing differs from conventional or hard computing in that, unlike hard computing, it is tolerant of
imprecision, uncertainty, partial truth, and approximate reasoning.
5.what are the techniques used in soft computing?
Soft computing is based on techniques such as fuzzy logic, genetic algorithms, artificial neural networks, machine
learning, and expert systems.
6.diffrence between hard computing and soft computing.
Hard computing needs exact input of the data and is sequential; on the other hand, Soft computing can handle an
abundance of data and handles multiple computations which might not be exact in a parallel way.
7.what are the properties of fuzzy relations?
The rule bases and the fuzzy relations may have algebraic properties, the commutative property, inverse, and
identity, but not the associative property.
8.Define membership function.
Membership function (MF) - A function that specifies the degree to which. a given input belongs to a set. •
Degree of membership- The output of a membership function, this value is always limited to between 0 and 1.
9.What are the principal constituents of soft computing?
Machine learning, fuzzy logic, evolutionary computation, Bayesian network, and chaos theory techniques are the
main components of soft computing.
10.What is the cardially of fuzzy set?
In many applications, one prefers a simple scalar approximation of cardinality of a fuzzy set. Scalar cardinality of
a fuzzy set is the sum of the membership values of all elements of the fuzzy set.
11.What is classical set and fuzzy set?
A classical set is defined by crisp(exact) boundaries, i.e., there is no uncertainty about the location of the set
boundaries. • A fuzzy set is defined by its ambiguous boundaries, i.e., there exists uncertainty about the location
of the set boundaries.
12.How to represent a fuzzy set in a computer?
Fuzzy sets are denoted or represented by the tilde (~) character.
13.What is degree of membership?
The membership degree quantifies the grade of membership of the element. to the fuzzy set. The value 0 means
that is not a member of the fuzzy set; the value 1 means that. is fully a member of the fuzzy set.
14.How to represent a fuzzy set in a computer?
the premise x is A and the consequent y is B can be true to a degree, instead of entirely true or entirely false. This
is achieved by representing the linguistic variables A and B using fuzzy sets.
15.State fuzzy inference.
Fuzzy inference is the process of formulating the mapping from a given input to an output using fuzzy logic. The
mapping then provides a basis from which decisions can be made or patterns discerned.
16.What is defuzzification?
Defuzzification may be defined as the process of reducing a fuzzy set into a crisp set or to convert a fuzzy
member into a crisp member. Mathematically, the process of Defuzzification is also called "rounding it off".
17.what is linguistic information?
Linguistic Variables :
Variables in mathematics normally take numeric values, although non-numeric linguistic variables are frequently
employed in fuzzy logic to make the expression of rules and facts easier.
18.Difference between crisp set and fuzzy set.
Crisp set defines the value is either 0 or 1. Fuzzy set defines the value between 0 and 1 including both 0 and 1. It
is also called a classical set. It specifies the degree to which something is true.
19.What is a fuzzy rule?
A fuzzy rule is a conditional "if-then" statement thusly stated: "If 'x' equals A. then 'y' equals B." It's the rule
which governs the operation of fuzzy logic controllers.
20.What is degree of membership?
The membership degree quantifies the grade of membership of the element. to the fuzzy set. The value 0 means
that is not a member of the fuzzy set; the value 1 means that. is fully a member of the fuzzy set. The values
between 0 and 1 characterize fuzzy members, which belong to the fuzzy set only partially.

1. Architecture of a Fuzzy Logic System

The 'Fuzzy' word means the things that are not clear or are vague. Sometimes, we cannot decide in real life
that the given problem or statement is either true or false. At that time, this concept provides many values
between the true and false and gives the flexibility to find the best solution to that problem.
Characteristics of Fuzzy Logic

Following are the characteristics of fuzzy logic:

This concept is flexible and we can easily understand and implement it.
It is used for helping the minimization of the logics created by the human.
It is the best method for finding the solution of those problems which are suitable for approximate or
uncertain reasoning.
It always offers two values, which denote the two possible solutions for a problem and statement.
It allows users to build or create the functions which are non-linear of arbitrary complexity.
In fuzzy logic, everything is a matter of degree.
In the Fuzzy logic, any system which is logical can be easily fuzzified.
It is based on natural language processing.
It is also used by the quantitative analysts for improving their algorithm's execution.
It also allows users to integrate with the programming.

Architecture of a Fuzzy Logic System

In the architecture of the Fuzzy Logic system, each component plays an important role. The architecture
consists of the different four components which are given below.

Rule Base
Fuzzification
Inference Engine
Defuzzification
1. Rule Base
Rule Base is a component used for storing the set of rules and the If-Then conditions given by the experts
are used for controlling the decision-making systems.
2. Fuzzification
Fuzzification is a module or component for transforming the system inputs, i.e., it converts the crisp number
into fuzzy steps.
3. Inference Engine
This component is a main component in any Fuzzy Logic system (FLS), because all the information is
processed in the Inference Engine. It allows users to find the matching degree between the current fuzzy
input and the rules.
4. Defuzzification
Defuzzification is a module or component, which takes the fuzzy set inputs generated by the Inference
Engine, and then transforms them into a crisp value. It is the last step in the process of a fuzzy logic system.

2. Fuzzy Inference System

Fuzzy Inference System is the key unit of a fuzzy logic system having decision making as its primary work.
It uses the “IF…THEN” rules along with connectors “OR” or “AND” for drawing essential decision rules.
Characteristics of Fuzzy Inference System

Following are some characteristics of FIS –

The output from FIS is always a fuzzy set irrespective of its input which can be fuzzy or crisp.

It is necessary to have fuzzy output when it is used as a controller.

A defuzzification unit would be there with FIS to convert fuzzy variables into crisp variables.

Functional Blocks of FIS

The following five functional blocks will help you understand the construction of FIS –

Rule Base – It contains fuzzy IF-THEN rules.

Database – It defines the membership functions of fuzzy sets used in fuzzy rules.

Decision-making Unit – It performs operation on rules.

Fuzzification Interface Unit – It converts the crisp quantities into fuzzy quantities.
Working of FIS

The working of the FIS consists of the following steps –

A fuzzification unit supports the application of numerous fuzzification methods, and converts the crisp
input into fuzzy input. A knowledge base – collection of rule base and database is formed upon the
conversion of crisp input into fuzzy input. The defuzzification unit fuzzy input is finally converted into crisp
output.

3. Methods of Fuzzy Inference System.

The two important methods of FIS, having different consequent of fuzzy rules –

1. Mamdani Fuzzy Inference System

2.Takagi-Sugeno Fuzzy Model (TS Method)

1.Mamdani Fuzzy Inference System

This system was proposed in 1975 by Ebhasim Mamdani. Basically, it was anticipated to control a steam
engine and boiler combination by synthesizing a set of fuzzy rules obtained from people working on the
system.
Steps for Computing the Output

Following steps need to be followed to compute the output from this FIS –

Step 1 – Set of fuzzy rules need to be determined in this step.

Step 2 – In this step, by using input membership function, the input would be made fuzzy.

Step 3 – Now establish the rule strength by combining the fuzzified inputs according to fuzzy rules.

Step 4 – In this step, determine the consequent of rule by combining the rule strength and the output
membership function.

Step 5 – For getting output distribution combine all the consequents.

Step 6 – Finally, a de fuzzified output distribution is obtained.

2. Takagi-Sugeno Fuzzy Model (TS Method)

This model was proposed by Takagi, Sugeno and Kang in 1985. Format of this rule is given as –

IF x is A and y is B THEN Z = f(x,y)

Here, AB are fuzzy sets in antecedents and z = f(x,y) is a crisp function in the consequent.
Fuzzy Inference Process

The fuzzy inference process under Takagi-Sugeno Fuzzy Model (TS Method) works in the following way
–

Step 1: Fuzzifying the inputs – Here, the inputs of the system are made fuzzy.

Step 2: Applying the fuzzy operator – In this step, the fuzzy operators must be applied to get the output.
4. Operations of Fuzzy set system.
Fuzzy sets can be considered as an extension and gross oversimplification of classical sets. It can be best
understood in the context of set membership. Basically it allows partial membership which means that it
contain elements that have varying degrees of membership in the set. From this, we can understand the
difference between classical set and fuzzy set. Classical set contains elements that satisfy precise properties
of membership while fuzzy set contains elements that satisfy imprecise properties of membership.
Fuzzy and Classical Set

Mathematical Concept
A fuzzy set A˜
in the universe of information U can be defined as a set of ordered pairs and it can be represented
mathematically as −

A˜={(y,μA˜(y))|y∈U}

Here μA˜(y)
= degree of membership of y in \widetilde{A}, assumes values in the range from 0 to 1, i.e., μA˜(y)∈[0,1]
5.Briefly explain about Fuzzy relations.
A crisp relation represents either the presence or the absence of an interconnectedness between the elements
of two or more sets (i.e association, interaction, etc.). Zadeh generalized this concept to take into account
various degrees of strength of relation [24] which can be rep- resented by membership grades in a fuzzy
relation.
More formally, a fuzzy relation is a fuzzy set defined on the Cartesian product of crisp sets X1 × X2, . . . ,
Xn in which tuples (x1, . . . , xn) will have varying degrees of membership within the relation. Such a
relation is denoted R(x1, . . . , xn) and is included in or equal to X1 × X2, . . . , Xn.
Several papers can be found in the literature about fuzzy relations on various domains. In the spatial domain,
[6] describes the relative positions of fuzzy geometrical region. Online temporal relations have been
introduced in between vague time periods or fuzzy events. Re-garding spatio-temporal relations, Le
Yaouanc et al proposed relations for assessing if and how an object is spatially evolving in a given time
span. The use of such relations change fuzzy rules into so-called fuzzy relational rules.
A fuzzy relational rule [13, 23] is a fuzzy rule that contain
a fuzzy relation in its antecedents, such as:
IF X1 is A1 ∧ · · · ∧ Xn is An ∧ { ∧ i,j,k ((Xi, Xj ) is Rk )}
THEN Y is B
where X1, . . . , Xn are the antecedent variables defined on the universes U1, . . . , Un, Y is the consequent
vari- able defined on the universe V , A1, . . . , An, B are fuzzy subsets and for each k Rk is a fuzzy relation
defined on Ui × Uj . ∧ is a t-norm.While the evaluation of the rule is complex in the general case, it is simple
when inputs are just singletons. For such inputs (x∗1, . . . , xn n), the strength of the rule is
F (y) = A1(x∗1 ) ∧ · · · ∧ An(x∗n) ∧ { ∧ i,j,k Rk (x∗ i , x∗ j )} ∧ B(y) (1)

5.Fuzzy Rules and Reasoning.

Fuzzy Logic Rule Base
It is a known fact that a human being is always comfortable making conversations in natural language. The
representation of human knowledge can be done with the help of following natural language expression −

IF antecedent THEN consequent

The expression as stated above is referred to as the Fuzzy IF-THEN rule base.

Canonical Form
Following is the canonical form of Fuzzy Logic Rule Base −

Rule 1 − If condition C1, then restriction R1

Rule 2 − If condition C1, then restriction R2

.

Rule n − If condition C1, then restriction Rn

Interpretations of Fuzzy IF-THEN Rules

Fuzzy IF-THEN Rules can be interpreted in the following four forms −

Assignment Statements
These kinds of statements use “=” (equal to sign) for the purpose of assignment. They are of the following
form −

a = hello

climate = summer
Conditional Statements
These kinds of statements use the “IF-THEN” rule base form for the purpose of condition. They are of the
following form −

IF temperature is high THEN Climate is hot

IF food is fresh THEN eat.

Unconditional Statements
They are of the following form −
GOTO 10

turn the Fan off

Categorical Reasoning
In this mode of approximate reasoning, the antecedents, containing no fuzzy quantifiers and fuzzy
probabilities, are assumed to be in canonical form.

Qualitative Reasoning
In this mode of approximate reasoning, the antecedents and consequents have fuzzy linguistic variables; the
input-output relationship of a system is expressed as a collection of fuzzy IF-THEN rules. This reasoning is
mainly used in control system analysis.

Syllogistic Reasoning
In this mode of approximation reasoning, antecedents with fuzzy quantifiers are related to inference rules.
This is expressed as −

x = S1A′s are B′s

y = S2C′s are D′s

------------------------
z = S3E′s are F′s

Here A,B,C,D,E,F are fuzzy predicates.

S1 and S2 are given fuzzy quantifiers.

S3 is the fuzzy quantifier which has to be decided.

Dispositional Reasoning
In this mode of approximation reasoning, the antecedents are dispositions that may contain the fuzzy
quantifier “usually”. The quantifier Usually links together the dispositional and syllogistic reasoning; hence
it pays an important role.

For example, the projection rule of inference in dispositional reasoning can be given as follows −

usually( (L,M) is R ) ⇒ usually (L is [R ↓ L])

Here [R ↓ L] is the projection of fuzzy relation R on L.