0% found this document useful (0 votes)
4 views17 pages

Lecture (1) Intro to Soft Computing

The lecture introduces soft computing, highlighting its significance in addressing complex real-world problems characterized by imprecision and uncertainty. It discusses various tools used in soft computing, such as neural networks and fuzzy logic, and contrasts soft computing with hard computing. The presentation emphasizes the adaptive nature of soft computing algorithms and their ability to evolve solutions without strict mathematical modeling.

Uploaded by

ramez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views17 pages

Lecture (1) Intro to Soft Computing

The lecture introduces soft computing, highlighting its significance in addressing complex real-world problems characterized by imprecision and uncertainty. It discusses various tools used in soft computing, such as neural networks and fuzzy logic, and contrasts soft computing with hard computing. The presentation emphasizes the adaptive nature of soft computing algorithms and their ability to evolve solutions without strict mathematical modeling.

Uploaded by

ramez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

Lecture

1
Introduction to Soft
Computing

By:
Dr. Aya Hossam
CONTENT

 Concept of Computation.
 What is Soft Computing?
 Soft Computing Tools
 Importance
 Future of Soft Computing
 Hard Computing Vs Soft Computing
INTRODUCTION

 More complex systems arising in biology, medicine, the


humanities, management sciences.

 Similar fields often remained intractable to conventional


mathematical and analytical methods

 Soft computing deals with imprecision, uncertainty, partial


truth, and approximation to achieve tractability, robustness
and low solution cost.
CONCEPT OF COMPUTATION

 y= f(x) is a mapping function.


 F is also called a formal method or an algorithm to
a problem.
IMPORTANT CHARACTERISTICS OF COMPUTING

 Should provide precise solution.


 Control action should be unambiguous and accurate.
 Suitable for problem, which is easy to model mathematically.
WHAT IS SOFT COMPUTING?
 It consists of distinct concepts and techniques which aim
to overcome the difficulties encountered in real world
problems.

 These problems result from the fact that our world


seems to be imprecise, uncertain and difficult to
categorize.
SOFT COMPUTING DEFINITION:
THE TOOLS FOR SOFT COMPUTING

 Neural networks
 Machine Learning
 Fuzzy logic models.
 Genetic algorithms
 Probabilistic Reasoning
HOW SOFT COMPUTING
WORK?
 How a student learns from his teacher?
--Teacher asks questions and tell the answers then.
--Teacher puts questions and hints answers and asks
whether the
answers are correct or not.
--Student thus learn a topic and store in his memory.
--Based on the knowledge he solves new problems.
--This is the way how human brain works.

 Based on this concept Artificial Neural Network is used to


solve problems.
HOW SOFT COMPUTING
WORK?
 How a doctor treats his patent?
• Doctor asks the patent about sufering.
• Doctor fnd the symptoms of diseases.
• Doctor prescribed tests and medicines.

 This is exactly the way Fuzzy Logic works.


• Symptoms are correlated with diseases with
uncertainty .
• Doctor prescribes tests/medicines fuzzily.
HOW SOFT COMPUTING
WORK?
 How world selects the best?
•It starts with a population (random).
• Reproduces another population (next generation).
• Rank the population and selects the superior
individuals.

 Genetic algorithm is based on this natural phenomena.


• Population is synonymous to solutions.
• Selection of superior solution is synonymous to
exploring the
optimal solution.
CHARACTERISTICS OF SOFT
COMPUTING
 It does not require any mathematical modeling of problem
solving.
 It may not yield the precise solution.
 Algorithms are adaptive (i.e., it can adjust to the change of
dynamic environment).
 Use some biological inspired methodologies such as genetics,
evolution, Ant’s behaviors, particles swarming, human
nervous system, etc.).

HARD COMPUTING VS
SOFT COMPUTING
 Hard computing based on binary logic, crisp systems, numerical
analysis and crisp software.

 Soft computing based on fuzzy logic, neural nets and


probabilistic reasoning.

 Hard computing requires programs to be written.

 Soft computing can evolve its own programs.


EXAMPLES OF HARD COMPUTING
 Solving numerical problems (e.g., roots of polynomials,
integration, etc.).
 Searching and sorting techniques.
 Solving computational geometry problems (e.g., shortest tour
in a graph, finding closet pair of points given a set of points,
etc.).
 many more…
EXAMPLES OF SOFT COMPUTING
EXAMPLES OF SOFT COMPUTING

You might also like