Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18
Introduction to Soft Computing
COMPUTING? Concept of Computing
• Basic of computing y = f (x), f is a mapping
function f is also called a formal method or an algorithm to solve a problem. Hard Computing ? Hard Computing • In 1996, LA Zade (LAZ) introduced the term hard computing. • According to LAZ: We term a computing as ”Hard” computing, if • Precise result is guaranteed • Control action is unambiguous • Control action is formally defined (i.e. with mathematical model Cont • Example: Solving numerical problems (e.g. Roots of polynomials, Integration etc.) • Searching and sorting techniques • Solving ”Computational Geometry” problems (e.g. Shortest tour in Graph theory, Finding closest pair of points etc.) Soft Computing • Soft computing is the reverse of hard (conventional) computing. • Zadeh coined the term of soft computing in 1992 • According to Prof. , LA Zade in contrast to traditional hard computing, soft computing exploits • the tolerance for imprecision, • uncertainty, • partial truth to achieve tractability, • robustness, • low solution-cost, Characteristics of SC • It does not require any mathematical modeling of problem solving • It may not yield the precise solution I 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 systems etc. CONSTITUENTS OF SC • Fuzzy System : Reasoning and imprecision • Neural Network :Learning • Evolutionary Computing (Genetic Algorithm) :Searching and Optimization • Role model of soft computing is Human mind APPLICATIONS OF SOFT COMPUTING • It is widely used in gaming products like Poker and Checker. • In kitchen appliances, such as Microwave and Rice cooker. • In most used home appliances - Washing Machine, Heater, Refrigerator, and AC as well. • Apart from all these usages, it is also used in Robotics work (Emotional per Robot form). • Image processing and Data compression are also popular applications of soft computing. • Used for handwriting recognition. Hard Computing vs Soft Computing Elements of soft computing
• Soft computing is viewed as a foundation component
for an emerging field of conceptual intelligence. • Fuzzy Logic (FL), • Machine Learning (ML), • Neural Network (NN), • Probabilistic Reasoning (PR), • Evolutionary Computation (EC) are the supplements of soft computing. • Also, these are techniques used by soft computing to resolve any complex problem. Any problems can be resolved effectively using these components. Following are three types of techniques used by soft computing: • Fuzzy Logic • Artificial Neural Network (ANN) • Genetic Algorithms Fuzzy Logic (FL)
• Fuzzy logic is nothing but mathematical logic which
tries to solve problems with an open and imprecise spectrum of data. • It makes it easy to obtain an array of precise conclusions. • Fuzzy logic is basically designed to achieve the best possible solution to complex problems from all the available information and input data. • Fuzzy logics are considered as the best solution finders. Neural Network (ANN)
• Neural networks were developed in the 1950s, which helped
soft computing to solve real-world problems, which a computer cannot do itself. We all know that a human brain can easily describe real-world conditions, but a computer cannot. • An artificial neural network (ANN) emulates a network of neurons that makes a human brain (means a machine that can think like a human mind). Thereby the computer or a machine can learn things so that they can take decisions like the human brain. • Artificial Neural Networks (ANN) are mutually connected with brain cells and created using regular computing programming. It is like as the human neural system. Genetic Algorithms (GA)
• Genetic algorithm is almost based on nature
and take all inspirations from it. • There is no genetic algorithm that is based on search-based algorithms, which find its roots in natural selection and the concept of genetics. • In addition, a genetic algorithm is a subset of a large branch of computation.