The New Issue of SIGEVOlution is Now Available!

The new issue of SIGEVOlution is now available for you to download from:
http://www.sigevolution.org
The issue features:
The issue features:

An Interview with Hans-Paul Schwefel with an introduction by Günter Rudolph
Memetic Algorithms by Natalio Krasnogor
Learning From Failures in Evolutionary Computation @ GECCO-2009
new issues of journals
calls & calendar

Related Posts

SIGEVOlution Volume 3 Issue 4

The new issue of SIGEVOlution is now available for you to download from:

http://www.sigevolution.org

The issue features:

The issue features:

  • An Interview with Hans-Paul Schwefel with an introduction by Günter Rudolph
  • Memetic Algorithms by Natalio Krasnogor
  • Learning From Failures in Evolutionary Computation @ GECCO-2009
  • new issues of journals
  • calls & calendar

George Dyson to present at U of I

George Dyson, historian and philosopher of science and author of “Darwin Among Machines” will present two talks as a part of the Colloquium Series “Biology and Beyond”.
On September 29th at 7:00p.m. Dyson will present Darwin Among Machines: From Zoomania to Artificial Life, at Loomis 141.
The next day, September […]

George Dyson, historian and philosopher of science and author of “Darwin Among Machines” will present two talks as a part of the Colloquium Series “Biology and Beyond”.

On September 29th at 7:00p.m. Dyson will present Darwin Among Machines: From Zoomania to Artificial Life, at Loomis 141.

The next day, September 30th 4:00 p.m. he will present Von Neumann’s Universe: Computers and Beyond at 100 Gregory Hall.

The poster can be found here.

2010 Forum on Philosophy, Engineering & Technology (fPET-2010): Call for papers, 28 Dec 09

fPET-2010, co-organized by IlliGAL lab director, Dave Goldberg, has issued a call for papers:
The 2010 Forum for Philosophy, Engineering & Technology (fPET-2010) to be held 9-10 May 2010 (Sunday Evening-Monday) at the Colorado School of Mines, Golden, CO USA has issued its first call for papers.
Abstracts (500-750 words) are due by 28 December 2009 (Monday) […]

fPET-2010, co-organized by IlliGAL lab director, Dave Goldberg, has issued a call for papers:

The 2010 Forum for Philosophy, Engineering & Technology (fPET-2010) to be held 9-10 May 2010 (Sunday Evening-Monday) at the Colorado School of Mines, Golden, CO USA has issued its first call for papers.

Abstracts (500-750 words) are due by 28 December 2009 (Monday) using the fPET-2010 submissions page on the the webpage www.philengtech.org/submission.  The call for papers may be viewed online here or downloaded as a PDF file here.

For more information about the forum contact Diane Michelfelder (michelfelder@macalester.edu) or Dave Goldberg (deg@illinois.edu).

More information is available at the fPET-2010 website at www.philengtech.org.

iFoundry iCommunity iLaunch takes place

The Illinois Foundry for Innovation in Engineering Education took place this weekend at the 4H camp at Allerton Park in Monticello, Illinois.  iFoundry freshmen formed an iCommunity consisting of 4 teams.  Many of the ideas in the design of iFoundry are drawn from the practice of genetic algorithms and evolutionary computation in a social setting. […]

The Illinois Foundry for Innovation in Engineering Education took place this weekend at the 4H camp at Allerton Park in Monticello, Illinois.  iFoundry freshmen formed an iCommunity consisting of 4 teams.  Many of the ideas in the design of iFoundry are drawn from the practice of genetic algorithms and evolutionary computation in a social setting. Watch the iLaunch video below:

See other iLaunch materials on the iFoundry website www.ifoundry.illinois.edu.

New book Essentials of Metaheuristics by Sean Luke available online

A new book Essentials of Metaheuristics by Sean Luke is available online. The book can be downloaded for free on its web site. Information about the book from the author’s web site:

This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as […]

A new book Essentials of Metaheuristics by Sean Luke is available online. The book can be downloaded for free on its web site. Information about the book from the author’s web site:

This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course I taught at GMU. The chapters are designed to be printable separately if necessary. As it’s lecture notes, the topics are short and light on examples and theory. It’s best when complementing other texts. With time, I might remedy this.

Easy, reliable, and flexible storage for Python

A while ago I wrote a little post about alternative column stores. One that I mentioned was Tokyo Cabinet (and its associated server Tokyo Tyrant. Tokyo Cabinet it is a key-value store written in C and with bindings for multiple languages (including Python and Java). It can maintain data bases in memory or spin them […]

Related posts:

  1. Temporary storage for Meandre’s distributed flow execution
  2. Efficient storage for Python
  3. A simple and flexible GA loop in Python

A while ago I wrote a little post about alternative column stores. One that I mentioned was Tokyo Cabinet (and its associated server Tokyo Tyrant. Tokyo Cabinet it is a key-value store written in C and with bindings for multiple languages (including Python and Java). It can maintain data bases in memory or spin them to disk (you can pick between hash or B-tree based stores).

Having heard a bunch of good things, I finally gave it a try. I just installed both Cabinet and Tyrant (you may find useful installation instructions here using the usual configure, make, make install cycle). Another nice feature of Tyrant is that it also supports HTTP gets and puts. So having all this said, I just wanted to check how easy it was to use it from Python. And the answer was very simple. Joseph Turian’s examples got me running in less than 2 minutes—see the piece of code below—when dealing with a particular data base. Using Tyrant over HTTP is quite simple too—see PeteSearch blog post.

import pytc,pickle
from numpy import *
 
hdb = pytc.HDB()
hdb.open('casket.tch',pytc.HDBOWRITER|pytc.HDBOCREAT)
 
a = arange(100)
hdb.put('test',pickle.dumps(a))
b = pickle.loads(hdb.get('test'))
if (a==b).all() :
     print 'OK'
hdb.close()

Related posts:

  1. Temporary storage for Meandre’s distributed flow execution
  2. Efficient storage for Python
  3. A simple and flexible GA loop in Python

Save the Date for Philosophy, Engineering & Technology: 9-10 May 2010

The 2010 Forum on Philosophy, Engineering, and Technology (FPET-2010) will be held on 9-10 May 2010 (Sunday evening through Monday) at the Colorado School of Mines in Golden, CO. The event is an outgrowth of the WPE-2007 and WPE-2008 meetings held in Delft and London.
Philosophical reasoning was important to the writing of The Design of […]

The 2010 Forum on Philosophy, Engineering, and Technology (FPET-2010) will be held on 9-10 May 2010 (Sunday evening through Monday) at the Colorado School of Mines in Golden, CO. The event is an outgrowth of the WPE-2007 and WPE-2008 meetings held in Delft and London.

Philosophical reasoning was important to the writing of The Design of Innovation and DoI author David E. Goldberg is one of FPET-2010’s organizers. More information is available at www.philengtech.org.

Large Scale Data Mining using Genetics-Based Machine Learning

Below you may find the slides of the GECCO 2009 tutorial that Jaume Bacardit and I put together. Hope you enjoy it.
Slides
Abstract
We are living in the peta-byte era.We have larger and larger data to analyze, process and transform into useful answers for the domain experts. Robust data mining tools, able to cope with petascale volumes […]

Related posts:

  1. Observer-Invariant Histopathology using Genetics-Based Machine Learning
  2. Deadline extended for special issue on Metaheuristics for Large Scale Data Mining
  3. [BDCSG2008] Algorithmic Perspectives on Large-Scale Social Network Data (Jon Kleinberg)

Below you may find the slides of the GECCO 2009 tutorial that Jaume Bacardit and I put together. Hope you enjoy it.

Slides

Abstract

We are living in the peta-byte era.We have larger and larger data to analyze, process and transform into useful answers for the domain experts. Robust data mining tools, able to cope with petascale volumes and/or high dimensionality producing human-understandable solutions are key on several domain areas. Genetics-based machine learning (GBML) techniques are perfect candidates for this task, among others, due to the recent advances in representations, learning paradigms, and theoretical modeling. If evolutionary learning techniques aspire to be a relevant player in this context, they need to have the capacity of processing these vast amounts of data and they need to process this data within reasonable time. Moreover, massive computation cycles are getting cheaper and cheaper every day, allowing researchers to have access to unprecedented parallelization degrees. Several topics are interlaced in these two requirements: (1) having the proper learning paradigms and knowledge representations, (2) understanding them and knowing when are they suitable for the problem at hand, (3) using efficiency enhancement techniques, and (4) transforming and visualizing the produced solutions to give back as much insight as possible to the domain experts are few of them.

This tutorial will try to answer this question, following a roadmap that starts with the questions of what large means, and why large is a challenge for GBML methods. Afterwards, we will discuss different facets in which we can overcome this challenge: Efficiency enhancement techniques, representations able to cope with large dimensionality spaces, scalability of learning paradigms. We will also review a topic interlaced with all of them: how can we model the scalability of the components of our GBML systems to better engineer them to get the best performance out of them for large datasets. The roadmap continues with examples of real applications of GBML systems and finishes with an analysis of further directions.

Related posts:

  1. Observer-Invariant Histopathology using Genetics-Based Machine Learning
  2. Deadline extended for special issue on Metaheuristics for Large Scale Data Mining
  3. [BDCSG2008] Algorithmic Perspectives on Large-Scale Social Network Data (Jon Kleinberg)

BOA paper got ACM SIGEVO GECCO Impact Award

At the SIGEVO Meeting at GECCO-2009, the GECCO-99 paper introducing the Bayesian optimization algorithm (BOA) was one of the two papers that received GECCO Impact Award. This is a new award and it focuses on past GECCO papers that have made most impact and have had most citations. The paper was in fact a project […]

At the SIGEVO Meeting at GECCO-2009, the GECCO-99 paper introducing the Bayesian optimization algorithm (BOA) was one of the two papers that received GECCO Impact Award. This is a new award and it focuses on past GECCO papers that have made most impact and have had most citations. The paper was in fact a project from David Goldberg’s class Genetic Algorithms in Search, Optimization, and Machine Learning (GE-485) at the University of Illinois at Urbana-Champaign.

The two awarded papers were:

  • M. Pelikan, D. Goldberg, E. Cantu-Paz (1999). BOA: The
    Bayesian Optimization Algorithm
    . GECCO-99.
  • S. Hofmeyer, S. Forrest (1999). Immunity by Design: An
    Artificial Immune System
    . GECCO-99.

GECCO-2009 – Results of the Second Leg of the Championship

The second leg of the 2009 Simulated Car Racing Championship just ended. We received around ten submissions. Five new submissions plus the submissions from CEC-2009. Three participants of the CEC-2009 simulated car racing competition updated their drivers.
The three tracks used for the GECCO-2009 leg are: Dirt3, E-road and Alpine.
The results of the first qualifying stage […]

The second leg of the 2009 Simulated Car Racing Championship just ended. We received around ten submissions. Five new submissions plus the submissions from CEC-2009. Three participants of the CEC-2009 simulated car racing competition updated their drivers.

The three tracks used for the GECCO-2009 leg are: Dirt3, E-road and Alpine.

The results of the first qualifying stage are summarized in the following table:

COBOSTAR is still the fastest controller around but Onieva and Pelta are getting closer and closer. MrRacer was unfortunately disqualified since the controller crashed in one of the tracks. At the end of the first stage eight controllers have been selected (the ones showed in green in the table) and three were eliminated (the red ones in the table above).

In the second stage, for each track, we run eight races with different starting grids and scored the controllers based on their arrival position.

The results are summarized in the following table:

Onieva and Pelta performed really well and actually won this leg of the championship. Congratulations! Their new controller performed really much better than the previous one.

This results reopens the championship since the championship scoreboard has the two teams separated by just few points as shown in this table:

Please, remind that the controller by Luigi, the champion of the CIG2008 competition, appears in the scoreboard but it cannot be awarded with any prize since it belongs to one of the organizing institutions).

I wish to thank all the participants. The next leg will be held during CIG-2009 in Milan and it will be held live so that people will be able to watch an actual race while it is happening.

More news will be posted later.