Results Classification - Comparison with existing approaches on benchmark datasets Survival Analysis – International multi-centre double-blind study Survival.

Slides:



Advertisements
Similar presentations
New Micro Genetic Algorithm for multi-user detection in WCDMA AZMI BIN AHMAD Borhanuddin Mohd Ali, Sabira Khatun, Azmi Hassan Dept of Computer and Communication.
Advertisements

Rolls-Royce supported University Technology Centre in Control and Systems Engineering UK e-Science DAME Project Alex Shenfield
The story beyond Artificial Immune Systems Zhou Ji, Ph.D. Center for Computational Biology and Bioinformatics Columbia University Wuhan, China 2009.
Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Advancements in Genetic Programming for Data Classification Dr. Hajira Jabeen Iqra University Islamabad, Pakistan.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
A GENETIC ALGORITHM APPROACH TO SPACE LAYOUT PLANNING OPTIMIZATION Hoda Homayouni.
Spring, 2013C.-S. Shieh, EC, KUAS, Taiwan1 Heuristic Optimization Methods Pareto Multiobjective Optimization Patrick N. Ngatchou, Anahita Zarei, Warren.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
1. Elements of the Genetic Algorithm  Genome: A finite dynamical system model as a set of d polynomials over  2 (finite field of 2 elements)  Fitness.
A New Evolutionary Algorithm for Multi-objective Optimization Problems Multi-objective Optimization Problems (MOP) –Definition –NP hard By Zhi Wei.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Department of Engineering, Control & Instrumentation Research Group 22 – Mar – 2006 Optimisation Based Clearance of Nonlinear Flight Control Laws Prathyush.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Genetic Algorithm for Variable Selection
Torcs Simulator Presented by Galina Volkinshtein and Evgenia Dubrovsky.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
The Pareto fitness genetic algorithm: Test function study Wei-Ming Chen
Applying Multi-Criteria Optimisation to Develop Cognitive Models Peter Lane University of Hertfordshire Fernand Gobet Brunel University.
Results Comparison with existing approaches on benchmark datasets Evaluation on a uveal melanoma datasetEvaluation on the two-spiral dataset Evaluation.
Island Based GA for Optimization University of Guelph School of Engineering Hooman Homayounfar March 2003.
Evolutionary algorithms
Efficient Model Selection for Support Vector Machines
1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.
Adapting Convergent Scheduling Using Machine Learning Diego Puppin*, Mark Stephenson †, Una-May O’Reilly †, Martin Martin †, and Saman Amarasinghe † *
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
Genetic Algorithms Michael J. Watts
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Omni-Optimizer A Procedure for Single and Multi-objective Optimization Prof. Kalyanmoy Deb and Santosh Tiwari.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Fuzzy Genetic Algorithm
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Simulation in Wind Turbine Vibrations: A Data Driven Analysis Graduate Students: Zijun Zhang PI: Andrew Kusiak Intelligent Systems Laboratory The University.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
Evolving the goal priorities of autonomous agents Adam Campbell* Advisor: Dr. Annie S. Wu* Collaborator: Dr. Randall Shumaker** School of Electrical Engineering.
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
IMPACT OF CACHE PARTITIONING ON MULTI-TASKING REAL TIME EMBEDDED SYSTEMS Presentation by: Eric Magil Research by: Bach D. Bui, Marco Caccamo, Lui Sha,
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.25.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
CISC Machine Learning for Solving Systems Problems Presented by: Eunjung Park Dept of Computer & Information Sciences University of Delaware Solutions.
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
A Multiobjective Evolutionary Algorithm Using Gaussian Process based Inverse Modeling Ran Cheng 1, Yaochu Jin 1, Kaname Narukawa 2 and Bernhard Sendhof.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
Genetic Algorithm(GA)
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Evolutionary Computation Evolving Neural Network Topologies.
L-Dominance: An Approximate-Domination Mechanism
Evolutionary Technique for Combinatorial Reverse Auctions
Evolving the goal priorities of autonomous agents
Presented by: Dr Beatriz de la Iglesia
Heuristic Optimization Methods Pareto Multiobjective Optimization
Methods and Materials (cont.)
Presentation transcript:

Results Classification - Comparison with existing approaches on benchmark datasets Survival Analysis – International multi-centre double-blind study Survival Analysis – Finding subgroups with significantly different survival curves Conclusions And Future Work MOEAs are versatile algorithms for successful model extraction MOEAs can produce models that perform well on real-world and benchmark data The approach will be tested on artificial benchmark data to determine under which conditions the approach performs well or not. Acknowledgments This research has been supported by the Computer Science Department of the University of Liverpool. Model Extraction Using Multi-Objective Evolutionary Algorithms C Setzkorn*, AFG Taktak*, BE Damato # Dept. of Clinical Engineering*, Ocular Oncology Centre #, RLBUHT Summary Multi-objective evolutionary algorithms (MOEAs) are powerful optimisation algorithms which simulate the Darwinian principle of the survival of the fittest within a computer. MOEAs can be used to extract models from data as they can optimise several objectives at the same time (e.g. the parameters and structure of the model) and are less susceptible to interaction effects and noise within the data. The present work uses a MOEA to extract models for classification and survival analysis. In addition, the MOEA is used to find subgroups of patients with significantly different survival curves. Introduction And Methods Structure Of A Multi-Objective Evolutionary Algorithm Genetic Operators And Selection Why Multi-Objective Evolutionary Algorithms? Advantages: Generate a set of trade-off solutions in a single run. Applicable to large and complex search spaces. Deals with incommensurable objectives. Unsusceptible to the shape of the trade-off surface Alleviates over-fitting and reduces model complexity Disadvantages: Computational expensive. No guaranteed convergence. Implementation of international multi-centre double-blind study Table 1: Comparison of the MOEA with three existing approaches on several benchmark datasets. C linical E ngineering Royal Liverpool University Hospital Figure 6: Decision surface for the spiral dataset. The spiral dataset is a complicated artificial problem Crossover Mutation Selection Figure 1: Structure of a multi-objective evolutionary algorithm. Figure 2: Genetic operators: crossover and mutation. They can change the structure and the parameters of models. Figure 3: Selection simulates the Darwinian principle of the survival of the fittest. Decrease complexity Increase fit to the data Figure 4: Set of trade-off solutions. Red points are so-called non-dominated solutions (models). Participants Hane/Paulo (UK), Patrizia (Italy), Ian (UK), Christian (UK), George (Greece) Elia (Italy), Azzam (UK) General Ocular Oncology Database (Geoconda) Assessors Referee Figure 5: Model extraction performed by five centres from three countries. The results are evaluated in a double-blind manner. Figure 8: Kaplan-Meier curves for the Leukemia data (solid line - Treatment, dashed line - Placebo) together with the estimates of the model (asterisks - Treatment, cross - Placebo). Figure 7: Results of an international multi-centre study. Performance measured by the CIndex. RBF is the MOEA approach. Figure 9: The produced models can also be used via the Internet. Figure 10: Kaplan-Meier curves of four generated subgroups with significantly different survival times (Log-Rank , p < ). Figure 11: The MOEA was used to describe the four subgroups within the feature space. Initialise Population Randomly Apply Genetic Operators Fitness Evaluation Do It Again ? Output Archive Selection