Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Bio-Inspired Optimization. Our Journey – For the remainder of the course A brief review of classical optimization methods The basics of several stochastic.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Evolutionary Computing A Practical Introduction Presented by Ben Paechter Napier University with thanks to the EvoNet Training Committee and its “Flying.
02/03/07DePaul University, HON2071 Evolutionary Computation Module for HON207.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Computational Intelligence Dr. Garrison Greenwood, Dr. George Lendaris and Dr. Richard Tymerski
CS 1 – Introduction to Computer Science Introduction to the wonderful world of Dr. T Dr. Daniel Tauritz.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Genetic Algorithms Learning Machines for knowledge discovery.
CS 1 – Introduction to Computer Science Introduction to the wonderful world of Dr. T Dr. Daniel Tauritz.
Tutorial 1 Temi avanzati di Intelligenza Artificiale - Lecture 3 Prof. Vincenzo Cutello Department of Mathematics and Computer Science University of Catania.
CS 1 – Introduction to Computer Science Introduction to the wonderful world of Dr. T Daniel Tauritz, Ph.D. Associate Professor of Computer Science.
CS 1 – Introduction to Computer Science Introduction to the wonderful world of Dr. T Dr. Daniel Tauritz.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Revision Michael J. Watts
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Department of Information Technology Indian Institute of Information Technology and Management Gwalior AASF hIQ 1 st Nov ‘09 Department of Information.
10/6/2015 1Intelligent Systems and Soft Computing Lecture 0 What is Soft Computing.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Introduction to Evolutionary Computation Temi avanzati di Intelligenza Artificiale - Lecture 1 Prof. Vincenzo Cutello Department of Mathematics and Computer.
Computational Intelligence II Lecturer: Professor Pekka Toivanen Exercises: Nina Rogelj
(Particle Swarm Optimisation)
The Particle Swarm Optimization Algorithm Nebojša Trpković 10 th Dec 2010.
Topics in Artificial Intelligence By Danny Kovach.
Introduction to Artificial Intelligence and Soft Computing
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Fuzzy Genetic Algorithm
Soft Computing A Gentle introduction Richard P. Simpson.
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
G ENETIC A LGORITHMS Ranga Rodrigo March 5,
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Genetic Algorithms ML 9 Kristie Simpson CS536: Advanced Artificial Intelligence Montana State University.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Neural Networks And Its Applications By Dr. Surya Chitra.
A field of study that encompasses computational techniques for performing tasks that require intelligence when performed by humans. Simulation of human.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Organic Evolution and Problem Solving Je-Gun Joung.
General information Theoretic basis of evolutionary computing. The general scheme of evolutionary algorithms General information Theoretic basis of evolutionary.
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic Algorithms.
Introduction to Evolutionary Computing
Artificial Intelligence Methods (AIM)
Introduction to Genetic Algorithm (GA)
C.-S. Shieh, EC, KUAS, Taiwan
Advanced Artificial Intelligence Evolutionary Search Algorithm
Basics of Genetic Algorithms (MidTerm – only in RED material)
Biological Bases of Behavior Northwest High School
رایانش تکاملی evolutionary computing
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult.
GENETIC ALGORITHMS & MACHINE LEARNING
Dr. Unnikrishnan P.C. Professor, EEE
Basics of Genetic Algorithms
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Genetic Algorithm Soft Computing: use of inexact t solution to compute hard task problems. Soft computing tolerant of imprecision, uncertainty, partial.
Presentation transcript:

Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture May 2003

What is Natural Computation? “Characteristic for man-designed computing inspired by nature is the metaphorical use of concepts, principles and mechanisms underlying natural systems” Quoted from the Leiden Center for Natural Computing

The Bioinformatics link Both straddle the fields of Computer Science & Biology Bioinformatics’ computational demands are often ill-suited for conventional computational models Natural Computation offers solutions capable of dealing with extremely large data sets, high dimensionality, complex pattern recognition, and sophisticated classification

The Artificial Intelligence Link Classic (symbolic) AI: game play, diagnostic expert systems, etc. “True” intelligence eludes classic AI Nature has produced “true” intelligence Hopefully nature inspired computational models can achieve “true intelligence” too!

Nature’s way of computing Slow symbolic steps, but extremely parallel (resulting in weak numeric performance, but strong pattern recognition and classification capabilities) High computational error rates, but very fault-tolerant (good at fuzzy logic) Imperfect memory, but strong ability to learn/adapt (on the individual and/or population level)

Nature inspired models Quantum Computing DNA/Molecular Computing Artificial Life Swarm Intelligence - Ant Colony Optimization - Particle Swarm Optimization Artificial Immune Systems (Computational Immunology) Artificial Neural Networks (Connectionism) Evolutionary Computation

Quantum Computing - based on quantum physics, exploits quantum parallelism; aims at non-traditional hardware that would allow quantum effects to take place DNA/Molecular Computing - based on paradigms from molecular biology; aims at alternatives for silicon hardware by implementing algorithms in biological hardware (bioware), e.g., using DNA molecules and enzymes

Artificial Life - attempts to model living biological systems through complex algorithms (examples: stem cell simulation, computational epidemics, gene regulatory system simulation, stock market simulation, predator- prey studies, etc.)

Swarm Intelligence Ant Colony Optimization – population based optimization technique inspired by the behavior of ant colonies Particle Swarm Optimization – population based optimization technique inspired by social behavior of bird flocking or fish schooling

Artificial Immune Systems (Computational Immunology) Artificial Neural Networks (Connectionism)

Evolution Individuals Population Environment Fitness Selection - selective pressure Reproduction Competition – survival of the fittest

Heredity Asexual versus sexual reproduction Genes Loci Alleles Genotype versus phenotype Genetic operators: replication, recombination, mutation

Evolutionary Computation Solving “difficult” problems Search spaces: representation & size Evaluation of trial solutions: fitness function Exploration versus exploitation Selective pressure rate Premature convergence

EnvironmentProblem (search space) FitnessFitness function PopulationSet IndividualDatastructure GenesElements AllelesDatatype

Evolutionary cycle selection reproduction mutation competition evaluation initialization

Pros General purpose: minimal knowledge required Ability to solve “difficult” problems Solution availability Robustness Cons Fitness function and genetic operators often not obvious Premature convergence Computationally intensive Difficult parameter optimization

Evolving versus learning In EC learning occurs at the population level instead of at the individual level In nature evolution and learning are combined Darwinian evolution evolves the blue print of a learning system Baldwin effect: phenotypic plasticity (e.g., learning [local search]) Lamarckian evolution involves direct inheritance of characteristics acquired by individuals during their lifetime

Natural Computation Courses Fall 2003 CS378/Eng.Mg.378/El.Eng.368 Introduction to Neural Networks & Applications Dr. Dagli – Eng.Mg. CS401 Introduction to Evolutionary Computation Dr. Tauritz - CS