BlueJam Genetic Programming and Evolutionary Algorithms Capturing Creativity with Algorithmic Music Evolutionary Music Composition Machine Learning and.

Slides:



Advertisements
Similar presentations
Artificial Intelligence Presentation
Advertisements

Genetic Algorithms Genetic Programming Ata Kaban School of Computer Science University of Birmingham 2003.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
GENETICA The problem-solving approach proposed here, largely based on the previous remarks, is implemented through the computer language GENETICA. GENETICA.
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.
Module 14 Thought & Language. INTRODUCTION Definitions –Cognitive approach method of studying how we process, store, and use information and how this.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Mechanics of Genetic Programming
Multiobjective VLSI Cell Placement Using Distributed Simulated Evolution Algorithm Sadiq M. Sait, Mustafa I. Ali, Ali Zaidi.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Applications of Evolutionary Computation in the Analysis of Factors Influencing the Evolution of Human Language Alex Decker.
Evolutionary Design By: Dianna Fox and Dan Morris.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno
Tutorial 1 Temi avanzati di Intelligenza Artificiale - Lecture 3 Prof. Vincenzo Cutello Department of Mathematics and Computer Science University of Catania.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.
Data Evolution in General Formal Problem Statement A General Approach to Evolutionary Problem Solving, Implemented in the Computer Language GENETICA.
Khaled Rasheed Computer Science Dept. University of Georgia
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.
LOUKAS GEORGIOU and WILLIAM J. TEAHAN Artificial Intelligence and Intelligent Agents Research Group School of Computer Science, Bangor University, U.K.
Genetic Algorithm.
Evolutionary Intelligence
1 An Overview of Evolutionary Computation 조 성 배 연세대학교 컴퓨터과학과.
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Three methods developed for these objectives Based on machine learning and supervised learning Under the evolutionary paradigm –specifically Genetic Programming.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
GATree: Genetically Evolved Decision Trees 전자전기컴퓨터공학과 데이터베이스 연구실 G 김태종.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
A new Programming Paradigm inspired by Algorithmic Chemistries UPP 2004 September 2004 Wolfgang Banzhaf, Memorial University of Newfoundland, Canada and.
Evolutionary Computation Dean F. Hougen w/ contributions from Pedro Diaz-Gomez & Brent Eskridge Robotics, Evolution, Adaptation, and Learning Laboratory.
G ENETIC P ROGRAMMING Ranga Rodrigo March 17,
Artificial Intelligence Chapter 4. Machine Evolution.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Evolutionary Computation an introduction These slides available at
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
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.
Chia Y. Han ECECS Department University of Cincinnati Kai Liao College of DAAP University of Cincinnati Collective Pavilions A Generative Architectural.
Emergent Design Martin HembergImperial College2004Emergent Design.
Music in Artificial Intelligence Victoria Tran. Why Music in Artificial Intelligence? Technology is improving every day, so music is beginning to depend.
T. Gregory BandyInteraction Machines SeminarFebruary 21, Union College - Computer Science Graduate Program Interaction Machines Are they more.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
Genetic Algorithm(GA)
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.
Haploid-Diploid Evolutionary Algorithms
Introduction to genetic algorithm
Genetic Algorithm in TDR System
Introduction to Evolutionary Computing
Evolution Strategies Evolutionary Programming
Haploid-Diploid Evolutionary Algorithms
Advanced Artificial Intelligence Evolutionary Search Algorithm
Artificial Intelligence Chapter 4. Machine Evolution
Supplement Beyond Computation
Artificial Intelligence Chapter 4. Machine Evolution
Using Quotient Graphs to Model Neutrality in Evolutionary Search Dominic Wilson Devinder Kaur University of Toledo.
Beyond Classical Search
Coevolutionary Automated Software Correction
Presentation transcript:

BlueJam Genetic Programming and Evolutionary Algorithms Capturing Creativity with Algorithmic Music Evolutionary Music Composition Machine Learning and Artificial Intelligence Goals and Achievements Music is a mode of creative expression present in culture. As an artform, music is appraised by listeners, but contention and conflict appear when the aesthetic critique attempts to define what makes music appreciable. Through modeling and analyzing the composition of music, we can hope to attain a better understanding of both listening and composing, illuminating the humanistic affinity with sound. Algorithms are used to describe computational processes. Modern synthesizers use algorithmic definitions to generate dynamic musical accompaniment; arpeggios, wave envelopes, drum patterns etc. Fixed algorithms are invariably deterministic, but this mantle of being “creative” can be tentatively ascribed to newer families of algorithms found in evolutionary computation. Previous research has experimented with mixed successes in the study of computer-generated and computer-assisted composition. Notable results have been achieved using constraint-based and grammatical systems, but evolutionary methods have made an appearance in programs which perform better than average. BlueJam attempts to further these achievements, adding some new concepts specific to music theory and a method of guiding the evolution through “Heuristic Trees”. Genetic Programming (GP) and Evolutionary Algorithms (EA) have produced human-competitive results when applied to problems of all kinds. Their approach to problem solving can be described as a search through the space of possible solutions. In 1992, Koza brought Tree-based GP to prominence, and it has been used widely ever since. The same paradigm is followed with Heuristic Trees, which uses the structure of the tree to specify an additional rhythm semantic. Modelling our approach on genetic behaviour, we can use crossover and mutation as two methods of altering the tree contents. During the program cycle, we move through several generations. In each generation, populations of musical trees are created and evaluated – the best are selected to create trees for the next generation. BlueJam can use an interactive interface to get the opinion of the user regarding current performance. After numerous generations, BlueJam will end up with a new set of heuristics that are attuned with the user. The traditional qualitative measure of artificial intelligence is the classic Turing test, in which one participant interacts with two agents in an attempt to classify which agent is the machine. Since there are tentative considerations regarding computational art, could there be a Turing-like test for Artificial Music Composers? Would this allow us to determine what is merely Generative and what is Creative? NoteCEbF(F#)… C … Eb … F … F#P(C)…P(Eb)..P(F)..… P(x) = Probability of the next note being x Fig 1. Musical Tree Structure (Genotype) The Heuristic tree defines the shape of the music, by locking specific properties like rhythm and pitch Leaf nodes get played (phenotype) Each level of the tree halves the rhythmic length of the nodes Context-free grammars can define note transitions Example for the C-Major Scale S := cC | dD |eE | f F| gG | aA | bB C := cD | fE | gF | gA | eaC … D := dA | dG | fgA …) E := … (multiple groupings can be defined) … Markov Models can assign probabilities to the grammar Example for Blues in C See More Visit BlueJam BlueJam is a framework for the evolution of music written in Java, interfaced with the open source MAX/MSP alternative “Pure-Data” (PD)