data mining in bioinformatics day 8 feature selection in
play

Data Mining in Bioinformatics Day 8: Feature Selection in - PowerPoint PPT Presentation

Data Mining in Bioinformatics Day 8: Feature Selection in Bioinformatics Karsten Borgwardt February 25 to March 10 Bioinformatics Group MPIs Tbingen Karsten Borgwardt: Data Mining in Bioinformatics, Page 1 Gene Selection via the BAHSIC


  1. Data Mining in Bioinformatics Day 8: Feature Selection in Bioinformatics Karsten Borgwardt February 25 to March 10 Bioinformatics Group MPIs Tübingen Karsten Borgwardt: Data Mining in Bioinformatics, Page 1

  2. Gene Selection via the BAHSIC Family of Algorithms Le Song NICTA Statistical Machine Learning Program, Australia University of Sydney Joint work with Justin Bedo, Karsten Borgwardt, Arthur Gretton and Alex Smola 25th July 2007 Le Song Gene Selection via the BAHSIC Family of Algorithms

  3. Gene Selection Reasons Biological: identify disease related genes. Statistical: avoid model overfitting. Le Song Gene Selection via the BAHSIC Family of Algorithms

  4. Gene Selection Current State Small sample size (100+), large number of genes (10,000+) Lack of robustness: gene lists are not reproducible. Plethora of feature selectors: which to choose? Le Song Gene Selection via the BAHSIC Family of Algorithms

  5. Gene Selection Two components Selection criterion (eg. Pearson’s correlation, t-statistic, mutual information) Selection algorithm (eg. forward greedy method, backward elimination, feature weighting) Le Song Gene Selection via the BAHSIC Family of Algorithms

  6. Gene Selection BAHSIC: BAckward elimination via Hilbert-Schmidt Independence Criterion (BAHSIC) Key Idea: Select genes whose expression levels are most relevant/dependent on the phenotype as measured by HSIC. Le Song Gene Selection via the BAHSIC Family of Algorithms

  7. HSIC Hilbert-Schmidt Independence Criterion (HSIC) tr ( KHLH ) K : kernel or similarity matrix on gene expression data L : kernel or similarity matrix on phenotype information H : centering matrix Le Song Gene Selection via the BAHSIC Family of Algorithms

  8. BAHSIC BAckward elimination via HSIC(BAHSIC) Start with full set of genes. Find the gene that is the least relevant to phenotype information. Remove this gene. Repeat until a few genes are left. Le Song Gene Selection via the BAHSIC Family of Algorithms

  9. BAHSIC Family: tr ( KHLH ) Examples Pearson’s correlation Mean difference Kernel mean difference t-statistic Signal-to-noise ratio (SNR) Moderated-t Shrunken centroid Ridge regression Quadratic mutual information ... Le Song Gene Selection via the BAHSIC Family of Algorithms

  10. BAHSIC Family: tr ( KHLH ) Pearson’s correlation � m i = 1 ( x i − ¯ x )( y i − ¯ y ) r xy = s x s y Normalize data and labels by std. s x and s y . Linear kernels on both domain Le Song Gene Selection via the BAHSIC Family of Algorithms

  11. BAHSIC Family: tr ( KHLH ) Mean difference and variants (¯ x + − ¯ x − ) 2 m + and − 1 1 Use m − as labels. Linear kernels on both domain Eg. signal-to-noise ratio: normalize by ( s + + s − ) Le Song Gene Selection via the BAHSIC Family of Algorithms

  12. BAHSIC Family: tr ( KHLH ) L Linear Polynomial Gaussian · · · Linear � ? ? ? Polynomial ? ? ? � K Gaussian � ? ? ? ? ? ? � . . . Le Song Gene Selection via the BAHSIC Family of Algorithms

  13. Experiments Linear vs nonlinear features Linear Nonlinear Insert 10 artificial genes into dataset 9 and 10 BAHSIC family Others Ref.# pc snr pam t m-t lods lin RBF dis rfe l1 mi 9 � � � � � � � � � � � � Linear 10 � � � � � � � � � � � � 9 - - - - - - - � � - - � Nonlinear 10 - - - - - - - � � - - � Le Song Gene Selection via the BAHSIC Family of Algorithms

  14. Experiments Subtype discovery linear (first row) vs nonlinear kernel (second row) Dataset 18 Dataset 27 Dataset 28 Le Song Gene Selection via the BAHSIC Family of Algorithms

  15. Experiments Select top 10 genes for classification: BAHSIC family Others Ref.# pc snr pam t m-t lods lin RBF dis rfe l1 mi ℓ 2 16 . 9 20 . 9 17 . 3 43 . 5 50 . 5 50 . 3 13.2 22 . 9 35 . 4 26 . 3 19 . 7 23 . 5 1 � 2 � � 3 � � � 4 � � � � 5 � � � � � � � � � � � 6 � � � � 7 � � � � � � � � 8 � � � � 9 � � � � � 10 � � � � � � � � 11 � � � 12 � � 13 � � 14 � � 15 � � � � � � � (pc=Pearson’s correlation, snr=signal-to-noise ratio, Le Song Gene Selection via the BAHSIC Family of Algorithms pam=shrunken centroid, t=t-statistics, m-t=moderated

  16. Experiments Robustness of the top 10 genes. BAHSIC family Others Ref.# pc snr pam t m-t lods lin RBF dis rfe l1 mi best 2 1 1 6 10 9 0 2 0 0 0 0 1 � � � 2 � 3 � � � 4 � 5 � � � 6 � � � 7 � 8 � � 9 � � � � 10 � � 11 � 12 � 13 � 14 � � � 15 � � Le Song Gene Selection via the BAHSIC Family of Algorithms (pc=Pearson’s correlation, snr=signal-to-noise ratio,

  17. Experiments Rule of thumb: Apply a linear kernel in general. Apply a RBF kernel if nonlinear effects are sought. Le Song Gene Selection via the BAHSIC Family of Algorithms

  18. Summary BAHSIC: BAckward elimination using HSIC BAHSIC provides a unifying framework for various feature selectors. BAHSIC provides guidelines for practical gene selection. Le Song Gene Selection via the BAHSIC Family of Algorithms

  19. The End Acknowledgement US National Science Foundation For more information http://www.cs.usyd.edu.au/ ∼ lesong/ Le Song Gene Selection via the BAHSIC Family of Algorithms

  20. Genome-Wide Association Single Nucleotide Polymorphisms Sites in the genome where the DNA sequences of many individuals differ by a single base are called single nu- cleotide polymorphisms (SNPs) These genetic variants might be related to various phe- notypes such as disease susceptibility Projects International HapMap Project: detect Human SNPs 1001 Genomes: detect Arabidopsis SNPs Karsten Borgwardt: Data Mining in Bioinformatics, Page 2

  21. Genome-Wide Association Instance of Feature Selection Given individuals, their Single Nucleotide Polymor- phisms (SNPs) and their phenotype: Find the SNPs ( X ) that correlate most with a particular phenotype ( Y ) among hundreds of thousands of SNPs for hundreds of individuals Genome Wide Association Studies are a large-scale feature selection problem! Karsten Borgwardt: Data Mining in Bioinformatics, Page 3

  22. Genome-Wide Association Challenges in GWA Large number of SNPs Number of SNPs >> number of individuals Multiple hypothesis testing problem Strategies Analysis of variance (ANOVA) for feature ranking Logistic Regression as a wrapper approach to SNP se- lection Bonferroni correction for multiple hypothesis testing Challenges Correlations between groups of SNPs and phenotypes Complex interactions between SNPs Relevant to distinguish classes of SNPs? Karsten Borgwardt: Data Mining in Bioinformatics, Page 4

  23. References and further reading References [1] Nordborg M and Weigel D. Next-generation genetics in plants. Nature 456(7223):720-3, 2008 Dec 11 [2] International HapMap Consortium. A haplotype map of the human genome. Nature 437(7063):1299-320, 2005 Oct 27 Karsten Borgwardt: Data Mining in Bioinformatics, Page 5

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend