Genetic Art. Network Record Using Network Information Chicago Evanston ParisMoscow.

Slides:



Advertisements
Similar presentations
Exact and heuristics algorithms
Advertisements

Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Tetris and Genetic Algorithms Math Club 5/30/2011.
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Parameter control Chapter 8. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Parameter Control in EAs 2 Motivation 1 An EA has many.
Parameter Control A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 8.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Study of a Paper about Genetic Algorithm For CS8995 Parallel Programming Yanhua Li.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Data classification based on tolerant rough set reporter: yanan yean.
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
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.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
2 What Genetic Programming ISN'T: What Genetic Programming ISN'T: Engineering a breed of purple carrots. Engineering a breed of purple carrots. Analyzing.
1 Genetic Algorithms. CS 561, Session 26 2 The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
S. Mohsen Sadatiyan A., Samuel Dustin Stanley, Donald V. Chase, Carol J. Miller, Shawn P. McElmurry Optimizing Pumping System for Sustainable Water Distribution.
Binding and Kinetics for Experimental Biologists Lecture 2 Evolutionary Computing : Initial Estimate Problem Petr Kuzmič, Ph.D. BioKin, Ltd. WATERTOWN,
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Programming.
Slides are based on Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming n Evolution.
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Genetic Algorithm.
Automating the Lee Model. Major Components Simulator code –Verifying outputs –Verifying model equations –Graphical User interface Auto-tuning the model.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Neural Networks Design  Motivation  Evolutionary training  Evolutionary design of the architecture.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Evolutionary Art with Multiple Expression Programming By Quentin Freeman.
G ENETIC P ROGRAMMING Ranga Rodrigo March 17,
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
/ 26 Evolutionary Computing Chapter 8. / 26 Chapter 8: Parameter Control Motivation Parameter setting –Tuning –Control Examples Where to apply parameter.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Project 2: Classification Using Genetic Programming Kim, MinHyeok Biointelligence laboratory Artificial.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Overview Last two weeks we looked at evolutionary algorithms.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Genetic Programming. What is Genetic Programming? GP for Symbolic Regression Other Representations for GP Example of GP for Knowledge Discovery Outline.
Evolving Recursive Algorithms The SRF function Automatically defined recursions (ADRs) The recur operator Dealing with infinite and time-consuming recursions.
Genetic Algorithm(GA)
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Chapter 9: Value-Returning Functions
Evolution Strategies Evolutionary Programming
Evolution strategies and genetic programming
Basics of Genetic Algorithms (MidTerm – only in RED material)
Evolving Logical-Linear Edge Detector with Evolutionary Algorithms
Basics of Genetic Algorithms
Boltzmann Machine (BM) (§6.4)
Presentation transcript:

Genetic Art

Network Record

Using Network Information Chicago Evanston ParisMoscow

Understanding Network Data

Genetic Programming Visualization Can we use these network records to create real- time displays for conveying something about the state of the network?

Outline I.What is Genetic Programming II.How we used genetic programming to create meaningful network visualizations a. System for creating random visualizations b. System for evolving random visualizations into meaningful visualizations c. User tests to refine the system

Genetic Algorithms GENETIC ALGORITHMS are heuristic search optimization methods that use evolutionary models of genetic reproduction and natural selection to solve computational research problems.

Genetic Programming GENETIC PROGRAMS are genetic algorithms whose inputs and outputs can be modeled using tree-structured computational expressions.

Genetic Inputs: Expression Language A way of describing a computational expression. constants: { R } U { x y } functions: { + - * / } rules for combining constants and functions to form expressions: {All operators take any 2 constants, except /, which can not take 0 for it’s second argument}

Genetic Inputs: Fitness Measure A fitness measure to determine how good an expression is. Example: how close the expression is to f(x) = 2x, where close is measured using linear least squared error over some set of data points.

Genetic Inputs: Run Parameters Parameters for controlling the run: Number of expressions (population size) Expression size

Genetic Operators In nature, genetic operators operate on genes to create new genes: In genetic programming, genetic operators operate on expressions to create new expressions:

Crossover BIOLOGICAL CROSSOVER replaces part of one DNA sequence with part of another DNA sequence.

GP CROSSOVER replaces part of one expression with part of a different expression to create a new expression. GP Crossover

BIOLOGICAL MUTATION randomly modifies a point on a DNA sequence to create a new DNA sequence. Mutation

GP Mutation GP MUTATION randomly modifies a point in an expression to create a new expression.

GP Execution Steps Randomly generate a population of initial expressions. Evolve better expressions by repeatedly doing the following: Find each expression’s fitness. Use the fitness to select expressions for reproduction Apply genetic operators to selected expressions to create new expressions.

Genetic Art Inputs A way of describing a computational image expression.

GP Execution Steps Randomly generate a population of initial image expressions. Evolve better images by repeatedly doing the following: Find each image’s fitness. Use the fitness to select expressions for reproduction Apply genetic operators to selected expressions to create new images.

Computer Images

Genetic Art Inputs: Expression Language Constants: {screen coordinates, network data, random numbers} Functions: {+ - * / sin(c) power 2 (c) cuberoot(c) max min rectangle ellipse triangle “linear interpolation”} Combination rules: {all functions and constants behave as colors} Network data: source IP address, destination IP address, source port, destination port, arrival time stamp, and some optional flags.

Constant inputs: {screen coordinates, network data, random numbers} Expressions to Images

(Sin (Cuberoot (Exp (Exp (Slerp (Slerp (Sum (Min (Exp (RGB Y Y Y)) (RGB Y Y Y)) (Sin (RGB Y Y Y)) (Slerp (Exp (Slerp (T) (Sin (RGB Y Y Y)) (Slerp (RGB X X X) (RGB ) (RGB Y Y Y)))) (RGB ) (Slerp (RGB ) (RGB ) (Max (RGB ) (RGB Y Y Y)))) (Div (Max (RGB X X X) (RGB Y Y Y)) (RGB ))) (Slerp (RGB X X X) (Sum (Product (Max (RGB T T T) (RGB X X X)) (Exp (RGB Y Y Y)) (Div (RGB T T T) (RGB X X X))) (Sin (RGB Y Y Y)) (Min (RGB ) (RGB T T T)))))))

GP Execution Steps Randomly generate a population of initial image expressions. Evolve better images by repeatedly doing the following: Find each image’s fitness. Use the fitness to select expressions for reproduction Apply genetic operators to selected expressions to create new images.

Do you consider yourself to be familiar with the current state of the network?

Fitness Measure We defined image fitness to be the total number of votes an image has

Genetic Art Inputs: Fitness Measure Fitness measure: how well users feels a visualization ‘accurately reflects the current network state.’

GP Execution Steps Randomly generate a population of initial image expressions. Evolve better images by repeatedly doing the following: Find each image’s fitness. Use the fitness to select expressions for reproduction Apply genetic operators to selected expressions to create new images.

Genetic Art Mutation

Genetic Art Crossover

Summary 1.What is Genetic Programming II.How we used genetic programming to create art. a. System for creating random images. b. System for evolving random images into something meaningful. c. User tests to refine the system