Predicting permit activity with cellular automata calibrated with genetic algorithms Sushil J. LouisGary Raines Department of Computer Science US Geological.

Slides:



Advertisements
Similar presentations
Algorithm Design Techniques
Advertisements

1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Intelligent Control Methods Lecture 12: Genetic Algorithms Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Friend Recommendations in Social Networks using Genetic Algorithms and Network Topology Jeff Naruchitparames, Mehmet Gunes, Sushil J. Louis University.
Case Injected Genetic Algorithms Sushil J. Louis Genetic Algorithm Systems Lab (gaslab) University of Nevada, Reno
Case Injected Genetic Algorithms Sushil J. Louis Genetic Algorithm Systems Lab (gaslab) University of Nevada, Reno
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Introduction to Genetic Algorithms Yonatan Shichel.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Genetic Algorithm for Variable Selection
Using a Genetic Algorithm for Approximate String Matching on Genetic Code Carrie Mantsch December 5, 2003.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Genetic Learning from Experience Sushil J. Louis Evolutionary Computing Systems LAB Department of Computer Science University of Nevada, Reno
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Game of Life Changhyo Yu Game of Life2 Introduction Conway’s Game of Life  Rule Dies if # of alive neighbor cells =< 2 (loneliness) Dies.
Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Spatial-Temporal Analysis A Cellular Automata Model of Mineral- Related Activity from 1998 to 2010 for Idaho and Western Montana Raines, G.L. 1, Zientek,
Genetic Programming.
Genetic Algorithm.
Indiana GIS Conference, March 7-8, URBAN GROWTH MODELING USING MULTI-TEMPORAL IMAGES AND CELLULAR AUTOMATA – A CASE STUDY OF INDIANAPOLIS SHARAF.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
Genetic Algorithms Michael J. Watts
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Fuzzy Genetic Algorithm
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
Kansas State University Department of Computing and Information Sciences CIS 732: Machine Learning and Pattern Recognition Friday, 16 February 2007 William.
Artificial Intelligence Chapter 4. Machine Evolution.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
Edge Assembly Crossover
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
1 Effect of Spatial Locality on An Evolutionary Algorithm for Multimodal Optimization EvoNum 2010 Ka-Chun Wong, Kwong-Sak Leung, and Man-Hon Wong Department.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
Neural Networks And Its Applications By Dr. Surya Chitra.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
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.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Using GA’s to Solve Problems
Genetic Algorithm in TDR System
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Artificial Intelligence Chapter 4. Machine Evolution
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
Artificial Intelligence Chapter 4. Machine Evolution
EE368 Soft Computing Genetic Algorithms.
Introduction to Genetic Algorithm and Some Experience Sharing
Case Injected Genetic Algorithms
Presentation transcript:

Predicting permit activity with cellular automata calibrated with genetic algorithms Sushil J. LouisGary Raines Department of Computer Science US Geological Survey

Outline  What is the problem? Calibrating a CA  What is the technique? Genetic Algorithm  What are the issues? Discretization Encoding Evaluation  What are our results ?

What is the problem?  Project mineral-related activity on public land to 2010 Predicting permit activity in an area Spatially explicit USGS and others have data on permit activity from 1989 – 1998 as well as data on natural resources Use cellular automata to model (predict) mineral activity over next ten years Problem: Takes weeks to tune CA rules to match available data

What is the problem?  Can we automate calibrating a cellular automaton As good as CA calibrated by human In the same or less time

What is the problem?

Model calibration as search  Search through the space of possible model parameters to find a parameter set that fits observed data  Many search methods  We use genetic algorithms

Genetic Algorithms  Poorly understood problems (Holland, ‘75, Goldberg, ‘89)  Empirical evidence to support their use in this kind of problem Physics models Physical Review Letters, Volume 88, Issue 4 Journal of Quantitative Spectroscopy and Radiative Transfer. Volume 75, 2002, Pgs Seismic models Congress on Evolutionary Computing 1999, pages Hydrology models In progress Proceedings of GECCO, CEC, …

Genetic algorithm calibration

What is a GA?  Randomized, parallel search  Models natural selection  Population based  Uses fitness to guide search

Genetic algorithm search

Genetic Algorithm  Randomly initialize P(0) with candidate parameter sets  Loop Select P(t+1) from P(t) Crossover and Mutate P(t+1) Evaluate P(t+1)  run CA model t = t+1

Modified Annealed Voting Rule Probability of Life in Next Generation Number of Live Neighbors Status of Center Cell AliveDead > Annealing WindowVery LikelyLikely Annealing WindowLikelySomewhat Likely < Annealing WindowVery Somewhat Likely Unlikely

Definitions of Parameters ParametersDefinition Very LikelySquare root of Likely (Larger) LikelyA high probability of life. Somewhat LikelyAn intermediate probability of life Very Somewhat LikelySquare root of Somewhat Likely (Larger) UnlikelyA low probability of life Resource ThresholdMinimum fuzzy membership defining where a reasonable explorationist would explore Anneal WindowPosition and width control response of CA

GA Encoding  GA usually works with string structures representing a candidate solution  2^36 = 64Gig possibilities  Fitness = scaled match to observed data top bottomlikelyslikelyunlikely rt

GA Parameters  Population sizes – 50  Elitist selection – next generation is best of parents and offspring  Probability of crossover – 1.00  Probability of mutation  Fitness scaling – 1.05

Model parameters  496 X 503 = 249,488 cell CA  4 or 5 years (iterations)  Average over 3 runs  Cell data imported from GIS

Results

Results

Results

Results

 GA produces good parameter values (20% better than human)  GA is a viable tool for model exploration  Many different parameter sets give about the same fit ?  Modeling rare events ?

Cross-Tabulation Number of Cells CA Trace Sum Actual Trace Sum