Slides from my GECCO-2009 presentations

I just put the slides from my GECCO-2009 presentations online both on the MEDAL Publications page and on the slideshare.net. The slideshare.net versions are embedded below:
Initial-Population Bias in the Univariate Estimation of Distribution Algorithm
View more documents from pelikan.

Performance of Evolutionary Algorithms on NK Landscapes with Nearest Neighbor Interactions and Tunable Overlap
View more documents from pelikan.

Analysis […]

I just put the slides from my GECCO-2009 presentations online both on the MEDAL Publications page and on the slideshare.net. The slideshare.net versions are embedded below:

Initial-Population Bias in the Univariate Estimation of Distribution Algorithm

View more documents from pelikan.
Performance of Evolutionary Algorithms on NK Landscapes with Nearest Neighbor Interactions and Tunable Overlap

View more documents from pelikan.
Analysis of Evolutionary Algorithms on the One-Dimensional Spin Glass with Power-Law Interactions

View more documents from pelikan.

GECCO 2009: A binary pre-teenager

GECCO, one of the most relevant conferences on evolutionary computation, starts its 10th edition today in Montréal (Canada). The organization committee has prepared a lot of surprises within a tight […]

GECCO, one of the most relevant conferences on evolutionary computation, starts its 10th edition today in Montréal (Canada). The organization committee has prepared a lot of surprises within a tight agenda. From July 8 to July 12, full days of tutorials, workshops, poster sessions, talks, competitions, awards, the birthday, and the star talk by John H. Holland will be a promising immersion into the emergent world of evolutionary computation. I hope all of them give rise to the “Chronicles of GECCO”.

For further information, please see the program.

GECCO 2009: A binary pre-teenager

GECCO, one of the most relevant conferences on evolutionary computation, starts its 10th edition today in Montréal (Canada). The organization committee has prepared a lot of surprises within a tight agenda. From July 8 to July 12, full days of tutorials, workshops, poster sessions, talks, competitions, awards, the birthday, and the star talk by John […]

GECCO, one of the most relevant conferences on evolutionary computation, starts its 10th edition today in Montréal (Canada). The organization committee has prepared a lot of surprises within a tight agenda. From July 8 to July 12, full days of tutorials, workshops, poster sessions, talks, competitions, awards, the birthday, and the star talk by John H. Holland will be a promising immersion into the emergent world of evolutionary computation. I hope all of them give rise to the “Chronicles of GECCO”.

For further information, please see the program.

Artificial Immune Systems: structure, function, diversity and an application to biclustering

Artificial Immune Systems: structure, function, diversity and an application to biclustering
Content Type Journal ArticleDOI 10.1007/s11047-009-9145-9Authors
Leandro N. de Castro, Mackenzie University Rua da Consolação 896, Consolação Sao Paulo …

Artificial Immune Systems: structure, function, diversity and an application to biclustering

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9145-9
  • Authors
    • Leandro N. de Castro, Mackenzie University Rua da Consolação 896, Consolação Sao Paulo SP 01302-907 Brazil
    • Jon Timmis, University of York Department of Computer Science Heslington York YO10 5DD UK
    • Helder Knidel, NatComp—From Nature to Business R. do Comércio, 44, Center Santos SP 11010-140 Brazil
    • Fernando Von Zuben, University of Campinas (Unicamp) Laboratory of Bioinformatics and Bio-inspired Computing (LBiC), School of Electrical and Computer Engineering (FEEC) P.O. Box 6101 13083-970 Campinas SP Brazil

Independence Day

New York (USA)

Morning saw the City calm after eleven days of rains. This sunny day allowed people to have picnics and enjoy a peaceful holiday. At eight, however, things got hectic. The roofs of the buildings welcomed the most impatient onlookers. Neighbor communities began the preparations with the following ingredients: barbecues, beers, and joy. The […]

New York (USA)
New York (USA)

Morning saw the City calm after eleven days of rains. This sunny day allowed people to have picnics and enjoy a peaceful holiday. At eight, however, things got hectic. The roofs of the buildings welcomed the most impatient onlookers. Neighbor communities began the preparations with the following ingredients: barbecues, beers, and joy. The streets became crowded. The flood of people was on the Hudson River way to attend the expected spectacle. It was nearly time of fireworks!
And, it was amazing! For one hour, bright cubes, palms, smilies, flowers, and multicolored spheres sparkled on the sky. The views were impressive, beautiful fireworks superimposed along the Hudson River and with New Jersey at the back.

Award for David E. Goldberg

David E. Goldberg has been awarded an Evolutionary Computation Pioneer Award by the Computational Intelligence Society. More details here. Well-deserved congratulations to David, who has given so much to our field!

David E. Goldberg has been awarded an Evolutionary Computation Pioneer Award by the Computational Intelligence Society. More details here. Well-deserved congratulations to David, who has given so much to our field!

The identification and exploitation of dormancy in genetic programming

Abstract  In genetic programming, introns—fragments of code which do not contribute to the fitness of individuals—are usually viewed
negatively, and much research has been undertaken into ways of minimising their occurrence or effects. H…

Abstract  In genetic programming, introns—fragments of code which do not contribute to the fitness of individuals—are usually viewed
negatively, and much research has been undertaken into ways of minimising their occurrence or effects. However, identification
and removal of introns is often computationally expensive and sometimes intractable. We have therefore focused our attention
on one particular class of intron, which we refer to as dormant nodes. Mechanisms for locating such nodes are cheap to implement,
and reveal that the presence of dormancy can be extensive. Once identified, dormancy can be exploited in at least three ways:
improving execution efficiency, improving solution-finding performance, and simplifying program code. Experimentation shows
that the gains to be had in all three cases can be significant.

  • Content Type Journal Article
  • Category Original Paper
  • DOI 10.1007/s10710-009-9086-1
  • Authors
    • David Jackson, University of Liverpool Department of Computer Science Liverpool L69 3BX UK

NIGEL 2006 Part V: Bernardó vs. Lanzi

After the vacation break, two more NIGEL 2006 talks are available at LCS & GBML Central. This week Ester Bernardó presents how LCS can perform in the presence of class imbalance, whereas Lanzi continues his quest on computed predictions.

Related posts:NIGEL 2006 Part IV: Llorà vs. CasillasTranscoding NIGEL 2006 videosNIGEL 2006 Part III: Butz […]

Related posts:

  1. NIGEL 2006 Part IV: Llorà vs. Casillas
  2. Transcoding NIGEL 2006 videos
  3. NIGEL 2006 Part III: Butz vs. Barry

After the vacation break, two more NIGEL 2006 talks are available at LCS & GBML Central. This week Ester Bernardó presents how LCS can perform in the presence of class imbalance, whereas Lanzi continues his quest on computed predictions.

Related posts:

  1. NIGEL 2006 Part IV: Llorà vs. Casillas
  2. Transcoding NIGEL 2006 videos
  3. NIGEL 2006 Part III: Butz vs. Barry

NIGEL 2006 revisited (Part V): Bernadó and Lanzi

After a brief break, the two last rounds of talks are coming. This week two more NIGEL 2006 talks. Enjoy this fifth release, Bernadó vs. Lanzi.

Ester Bernardó-Mansilla

Video
[vimeo clip_id=5065762 width=”432″ height=”320″]

Slides
[slideshare id=1384643&doc=nigel-2006-bernado-090504153926-phpapp02]

Pier Luca Lanzi

Video
[vimeo clip_id=5065667 width=”432″ height=”320″]

Slides
[slideshare id=1384584&doc=nigel-2006-lanzi-090504152951-phpapp02]

IWLCS 2009 Programme

Welcome to the Learning Classifier Systems workshop programme -Thursday, July 9, as part of GECCO 2009. Interesting and friendly discussions will occur throughout the workshop led by experts in the field. We also encourage, and anticipate, participation from researchers new to LCS to provide input on how best to develop the field.

Twelfth International Workshop on Learning Classifier Systems

Workshop Program

Session 1 : XCS
8:30 – 8:40 Registration and Welcome
8:40 – 9:15 Alessandro Colombo, Fabio Della Rossa, Pier Luca Lanzi, Daniele Loiacono, Kumara Sastry. “Generalization in XCSF”
9:15 – 10:20 Discussion. Martin V. Butz, Patrick O. Stalph. “Current XCSF Capabilities and Challenges”
10:20 – 10:40 Break
Session 2 : Applications
10:40 – 10:50 Ajay Kumar Tanwani, Muddassar Farooq. “The Role of Biomedical Dataset in Mining with Evolutionary Rule Learning Algorithms”
10:50 – 11:00 M Zubair Shafiq, S Momina Tabish, Muddassar Farooq. “On the Appropriateness of Evolutionary Rule Learning Algorithms for Malware Detection”
11:00 – 11:35 Daniele Loiacono, Pier Luca Lanzi. “Speeding up Matching in XCS”
11:35 – 12:30 Discussion. Jaume Barcadit. “Efficiency”
12:30 – 14:00 Break
Session 3
14:00 – 14:35 Xavier Llorà, Jose Garcia Moreno-Torres. “Who should you blame when your model does not work?”
14:35 – 15:10 Richard Preen. “An XCS Approach to Forecasting Financial Time Series”
15:10 – 15:50 Discussion. Will Browne. “Cognitive Robotics with LCS”
15:50 – 16:10 Break
Session 4 : Future Directions
16:10 – 16:45 Alexander Scheidler, Martin Middendorf. “Evolved Cooperation and Emergent Communication Structures in Learning Classifier Based Organic Computing Systems”
16:45 – 17:20 Stewart W. Wilson. “Coevolution of Pattern Generators and Recognizers”
17:20 – 18:00 Discussion. Tim Kovacs. “State and Future of LCS”
18:00 – 20:00 Break
20:00 Social Dinner
Ferreira Cafe, 1446, rue Peel
(to attend, please inform workshop organisers before lunch break)