Neural Networks And Its Applications By Dr. Surya Chitra.

Slides:



Advertisements
Similar presentations
The story beyond Artificial Immune Systems Zhou Ji, Ph.D. Center for Computational Biology and Bioinformatics Columbia University Wuhan, China 2009.
Advertisements

Exact and heuristics algorithms
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Basic concepts of Data Mining, Clustering and Genetic Algorithms Tsai-Yang Jea Department of Computer Science and Engineering SUNY at Buffalo.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
7/2/2015Intelligent Systems and Soft Computing1 Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
11.1 Genetic Variation Within Population KEY CONCEPT A population shares a common gene pool.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Algorithm.
Evolutionary Intelligence
© Negnevitsky, Pearson Education, CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Genetic algorithms Prof Kang Li
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
 Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms n Introduction, or can evolution be intelligent? n Simulation.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Genetic Algorithms. Overview “A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm(GA)
GENETIC ALGORITHM By Siti Rohajawati. Definition Genetic algorithms are sets of computational procedures that conceptually follow steps inspired by the.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Genetic Algorithm (Knapsack Problem)
Using GA’s to Solve Problems
Genetic Algorithm in TDR System
KEY CONCEPT A population shares a common gene pool.
A Comparison of Simulated Annealing and Genetic Algorithm Approaches for Cultivation Model Identification Olympia Roeva.
Chapter 6: Genetic Algorithms
CSC 380: Design and Analysis of Algorithms
Basics of Genetic Algorithms (MidTerm – only in RED material)
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
Basics of Genetic Algorithms
EE368 Soft Computing Genetic Algorithms.
KEY CONCEPT A population shares a common gene pool.
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
Population Based Metaheuristics
A population shares a common gene pool.
CSC 380: Design and Analysis of Algorithms
KEY CONCEPT A population shares a common gene pool.
GA.
Presentation transcript:

Neural Networks And Its Applications By Dr. Surya Chitra

OUTLINE Introduction & Software Basic Neural Network & Processing –Software Exercise Problem/Project Complementary Technologies –Genetic Algorithms –Fuzzy Logic Examples of Applications –Manufacturing –R&D –Sales & Marketing –Financial

OPTIMIZATION PROBLEM Combination of variables which produces the best results When No. of variables increase, it is difficult to do optimization. Genetic Algorithms serve as an alternative to optimization in feature selection

BIOLOGICAL EVOLUTION Evolution of species - “Struggle for Life” Best individuals have greatest probability of surviving and winning battles for reproduction. When a combination of two good genomes generates better genetic material. GAs are inspired by evolution theory.

Definition of Genetic Algorithms Genetic Algorithms are Search Algorithms Based on the Mechanics of Natural Selection and Natural Genetics Goldberg (1989) Genetic Algorithms are Software, Procedures Modeled After Genetics and Evolution Bauer (1993)

Genetics & Genetic Algorithms HUMAN CELL CHOMOSOMES (Dictate Hereditary of Individual) INDIVIDUAL GENES (Encodes Specific Feature Actual Value is Called Allele) GENETIC ALGORITHMS STRING STRUCTURES (Strings are Rated by Fitness Function) ELEMENTS in STRINGS Actual Value Stored in Elements) 23 Chromosomes New Strand of Chromosomes PARENTS OFFSPRING Crossover of strands Mutation of strands (diversification)

Basis for Genetic Algorithms Randomized Search –Strings are Chosen & Combined Stochastically Based on Survival of the Fittest –Uses Fitness Function Select Fittest String to Create New String Based on Interbreeding Population –To Create Innovative Search Strategy

EVOLUTIONS IN GA Experimental conditions leading to better results will prevail over the worst ones and an improvement can be obtained by a recombination with some random changes. Experimental Conditions -----> Genome Variables > Genes Response > Measure of fitness

BASIC STEPS IN GAs Coding of Variables Initiation of population Evaluation of the response –Reproduction –Crossover –Mutations Steps 3 to 6 alternate until a termination criterion is reached. (Lack of improvement or maximum number of generations)

Reproduction Reproduction allows individual strings to be copied for next generation. The chance that a string is copied depends on its fitness function.

Crossover Biologically it is the blending of Chromosomes. Selects two strings at random & calculates whether crossover should take place based on crossover probability.

MUTATIONS Mutations are irregular changes with very low probability of occurrence and affect single gene. Sometimes mutations generate good results and contribute to evolution.

Genetic Algorithm Iteration Loop

Example of GA Optimization Algorithm Assume: Answer is Integer and between 0 and 25

Example of GA Optimization Algorithm Example

Example of GA Optimization Algorithm First Iteration Selection

Example of GA Optimization Algorithm Mating Pool Crossover

Example of GA Optimization Algorithm End of First Iteration and New Population

Definition of Fuzzy Logic Systems Fuzzy Logic is a multi-valued logic that allows intermediate values to be defined between conventional evaluations like yes/no, true/false, etc. More Human-like way of thinking in the programming of computers. Initiated by Lotfi Zadeh Computer Science Univ. of California at Berkeley

Fuzzy Sets A = [ 5, 8 ]

Fuzzy Sets B = [ Set of Young People ] B = [ 0, 20 ]

Operations on Fuzzy Sets Fuzzy Set between 5 and 8 Fuzzy Set about 4

Operations on Fuzzy Sets Fuzzy Set between 5 and 8 AND about 4

Operations on Fuzzy Sets Fuzzy Set between 5 and 8 OR about 4

Operations on Fuzzy Sets Negation of Fuzzy Set between 5 and 8