Genetic algorithms applied to multi-class prediction for the analysis of gene expressions data C.H. Ooi & Patrick Tan Presentation by Tim Hamilton.

Slides:



Advertisements
Similar presentations
Genetic Algorithm.
Advertisements

Notes Sample vs distribution “m” vs “µ” and “s” vs “σ” Bias/Variance Bias: Measures how much the learnt model is wrong disregarding noise Variance: Measures.
Predictive Analysis of Gene Expression Data from Human SAGE Libraries Alexessander Alves* Nikolay Zagoruiko + Oleg Okun § Olga Kutnenko + Irina Borisova.
A gene expression analysis system for medical diagnosis D. Maroulis, D. Iakovidis, S. Karkanis, I. Flaounas D. Maroulis, D. Iakovidis, S. Karkanis, I.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Iowa State University Department of Computer Science Artificial Intelligence Research Laboratory Research supported in part by grants from the National.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Predictive Automatic Relevance Determination by Expectation Propagation Yuan (Alan) Qi Thomas P. Minka Rosalind W. Picard Zoubin Ghahramani.
Algorithms for Smoothing Array CGH data
1 Genetic Algorithms. CS The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Genetic Algorithm for Variable Selection
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Research Trends in AI Maze Solving using GA Muhammad Younas Hassan Javaid Danish Hussain
Selecting Informative Genes with Parallel Genetic Algorithms Deodatta Bhoite Prashant Jain.
Making the Most of Small Sample High Dimensional Micro-Array Data Allan Tucker, Veronica Vinciotti, Xiaohui Liu; Brunel University Paul Kellam; Windeyer.
1 Genetic Algorithms. CS 561, Session 26 2 The Traditional Approach Ask an expert Adapt existing designs Trial and error.
Artificial Intelligence Term Project #3 Kyu-Baek Hwang Biointelligence Lab School of Computer Science and Engineering Seoul National University
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
1 Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data Presented by: Tun-Hsiang Yang.
A hybrid method for gene selection in microarray datasets Yungho Leu, Chien-Pan Lee and Ai-Chen Chang National Taiwan University of Science and Technology.
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
EVOLVING ANTS Enrique Areyan School of Informatics and Computing Indiana University January 24, 2012.
Genetic Algorithm.
Classification of multiple cancer types by multicategory support vector machines using gene expression data.
Evolutionary Intelligence
Efficient Model Selection for Support Vector Machines
Multiple Examples of tumor tissue (public data from Whitehead/MIT) SVM Classification of Multiple Tumor Types DNA Microarray Data Oracle Data Mining 78.25%
ArrayCluster: an analytic tool for clustering, data visualization and module finder on gene expression profiles 組員:李祥豪 謝紹陽 江建霖.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Improved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations Kangshun Li Professor, Ph.D Professor, Ph.D College.
GA-Based Feature Selection and Parameter Optimization for Support Vector Machine Cheng-Lung Huang, Chieh-Jen Wang Expert Systems with Applications, Volume.
Diagnosis of multiple cancer types by shrunken centroids of gene expression Course: Topics in Bioinformatics Presenter: Ting Yang Teacher: Professor.
The Broad Institute of MIT and Harvard Classification / Prediction.
Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.
Scenario 6 Distinguishing different types of leukemia to target treatment.
INTRODUCTION TO Machine Learning 3rd Edition
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Genetic Algorithms Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hypotheses are often described by bit.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Guest lecture: Feature Selection Alan Qi Dec 2, 2004.
Molecular Classification of Cancer Class Discovery and Class Prediction by Gene Expression Monitoring.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
CSE182 L14 Mass Spec Quantitation MS applications Microarray analysis.
Statistical Analysis for Expression Experiments Heather Adams BeeSpace Doctoral Forum Thursday May 21, 2009.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Genetic algorithm. Definition The genetic algorithm is a probabilistic search algorithm that iteratively transforms a set (called a population) of mathematical.
Genetic Algorithm(GA)
 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.
Genetic Algorithms Schematic of neural network application to identify metabolites by mass spectrometry (MS) Developed by Dr. Lars Kangas Input to Genetic.
Predictive Automatic Relevance Determination by Expectation Propagation Y. Qi T.P. Minka R.W. Picard Z. Ghahramani.
Alan Qi Thomas P. Minka Rosalind W. Picard Zoubin Ghahramani
Gene Selection for Microarray-based Cancer Classification Using Genetic Algorithm 이 정문 2003/04/01 BI Lab.
Boosting For Tumor Classification With Gene Expression Data
Generalizations of Markov model to characterize biological sequences
Genetic algorithms: case study
GA.
Presentation transcript:

Genetic algorithms applied to multi-class prediction for the analysis of gene expressions data C.H. Ooi & Patrick Tan Presentation by Tim Hamilton

“Genechips” DNA microarrays – a collection of microscopic DNA spots representing single genes. Commonly used to monitor expression levels of thousands of genes at once.

Classification Gene expression data is commonly used in the classification of a biological sample. -Tumor subtypes -Response to certain types of treatment (e.g. chemotherapy). Most approaches focus on classification of two, or at most three classes, and have high rates of error when run on sets containing multiple classes (19%) Propose using GA for analyzing multiple-class expression data.

Reduced performance of previous rank-based approaches because of: 1) missing correlations between genes. 2) Predictor set size must be specified. Data Sets used for the GA: –NCI60: expression profiles of 64 cancer cell lines containing 9703 cDNA sequences. –GCM: expression profiles for 198 tumor samples, 90 normal samples, and 20 unknowns containing genes. –Both data sets were pre-processed to generate a truncated 1000-gene dataset, color ratio of a single spot – color ration of all spots / standard deviation. Kept the genes with the highest standard deviation.

Choosing a GA chromosome Determine some minimum and maximum gene range for selection. [Rmin, Rmax] Chromosome string: [R g1 g2… g Rmax ] - R is the size of the predictive set - any genes past length R are ignored. - genes are chosen from the list of 1000.

Parameters Population size: 100 Generations: 100 Other parameters were varied Crossover method: one-point or universal Selection method: stochastic universal sampling (SUS) or roulette wheel selection (RWS) Probability of Crossover : 0.7 – 1.0 Probability of mutation: – 0.01 Predictor set size range [Rmin, Rmax]: [5, 10], [11, 15], [16, 20], [21, 25], [26,30]; For each predictor set size this produced 96 different runs Run on both the truncated set, and the full data set for comparison.

Each generation of chromosomes is used to classify the data sets using a maximum likelihood (MLHD) method. Fitness = 200 – (E1 + E2) E1 = cross validation error rate E2 = independent test error rate. The MLHD classifier involves a lot of math, but is based upon Bayes Rule Used two previous rank-based methods on the same truncated data set for comparison.

Results Uniform crossover produced the best predictors in size ranges [11,15] and [16,20] One-point crossover best in ranges [5,10], [21,25] and [26,30]. Higher predictive accuracies when run against the truncated data set.

Results vs. Other Methods

Finally, GA compared to another method using SVM classification. The SVM had best performance when all genes of a data-set were used, 22% error The GA used only 32 elements, 18% error.