Testing Groups of Genes
|
|
- Diane Sharp
- 5 years ago
- Views:
Transcription
1 Testing Grups f Genes Part II: Scring Gene Ontlgy Terms Manuela Hummel, LMU München Adrian Alexa, MPI Saarbrücken NGFN-Curses in Practical DNA Micrarray Analysis Heidelberg, March 6, 2008
2 Bilgical questins Main idea: If yu lk fr candidate genes crrelated with a given phentype it is better t lk fr interesting gene grups first. Gruping the genes int bilgical predefined clusters can be seen as a filtering: genes frm the same grup share the same bilgy. Analysis steps: 1. Derive scre fr genes (p-value, t-statistic, even gene expressin value itself). 2. Map genes t bilgical grups and cmpute significance f these grups using a suitable test statistic. 3. Screen the significant bilgical grups fr candidate genes. Advantages: Easier t find bilgically related genes sharing the same pattern. Fewer grups t be investigated fr differential expressin than individual genes. Easier t find genes with sensible small change in expressin.
3 Gene Ontlgy The Gene Ontlgy (GO) is a cntrlled vcabulary t describe gene and gene prduct attributes ( Three Ontlgies Mlecular Functin (7825 terms) Bilgical Prcess (13860 terms) Cellular Cmpnent (1993 terms) Gene Ontlgy mlecular functin transcriptin regulatr activity binding nucleic acid binding DNA binding Relatins between GO terms are displayed in directed acyclic graphs transcriptin factr activity
4 Gene Ontlgy Genes knwn t be assciated with sme attributes are mapped t crrespnding GO terms Inheritance Each gene assciated with sme term is als mapped t all its ancestrs Overlap exists als between unrelated terms Nt every gene belngs t a leave nde {genes in the leaves} = {genes in the rt}
5 GO Analysis Mst current tls fr GO analysis use tests based n Gene Set Enrichment Khatri and Draghici (2005), Rivals et al. (2006) Testing thusands f GO terms requires sme adjustment fr multiple testing Recent appraches incrprate the special structure f the Gene Ontlgy Decrrelating the GO (elim, weight), Alexa et al. (2006) Parent-child apprach, Grssmann et al. (2007) Fcus-level apprach, Geman and Mansmann (2008)
6 Gene sets enrichment Grup enrichment: given a gene grup with sme bilgical functin, analyse the psitins f these genes in the rdered list. The gene grup is relevant, if all genes are amng the tp genes in the rdered list. Idea: Srt genes accrding t sme scre (diff. expressin) and investigate the ranks f the members f grup A (the bilgical functin) in this list. Define cutff and cunt members f grup A belw and abve cutff. Basically, ne wants t cmpare the fllwing ratis: K N x M. K N-K x x-m N (gene n the micrarray) M (genes in grup)
7 GO scring: general prblem Given: Gal: a directed acyclic graph (GO graph) and a set f items (genes) s.t.: each nde in the graph cntains sme genes the parent f a nde cntains all the genes f its child a nde can cntain genes that are nt fund in the children a subset f genes that we call significant genes (differentially expressed genes) find the ndes frm the graph (bilgical functins) that best represent the significant genes w.r.t sme scring functin (sme test statistic)
8 GO independence assumptin GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: <4.75e 06> GO: <1.89e 06> GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: <1.20e 17> GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: <1.69e 19> GO: < > GO: < > GO: < > GO: < > GO: < > GO: <7.24e 19> GO: <2.59e 05> GO: <2.17e 05> GO: < > GO: < > GO: < > GO: <1.94e 15> GO: <6.10e 14> GO: <2.28e 06> GO: <4.50e 05> GO: < > GO: <7.14e 05> GO: <9.95e 14> GO: <1.02e 12> GO: < > Nte: The clring f the ndes represent the relative significance f the GO terms: dark red is the mst significant, light yellw is the least significant frm the graph
9 The elim methd The main idea: Test hw enriched nde x is if we d nt cnsider the genes frm its significant children (x.ch[2] in ur case). Algrithm: 1. The ndes are prcessed bttm-up. This assures that all children f nde x were investigated befre nde x itself. 2. Let remved(x) be the set f genes that were remved x in a previus step by a nde in the lwer subgraph induced by nde x. Then genes(x) < genes(x) remved(x). x.ch[1] p-val = 0.89 x.ch[2] p-val = 1e-5 x.ch[3] p-val = The p-value fr nde x is cmputed using Fisher s exact test. 4. If nde x is fund significant, we remve all the genes mapped t this nde, frm all its ancestrs.
10 elim result GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: <3.01e 14> GO: < > GO: < > GO: < > GO: < > GO: < > GO: <2.29e 06> GO: < > GO: < > GO: <4.50e 05> GO: <7.14e 05> GO: <9.96e 14> GO: <1.02e 12> Tp 10 significant nde (the bxes) btained with methd elim
11 The weight methd We want t decide if nde x is better representing the list f interesting genes (is mre enriched) than any ther nde frm its neighbrhd. The main idea: Assciate single genes mapped t a nde with weights that dente their relevance. The elim algrithm uses 0-1 weights. Algrithm: x.par[1] x.par[2] x.par[3] 1. Cmpute the p-value f nde x with its current x weights. Initially all its genes have weight CASE I: Lk at the children that are mre signif- x.ch[1] p-val = 1e-15 x.ch[2] p-val = 1e-2 x.ch[3] p-val = 1e-9 x.ch[4] p-val = 1e-20 x.ch[5] p-val = 1e-6 icant than nde x (x.ch[1] and x.ch[4]). These children are lcal ptima (clred with red). x.par[1] x.par[2] x.par[3] 3. Fr each such child dwn-weight all genes mapped t it in all the ancestrs f nde x, including x. x p-val = 1e-10 Mark these children and GOTO step 1. x.ch[1] p-val = 1e-15 x.ch[2] p-val = 1e-2 x.ch[3] p-val = 1e-9 x.ch[4] p-val = 1e-20 x.ch[5] p-val = 1e-6
12 The weight methd x.par[1] x.par[2] x.par[3] x p-val = 1e-8 4. CASE II: If n child f nde x has a p-value less than the current p-value f nde x then nde x is x.ch[1] p-val = 1e-15 x.ch[2] p-val = 1e-2 x.ch[3] p-val = 1e-9 x.ch[4] p-val = 1e-20 x.ch[5] p-val = 1e-6 a lcal ptimum. x.par[1] x.par[2] x.par[3] 5. The genes in these children are dwn-weighted and the p-values fr these ndes are recmputed x p-val = 1e-7 with the new updated weights. 6. The prcessing f nde x terminates. Its p-value x.ch[1] p-val = 1e-15 x.ch[2] p-val = 1e-2 x.ch[3] p-val = 1e-9 x.ch[4] p-val = 1e-20 x.ch[5] p-val = 1e-6 can be changed later, when nde x is treated as a child f anther nde. x.par[1] x.par[2] x.par[3] x p-val = 1e-7 x.ch[1] p-val = 1e-15 x.ch[2] p-val = 1 x.ch[3] p-val = 1e-9 x.ch[4] p-val = 1e-20 x.ch[5] p-val = 1e-3
13 The weight methd The p-value f a nde is cmputed by applying Fisher s exact test n a weighted cntingency table. The quantity siggenes genes(u) is replaced with 2 6 X i {siggenes genes(u)} 3 weight[i] 7. The weights fr nde x and ne f its children are btained by sigrati(ch,x) = lg(p-value(ch)) lg(p-value(x)) r sigrati(ch, x) = p-value(x) p-value(ch) If sigrati() > 1 then nde ch is mre significant than its parent, nde x. The weights are updated using vectr peratrs: minimum n the cmpnents, the prduct f the cmpnents, etc.
14 weight result GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: <4.00e 16> GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: < > GO: <5.42e 13> GO: <2.28e 06> GO: < > GO: < > GO: < > GO: < > GO: <4.50e 05> GO: < > GO: < > GO: < > Tp 10 significant nde (the bxes) btained with methd weight
15 Algrithms review classic algrithm Calculate significance f each GO term independently. Adjust pvalues fr multiple testing (Bnferrni, FDR, etc.). Klmgrv-Smirnv test can easily be used in this case elim algrithm Ndes are prcessed bttm-up in the GO graph. It iteratively remves the genes anntated t significant GO terms frm mre general GO terms. Intuitive and simple t interpret. weight algrithm The genes btain weights that dente the gene relevance in the significant ndes. T decide if a GO term u better represents the interesting genes, the enrichment scre f nde u is cmpared with the scres f its children. Children with a better scre than u better represent the interesting genes; their significance is increased Children with a lwer scre than u have their significance reduced.
16 Influence f the p-values adjustment We had perfrmed a tw-stage analysis: classic 1. A cutff is chsen based n the distributin f the genes scres (p-values adjustment prblem). Genes abve the cutff are called DE genes. 2. The enrichment f a set f genes (GO term) is tested based n test statistics that depend n the list f DE genes. GO term rank a a a a a a a a a a a a a a a a a a a a a a b b b b b b b b b b b b b b b b b b b c c c c c c c c c c c c c b b c b b b b b b a a a a a a a a a a a a a a a a d a a b b e e e e e e e b b b b c c b c c c c c c c d d d d c c c c c c c c c c c a c c e e b b b b b b b e e e e e e e e e e d d d d c c c c d d d d d d d d d d d c d d d d g g g g g g g g d d d d d d d d d e e e f f f f f f f f f f f f f f f f f f f g g d d d d d d d d g g g f g g g f f f f f e e e e e e e e e e e e e e e e e e e f f f f f f f f f f f f f g f f f g g g g g g g g g g g g g g g g g g g g g g g g h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h h i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i i j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j j Tp k significant genes Prblem: In real-life cases the list f DE genes cntains nly a small fractin f truly DE genes. Is the result f the enrichment analysis hampered by the Results: chice f the cutff? GO term rank elim a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c c e e e e e e e e e e e e e e e e e e e d d d d d d d d d d d d d d d d d d d d d d d f f d f d d d f d d f f d d d d d d e e e ef ef ef ef ef ef ef ef ef ef ef ef ef ef ef ef ef ef ef f d d f d f f f d f f d d f f f f f f f f f h h h h h h h h h h h g g h g h g h g h g h g h h h g i i i i i i i i i i i h h g h g h g h g h g h h h h h h h h h h h h h g h g g g i i i i i i i i i i i g g g g g i i i i i i i i i g h h g g i i i i i i g g g i i i i j g g j g g g g j j j j j j j Tp k significant genes weight.lg k = 515 DE genes (all genes with FDR-adjusted p-value p 0.01). Variating the cutff value des nt significantly change the rder f the mst significant GO terms (nly small swaps between the GO terms) GO term rank a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a a b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b e f d d d d d d d d d d d d c c c c c c c c d e e e e e e e e d d d d d d d d e e f e c c c c c c c c c c c e d d d d d d d d e d d d d d d d d e e e e e e e e f f c c f f f f e f f e f e f c e e e f f e e f f f f f f f f f f f f f c c c c c d d d d e e e e f e e f e f e f f f f e e f f e c c c c c c c c c c c c f f f f f c c g g g g g g g g g g g g g g i i i g g g g g g j j j j j j j i h g j j j j j j j j i i i i i i i i i i i i i j g g g i i h h i h h g h h g h h j i h i g i h h h h h j j j j j j j j j j i h j h h h i i h i g h g i h i i h g j h h h g i g g g h h h h h h h j j j h j h j j j j j i i g i g g g j i g i g i g i i i h h h h h h j j i Tp k significant genes
17 Evaluatin n simulated data We use the GO graph structure (2311 ndes), and all the genes frm HGU95aV2 Affymetrix chip (9623 mapped t the GO graph) Select nly the ndes that have the n. f mapped genes in sme range ( ) Chse randmly a number f ndes (50 in ur case) frm the selected ndes. These ndes represent the enriched ndes. Set as significant genes all the genes frm the enriched ndes. Sme nise can be intrduce: Pick 10% frm all significant genes Remve them frm the significant list Replace the genes that we remved with ther genes The gal is t recver as best as pssible the enriched ndes.
18 Simulated dataset sig all sig(wanted) all(wanted)
19 Simulated dataset
20 Quality f GO scring methds Each curve represents the average f the numbers f preselected GO terms, ver 100 simulatin runs, that are amng the tp k GO terms. The left plt represents scre 0 k and the right plt represents scre1p k. 10 t 50 genes anntated 10% nise level. N. f enriched ndes fund classic elim weight.lg weight.rati all.m N. f enriched ndes fund classic elim weight.lg weight.rati all.m (a) Tp k ndes (b) Tp k ndes 10 t 1000 genes anntated 40% nise level. N. f enriched ndes fund classic elim weight.lg weight.rati all.m N. f enriched ndes fund classic elim weight.lg weight.rati all.m (c) Tp k ndes Tp k ndes
21 Parent-Child Apprach If many differentially expressed genes are anntated t a GO term it is nt surprising that there is als fund verrepresentatin in the mre specific descendants f the term Cmpute hypergemetric p-values where the reference gene ppulatin des nt cnsist f all genes m but rather f nly all parental genes m pa(t) f a given GO term t P (X t x t X pa(t) = x pa(t) ) = min(x pa(t),m t ) k=x ( mt k ) ( mpa(t) m t x pa(t) k ( mpa(t) x pa(t) ) ) pa(t): set f parents parents f term t m t : number f genes anntated t term t m pa(t) : nr. f genes in either unin r intersectin f genes anntated t parents f t x t : number f differentially expressed genes anntated t term t Grssmann et al. (2007)
22 Parent-Child Apprach Idea is reverse t elim and weight: Children ndes might nly inherit significance frm their mre general parents Fcus lies in mre general terms
23 Simulatin Study Similar simulatin setup as in Alexa et al. (2006), but Pre-selectin f terms that actually can achieve a small p- value with the parent-child apprach Overrepresentatin f just ne term (ut f the preselected) ROC analysis Hw t design an bjective simulatin study...?
24 Fcus Level Apprach Again a different idea: Significant terms lgically must have significant ancestr terms Relevance f terms is assessed by glbal tests (e.g. glbaltest r GlbalAncva) Multiple testing prcedure n the Gene Ontlgy graph which cntrls the family-wise errr rate (FWER): Cmbines clsed testing prcedure with crrectin methd f Hlm Hlm crrectin: very fast but nt very efficient Clsed testing prcedure: very efficient in case f crrelated test statistics but cmputatinally infeasible
25 Fcus Level Apprach Chse a fcus level a set f terms H in the middle f the GO graph (as the level f detail that is f mst interest) Taking each f the terms in H as rt ndes, build subgraphs that are clsed under intersectin Iterate: 1. Test phase: Test the GO terms in H with glbal tests and crrect raw p-values by a Hlm s factr (initially H ) 2. Upward phase: Fr every hypthesis rejected in the test phase, reject all ancestrs 3. Dwnward phase: Add thse terms t H, fr which all parent hyptheses in the clsed subgraphs have been rejected 4. Hlm s phase: Recalculate Hlm s factr as the number f subgraphs which cntain unrejected hyptheses
26 Fcus Level Apprach Result is a significant subgraph starting frm the rt Leave ndes in the subgraph usually are f mst interest
27 References 1. Alexa A, Rahnenführer J, Lengauer T. Imprved scring f functinal grups frm gene expressin data by decrrelating GO graph structure. Biinfrmatics 2006; 22(13): The Gene Ontlgy Cnsrtium. Gene Ontlgy: tl fr the unificatin f bilgy. Nature Genetics 2000; 25: Geman JJ, Mansmann U. Multiple testing n the directed acyclic graph f Gene Ontlgy. Biinfrmatics 2008; 24(4): Grssmann S, Bauer S, Rbinsn PN, Vingrn M. Imprved detectin f verrepresentatin f Gene-Ontlgy anntatins with parent-child analysis. Biinfrmatics 2007; 23(22): Khatri P, Draghici S. Ontlgical analysis f gene expressin data: current tls, limitatins, and pen prblems. Biinfrmatics 2005; 21(18): Rivals I, Persnnaz L, Taing L, Ptier MC. Enrichment r depletin f a GO categry within a class f genes: which test? Biinfrmatics 2007; 23(4):
Chapter 3: Cluster Analysis
Chapter 3: Cluster Analysis } 3.1 Basic Cncepts f Clustering 3.1.1 Cluster Analysis 3.1. Clustering Categries } 3. Partitining Methds 3..1 The principle 3.. K-Means Methd 3..3 K-Medids Methd 3..4 CLARA
More informationDifferentiation Applications 1: Related Rates
Differentiatin Applicatins 1: Related Rates 151 Differentiatin Applicatins 1: Related Rates Mdel 1: Sliding Ladder 10 ladder y 10 ladder 10 ladder A 10 ft ladder is leaning against a wall when the bttm
More informationCAUSAL INFERENCE. Technical Track Session I. Phillippe Leite. The World Bank
CAUSAL INFERENCE Technical Track Sessin I Phillippe Leite The Wrld Bank These slides were develped by Christel Vermeersch and mdified by Phillippe Leite fr the purpse f this wrkshp Plicy questins are causal
More informationGuide to Using the Rubric to Score the Klf4 PREBUILD Model for Science Olympiad National Competitions
Guide t Using the Rubric t Scre the Klf4 PREBUILD Mdel fr Science Olympiad 2010-2011 Natinal Cmpetitins These instructins are t help the event supervisr and scring judges use the rubric develped by the
More informationAdministrativia. Assignment 1 due thursday 9/23/2004 BEFORE midnight. Midterm exam 10/07/2003 in class. CS 460, Sessions 8-9 1
Administrativia Assignment 1 due thursday 9/23/2004 BEFORE midnight Midterm eam 10/07/2003 in class CS 460, Sessins 8-9 1 Last time: search strategies Uninfrmed: Use nly infrmatin available in the prblem
More informationSUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical model for microarray data analysis
SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical mdel fr micrarray data analysis David Rssell Department f Bistatistics M.D. Andersn Cancer Center, Hustn, TX 77030, USA rsselldavid@gmail.cm
More informationHypothesis Tests for One Population Mean
Hypthesis Tests fr One Ppulatin Mean Chapter 9 Ala Abdelbaki Objective Objective: T estimate the value f ne ppulatin mean Inferential statistics using statistics in rder t estimate parameters We will be
More informationBiplots in Practice MICHAEL GREENACRE. Professor of Statistics at the Pompeu Fabra University. Chapter 13 Offprint
Biplts in Practice MICHAEL GREENACRE Prfessr f Statistics at the Pmpeu Fabra University Chapter 13 Offprint CASE STUDY BIOMEDICINE Cmparing Cancer Types Accrding t Gene Epressin Arrays First published:
More informationENSC Discrete Time Systems. Project Outline. Semester
ENSC 49 - iscrete Time Systems Prject Outline Semester 006-1. Objectives The gal f the prject is t design a channel fading simulatr. Upn successful cmpletin f the prject, yu will reinfrce yur understanding
More informationTree Structured Classifier
Tree Structured Classifier Reference: Classificatin and Regressin Trees by L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stne, Chapman & Hall, 98. A Medical Eample (CART): Predict high risk patients
More informationYou need to be able to define the following terms and answer basic questions about them:
CS440/ECE448 Sectin Q Fall 2017 Midterm Review Yu need t be able t define the fllwing terms and answer basic questins abut them: Intr t AI, agents and envirnments Pssible definitins f AI, prs and cns f
More informationA New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation
III-l III. A New Evaluatin Measure J. Jiner and L. Werner Abstract The prblems f evaluatin and the needed criteria f evaluatin measures in the SMART system f infrmatin retrieval are reviewed and discussed.
More informationPattern Recognition 2014 Support Vector Machines
Pattern Recgnitin 2014 Supprt Vectr Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recgnitin 1 / 55 Overview 1 Separable Case 2 Kernel Functins 3 Allwing Errrs (Sft
More informationT Algorithmic methods for data mining. Slide set 6: dimensionality reduction
T-61.5060 Algrithmic methds fr data mining Slide set 6: dimensinality reductin reading assignment LRU bk: 11.1 11.3 PCA tutrial in mycurses (ptinal) ptinal: An Elementary Prf f a Therem f Jhnsn and Lindenstrauss,
More informationResampling Methods. Chapter 5. Chapter 5 1 / 52
Resampling Methds Chapter 5 Chapter 5 1 / 52 1 51 Validatin set apprach 2 52 Crss validatin 3 53 Btstrap Chapter 5 2 / 52 Abut Resampling An imprtant statistical tl Pretending the data as ppulatin and
More informationMATCHING TECHNIQUES. Technical Track Session VI. Emanuela Galasso. The World Bank
MATCHING TECHNIQUES Technical Track Sessin VI Emanuela Galass The Wrld Bank These slides were develped by Christel Vermeersch and mdified by Emanuela Galass fr the purpse f this wrkshp When can we use
More informationEric Klein and Ning Sa
Week 12. Statistical Appraches t Netwrks: p1 and p* Wasserman and Faust Chapter 15: Statistical Analysis f Single Relatinal Netwrks There are fur tasks in psitinal analysis: 1) Define Equivalence 2) Measure
More informationinitially lcated away frm the data set never win the cmpetitin, resulting in a nnptimal nal cdebk, [2] [3] [4] and [5]. Khnen's Self Organizing Featur
Cdewrd Distributin fr Frequency Sensitive Cmpetitive Learning with One Dimensinal Input Data Aristides S. Galanpuls and Stanley C. Ahalt Department f Electrical Engineering The Ohi State University Abstract
More informationCHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS
CHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS 1 Influential bservatins are bservatins whse presence in the data can have a distrting effect n the parameter estimates and pssibly the entire analysis,
More informationDetermining Optimum Path in Synthesis of Organic Compounds using Branch and Bound Algorithm
Determining Optimum Path in Synthesis f Organic Cmpunds using Branch and Bund Algrithm Diastuti Utami 13514071 Prgram Studi Teknik Infrmatika Seklah Teknik Elektr dan Infrmatika Institut Teknlgi Bandung,
More informationCS 477/677 Analysis of Algorithms Fall 2007 Dr. George Bebis Course Project Due Date: 11/29/2007
CS 477/677 Analysis f Algrithms Fall 2007 Dr. Gerge Bebis Curse Prject Due Date: 11/29/2007 Part1: Cmparisn f Srting Algrithms (70% f the prject grade) The bjective f the first part f the assignment is
More informationk-nearest Neighbor How to choose k Average of k points more reliable when: Large k: noise in attributes +o o noise in class labels
Mtivating Example Memry-Based Learning Instance-Based Learning K-earest eighbr Inductive Assumptin Similar inputs map t similar utputs If nt true => learning is impssible If true => learning reduces t
More informationLead/Lag Compensator Frequency Domain Properties and Design Methods
Lectures 6 and 7 Lead/Lag Cmpensatr Frequency Dmain Prperties and Design Methds Definitin Cnsider the cmpensatr (ie cntrller Fr, it is called a lag cmpensatr s K Fr s, it is called a lead cmpensatr Ntatin
More informationCOMP 551 Applied Machine Learning Lecture 4: Linear classification
COMP 551 Applied Machine Learning Lecture 4: Linear classificatin Instructr: Jelle Pineau (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/cmp551 Unless therwise nted, all material psted
More information2004 AP CHEMISTRY FREE-RESPONSE QUESTIONS
2004 AP CHEMISTRY FREE-RESPONSE QUESTIONS 6. An electrchemical cell is cnstructed with an pen switch, as shwn in the diagram abve. A strip f Sn and a strip f an unknwn metal, X, are used as electrdes.
More informationCHAPTER 24: INFERENCE IN REGRESSION. Chapter 24: Make inferences about the population from which the sample data came.
MATH 1342 Ch. 24 April 25 and 27, 2013 Page 1 f 5 CHAPTER 24: INFERENCE IN REGRESSION Chapters 4 and 5: Relatinships between tw quantitative variables. Be able t Make a graph (scatterplt) Summarize the
More informationNAME: Prof. Ruiz. 1. [5 points] What is the difference between simple random sampling and stratified random sampling?
CS4445 ata Mining and Kwledge iscery in atabases. B Term 2014 Exam 1 Nember 24, 2014 Prf. Carlina Ruiz epartment f Cmputer Science Wrcester Plytechnic Institute NAME: Prf. Ruiz Prblem I: Prblem II: Prblem
More informationTuring Machines. Human-aware Robotics. 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Announcement:
Turing Machines Human-aware Rbtics 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Annuncement: q q q q Slides fr this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse355/lectures/tm-ii.pdf
More informationLab 1 The Scientific Method
INTRODUCTION The fllwing labratry exercise is designed t give yu, the student, an pprtunity t explre unknwn systems, r universes, and hypthesize pssible rules which may gvern the behavir within them. Scientific
More informationMATCHING TECHNIQUES Technical Track Session VI Céline Ferré The World Bank
MATCHING TECHNIQUES Technical Track Sessin VI Céline Ferré The Wrld Bank When can we use matching? What if the assignment t the treatment is nt dne randmly r based n an eligibility index, but n the basis
More informationComputational modeling techniques
Cmputatinal mdeling techniques Lecture 4: Mdel checing fr ODE mdels In Petre Department f IT, Åb Aademi http://www.users.ab.fi/ipetre/cmpmd/ Cntent Stichimetric matrix Calculating the mass cnservatin relatins
More informationand the Doppler frequency rate f R , can be related to the coefficients of this polynomial. The relationships are:
Algrithm fr Estimating R and R - (David Sandwell, SIO, August 4, 2006) Azimith cmpressin invlves the alignment f successive eches t be fcused n a pint target Let s be the slw time alng the satellite track
More informationThis section is primarily focused on tools to aid us in finding roots/zeros/ -intercepts of polynomials. Essentially, our focus turns to solving.
Sectin 3.2: Many f yu WILL need t watch the crrespnding vides fr this sectin n MyOpenMath! This sectin is primarily fcused n tls t aid us in finding rts/zers/ -intercepts f plynmials. Essentially, ur fcus
More information5 th grade Common Core Standards
5 th grade Cmmn Cre Standards In Grade 5, instructinal time shuld fcus n three critical areas: (1) develping fluency with additin and subtractin f fractins, and develping understanding f the multiplicatin
More informationDetermining the Accuracy of Modal Parameter Estimation Methods
Determining the Accuracy f Mdal Parameter Estimatin Methds by Michael Lee Ph.D., P.E. & Mar Richardsn Ph.D. Structural Measurement Systems Milpitas, CA Abstract The mst cmmn type f mdal testing system
More informationSection 6-2: Simplex Method: Maximization with Problem Constraints of the Form ~
Sectin 6-2: Simplex Methd: Maximizatin with Prblem Cnstraints f the Frm ~ Nte: This methd was develped by Gerge B. Dantzig in 1947 while n assignment t the U.S. Department f the Air Frce. Definitin: Standard
More informationPipetting 101 Developed by BSU CityLab
Discver the Micrbes Within: The Wlbachia Prject Pipetting 101 Develped by BSU CityLab Clr Cmparisns Pipetting Exercise #1 STUDENT OBJECTIVES Students will be able t: Chse the crrect size micrpipette fr
More informationCOMP 551 Applied Machine Learning Lecture 5: Generative models for linear classification
COMP 551 Applied Machine Learning Lecture 5: Generative mdels fr linear classificatin Instructr: Herke van Hf (herke.vanhf@mail.mcgill.ca) Slides mstly by: Jelle Pineau Class web page: www.cs.mcgill.ca/~hvanh2/cmp551
More informationUnit 1: Introduction to Biology
Name: Unit 1: Intrductin t Bilgy Theme: Frm mlecules t rganisms Students will be able t: 1.1 Plan and cnduct an investigatin: Define the questin, develp a hypthesis, design an experiment and cllect infrmatin,
More informationLecture 24: Flory-Huggins Theory
Lecture 24: 12.07.05 Flry-Huggins Thery Tday: LAST TIME...2 Lattice Mdels f Slutins...2 ENTROPY OF MIXING IN THE FLORY-HUGGINS MODEL...3 CONFIGURATIONS OF A SINGLE CHAIN...3 COUNTING CONFIGURATIONS FOR
More informationAP Statistics Notes Unit Two: The Normal Distributions
AP Statistics Ntes Unit Tw: The Nrmal Distributins Syllabus Objectives: 1.5 The student will summarize distributins f data measuring the psitin using quartiles, percentiles, and standardized scres (z-scres).
More informationWhat is Statistical Learning?
What is Statistical Learning? Sales 5 10 15 20 25 Sales 5 10 15 20 25 Sales 5 10 15 20 25 0 50 100 200 300 TV 0 10 20 30 40 50 Radi 0 20 40 60 80 100 Newspaper Shwn are Sales vs TV, Radi and Newspaper,
More informationBootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) >
Btstrap Methd > # Purpse: understand hw btstrap methd wrks > bs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(bs) > mean(bs) [1] 21.64625 > # estimate f lambda > lambda = 1/mean(bs);
More informationMATHEMATICS SYLLABUS SECONDARY 5th YEAR
Eurpean Schls Office f the Secretary-General Pedaggical Develpment Unit Ref. : 011-01-D-8-en- Orig. : EN MATHEMATICS SYLLABUS SECONDARY 5th YEAR 6 perid/week curse APPROVED BY THE JOINT TEACHING COMMITTEE
More informationhttps://goo.gl/eaqvfo SUMMER REV: Half-Life DUE DATE: JULY 2 nd
NAME: DUE DATE: JULY 2 nd AP Chemistry SUMMER REV: Half-Life Why? Every radiistpe has a characteristic rate f decay measured by its half-life. Half-lives can be as shrt as a fractin f a secnd r as lng
More informationA proposition is a statement that can be either true (T) or false (F), (but not both).
400 lecture nte #1 [Ch 2, 3] Lgic and Prfs 1.1 Prpsitins (Prpsitinal Lgic) A prpsitin is a statement that can be either true (T) r false (F), (but nt bth). "The earth is flat." -- F "March has 31 days."
More informationBIOLOGY 101. CHAPTER 17: Gene Expression: From Gene to Protein. The Flow of Genetic Information
BIOLOGY 101 CHAPTER 17: Gene Expressin: Frm Gene t Prtein Gene Expressin: Frm Gene t Prtein: CONCEPTS: 17.1 Genes specify prteins via transcriptin and translatin 17.2 Transcriptin is the DNA-directed synthesis
More informationA B C. 2. Some genes are not regulated by gene switches. These genes are expressed constantly. What kinds of genes would be expressed constantly?
STO-143 Gene Switches Intrductin Bacteria need t be very efficient and nly prduce specific prteins when they are needed. Making prteins that are nt needed fr everyday cell metablism wastes energy and raw
More informationTutorial 3: Building a spectral library in Skyline
SRM Curse 2013 Tutrial 3 Spectral Library Tutrial 3: Building a spectral library in Skyline Spectral libraries fr SRM methd design and fr data analysis can be either directly added t a Skyline dcument
More information, which yields. where z1. and z2
The Gaussian r Nrmal PDF, Page 1 The Gaussian r Nrmal Prbability Density Functin Authr: Jhn M Cimbala, Penn State University Latest revisin: 11 September 13 The Gaussian r Nrmal Prbability Density Functin
More informationAdmin. MDP Search Trees. Optimal Quantities. Reinforcement Learning
Admin Reinfrcement Learning Cntent adapted frm Berkeley CS188 MDP Search Trees Each MDP state prjects an expectimax-like search tree Optimal Quantities The value (utility) f a state s: V*(s) = expected
More informationExperiment #3. Graphing with Excel
Experiment #3. Graphing with Excel Study the "Graphing with Excel" instructins that have been prvided. Additinal help with learning t use Excel can be fund n several web sites, including http://www.ncsu.edu/labwrite/res/gt/gt-
More informationCONSTRUCTING STATECHART DIAGRAMS
CONSTRUCTING STATECHART DIAGRAMS The fllwing checklist shws the necessary steps fr cnstructing the statechart diagrams f a class. Subsequently, we will explain the individual steps further. Checklist 4.6
More informationNUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION
NUROP Chinese Pinyin T Chinese Character Cnversin NUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION CHIA LI SHI 1 AND LUA KIM TENG 2 Schl f Cmputing, Natinal University f Singapre 3 Science
More informationChapter 3 Kinematics in Two Dimensions; Vectors
Chapter 3 Kinematics in Tw Dimensins; Vectrs Vectrs and Scalars Additin f Vectrs Graphical Methds (One and Tw- Dimensin) Multiplicatin f a Vectr b a Scalar Subtractin f Vectrs Graphical Methds Adding Vectrs
More informationName: Block: Date: Science 10: The Great Geyser Experiment A controlled experiment
Science 10: The Great Geyser Experiment A cntrlled experiment Yu will prduce a GEYSER by drpping Ments int a bttle f diet pp Sme questins t think abut are: What are yu ging t test? What are yu ging t measure?
More informationA Few Basic Facts About Isothermal Mass Transfer in a Binary Mixture
Few asic Facts but Isthermal Mass Transfer in a inary Miture David Keffer Department f Chemical Engineering University f Tennessee first begun: pril 22, 2004 last updated: January 13, 2006 dkeffer@utk.edu
More informationAIP Logic Chapter 4 Notes
AIP Lgic Chapter 4 Ntes Sectin 4.1 Sectin 4.2 Sectin 4.3 Sectin 4.4 Sectin 4.5 Sectin 4.6 Sectin 4.7 4.1 The Cmpnents f Categrical Prpsitins There are fur types f categrical prpsitins. Prpsitin Letter
More information3.4 Shrinkage Methods Prostate Cancer Data Example (Continued) Ridge Regression
3.3.4 Prstate Cancer Data Example (Cntinued) 3.4 Shrinkage Methds 61 Table 3.3 shws the cefficients frm a number f different selectin and shrinkage methds. They are best-subset selectin using an all-subsets
More informationIAML: Support Vector Machines
1 / 22 IAML: Supprt Vectr Machines Charles Suttn and Victr Lavrenk Schl f Infrmatics Semester 1 2 / 22 Outline Separating hyperplane with maimum margin Nn-separable training data Epanding the input int
More informationCHM112 Lab Graphing with Excel Grading Rubric
Name CHM112 Lab Graphing with Excel Grading Rubric Criteria Pints pssible Pints earned Graphs crrectly pltted and adhere t all guidelines (including descriptive title, prperly frmatted axes, trendline
More informationMODULE FOUR. This module addresses functions. SC Academic Elementary Algebra Standards:
MODULE FOUR This mdule addresses functins SC Academic Standards: EA-3.1 Classify a relatinship as being either a functin r nt a functin when given data as a table, set f rdered pairs, r graph. EA-3.2 Use
More informationKinetic Model Completeness
5.68J/10.652J Spring 2003 Lecture Ntes Tuesday April 15, 2003 Kinetic Mdel Cmpleteness We say a chemical kinetic mdel is cmplete fr a particular reactin cnditin when it cntains all the species and reactins
More informationPSU GISPOPSCI June 2011 Ordinary Least Squares & Spatial Linear Regression in GeoDa
There are tw parts t this lab. The first is intended t demnstrate hw t request and interpret the spatial diagnstics f a standard OLS regressin mdel using GeDa. The diagnstics prvide infrmatin abut the
More informationCombining Dialectical Optimization and Gradient Descent Methods for Improving the Accuracy of Straight Line Segment Classifiers
Cmbining Dialectical Optimizatin and Gradient Descent Methds fr Imprving the Accuracy f Straight Line Segment Classifiers Rsari A. Medina Rdriguez and Rnald Fumi Hashimt University f Sa Paul Institute
More informationComparing Several Means: ANOVA. Group Means and Grand Mean
STAT 511 ANOVA and Regressin 1 Cmparing Several Means: ANOVA Slide 1 Blue Lake snap beans were grwn in 12 pen-tp chambers which are subject t 4 treatments 3 each with O 3 and SO 2 present/absent. The ttal
More informationSection I5: Feedback in Operational Amplifiers
Sectin I5: eedback in Operatinal mplifiers s discussed earlier, practical p-amps hae a high gain under dc (zer frequency) cnditins and the gain decreases as frequency increases. This frequency dependence
More informationChecking the resolved resonance region in EXFOR database
Checking the reslved resnance regin in EXFOR database Gttfried Bertn Sciété de Calcul Mathématique (SCM) Oscar Cabells OECD/NEA Data Bank JEFF Meetings - Sessin JEFF Experiments Nvember 0-4, 017 Bulgne-Billancurt,
More informationChapter 3 Digital Transmission Fundamentals
Chapter 3 Digital Transmissin Fundamentals Errr Detectin and Crrectin CSE 3213, Winter 2010 Instructr: Frhar Frzan Mdul-2 Arithmetic Mdul 2 arithmetic is perfrmed digit y digit n inary numers. Each digit
More informationDead-beat controller design
J. Hetthéssy, A. Barta, R. Bars: Dead beat cntrller design Nvember, 4 Dead-beat cntrller design In sampled data cntrl systems the cntrller is realised by an intelligent device, typically by a PLC (Prgrammable
More informationECEN 4872/5827 Lecture Notes
ECEN 4872/5827 Lecture Ntes Lecture #5 Objectives fr lecture #5: 1. Analysis f precisin current reference 2. Appraches fr evaluating tlerances 3. Temperature Cefficients evaluatin technique 4. Fundamentals
More informationPhysics 2010 Motion with Constant Acceleration Experiment 1
. Physics 00 Mtin with Cnstant Acceleratin Experiment In this lab, we will study the mtin f a glider as it accelerates dwnhill n a tilted air track. The glider is supprted ver the air track by a cushin
More informationLecture 12: Chemical reaction equilibria
3.012 Fundamentals f Materials Science Fall 2005 Lecture 12: 10.19.05 Chemical reactin equilibria Tday: LAST TIME...2 EQUATING CHEMICAL POTENTIALS DURING REACTIONS...3 The extent f reactin...3 The simplest
More informationTEST 3A AP Statistics Name: Directions: Work on these sheets. A standard normal table is attached.
TEST 3A AP Statistics Name: Directins: Wrk n these sheets. A standard nrmal table is attached. Part 1: Multiple Chice. Circle the letter crrespnding t the best answer. 1. In a statistics curse, a linear
More informationHow do scientists measure trees? What is DBH?
Hw d scientists measure trees? What is DBH? Purpse Students develp an understanding f tree size and hw scientists measure trees. Students bserve and measure tree ckies and explre the relatinship between
More informationSPH3U1 Lesson 06 Kinematics
PROJECTILE MOTION LEARNING GOALS Students will: Describe the mtin f an bject thrwn at arbitrary angles thrugh the air. Describe the hrizntal and vertical mtins f a prjectile. Slve prjectile mtin prblems.
More informationHiding in plain sight
Hiding in plain sight Principles f stegangraphy CS349 Cryptgraphy Department f Cmputer Science Wellesley Cllege The prisners prblem Stegangraphy 1-2 1 Secret writing Lemn juice is very nearly clear s it
More informationUser Guide: Operation of ActiveAhead Mobile Application
1 (11) User Guide: Operatin f ActiveAhead Mbile Applicatin The ActiveAhead mbile applicatin allws yu t adjust the luminaire parameters f an ActiveAhead slutin. T use this applicatin yu must have an apprved
More informationLecture 13: Markov Chain Monte Carlo. Gibbs sampling
Lecture 13: Markv hain Mnte arl Gibbs sampling Gibbs sampling Markv chains 1 Recall: Apprximate inference using samples Main idea: we generate samples frm ur Bayes net, then cmpute prbabilities using (weighted)
More informationLeast Squares Optimal Filtering with Multirate Observations
Prc. 36th Asilmar Cnf. n Signals, Systems, and Cmputers, Pacific Grve, CA, Nvember 2002 Least Squares Optimal Filtering with Multirate Observatins Charles W. herrien and Anthny H. Hawes Department f Electrical
More informationTime, Synchronization, and Wireless Sensor Networks
Time, Synchrnizatin, and Wireless Sensr Netwrks Part II Ted Herman University f Iwa Ted Herman/March 2005 1 Presentatin: Part II metrics and techniques single-hp beacns reginal time znes ruting-structure
More informationIntroduction to Quantitative Genetics II: Resemblance Between Relatives
Intrductin t Quantitative Genetics II: Resemblance Between Relatives Bruce Walsh 8 Nvember 006 EEB 600A The heritability f a trait, a central cncept in quantitative genetics, is the prprtin f variatin
More informationCambridge Assessment International Education Cambridge Ordinary Level. Published
Cambridge Assessment Internatinal Educatin Cambridge Ordinary Level ADDITIONAL MATHEMATICS 4037/1 Paper 1 Octber/Nvember 017 MARK SCHEME Maximum Mark: 80 Published This mark scheme is published as an aid
More informationPhysical Layer: Outline
18-: Intrductin t Telecmmunicatin Netwrks Lectures : Physical Layer Peter Steenkiste Spring 01 www.cs.cmu.edu/~prs/nets-ece Physical Layer: Outline Digital Representatin f Infrmatin Characterizatin f Cmmunicatin
More informationECE 5318/6352 Antenna Engineering. Spring 2006 Dr. Stuart Long. Chapter 6. Part 7 Schelkunoff s Polynomial
ECE 538/635 Antenna Engineering Spring 006 Dr. Stuart Lng Chapter 6 Part 7 Schelkunff s Plynmial 7 Schelkunff s Plynmial Representatin (fr discrete arrays) AF( ψ ) N n 0 A n e jnψ N number f elements in
More informationLecture 2: Supervised vs. unsupervised learning, bias-variance tradeoff
Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeff Reading: Chapter 2 STATS 202: Data mining and analysis September 27, 2017 1 / 20 Supervised vs. unsupervised learning In unsupervised
More informationMath 105: Review for Exam I - Solutions
1. Let f(x) = 3 + x + 5. Math 105: Review fr Exam I - Slutins (a) What is the natural dmain f f? [ 5, ), which means all reals greater than r equal t 5 (b) What is the range f f? [3, ), which means all
More informationMODULE 1. e x + c. [You can t separate a demominator, but you can divide a single denominator into each numerator term] a + b a(a + b)+1 = a + b
. REVIEW OF SOME BASIC ALGEBRA MODULE () Slving Equatins Yu shuld be able t slve fr x: a + b = c a d + e x + c and get x = e(ba +) b(c a) d(ba +) c Cmmn mistakes and strategies:. a b + c a b + a c, but
More informationCHAPTER 2 Algebraic Expressions and Fundamental Operations
CHAPTER Algebraic Expressins and Fundamental Operatins OBJECTIVES: 1. Algebraic Expressins. Terms. Degree. Gruping 5. Additin 6. Subtractin 7. Multiplicatin 8. Divisin Algebraic Expressin An algebraic
More informationEASTERN ARIZONA COLLEGE Introduction to Statistics
EASTERN ARIZONA COLLEGE Intrductin t Statistics Curse Design 2014-2015 Curse Infrmatin Divisin Scial Sciences Curse Number PSY 220 Title Intrductin t Statistics Credits 3 Develped by Adam Stinchcmbe Lecture/Lab
More informationWeathering. Title: Chemical and Mechanical Weathering. Grade Level: Subject/Content: Earth and Space Science
Weathering Title: Chemical and Mechanical Weathering Grade Level: 9-12 Subject/Cntent: Earth and Space Science Summary f Lessn: Students will test hw chemical and mechanical weathering can affect a rck
More informationRevision: August 19, E Main Suite D Pullman, WA (509) Voice and Fax
.7.4: Direct frequency dmain circuit analysis Revisin: August 9, 00 5 E Main Suite D Pullman, WA 9963 (509) 334 6306 ice and Fax Overview n chapter.7., we determined the steadystate respnse f electrical
More informationActivity Guide Loops and Random Numbers
Unit 3 Lessn 7 Name(s) Perid Date Activity Guide Lps and Randm Numbers CS Cntent Lps are a relatively straightfrward idea in prgramming - yu want a certain chunk f cde t run repeatedly - but it takes a
More informationLecture 2: Supervised vs. unsupervised learning, bias-variance tradeoff
Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeff Reading: Chapter 2 STATS 202: Data mining and analysis September 27, 2017 1 / 20 Supervised vs. unsupervised learning In unsupervised
More informationBLAST / HIDDEN MARKOV MODELS
CS262 (Winter 2015) Lecture 5 (January 20) Scribe: Kat Gregry BLAST / HIDDEN MARKOV MODELS BLAST CONTINUED HEURISTIC LOCAL ALIGNMENT Use Cmmnly used t search vast bilgical databases (n the rder f terabases/tetrabases)
More informationTutorial 4: Parameter optimization
SRM Curse 2013 Tutrial 4 Parameters Tutrial 4: Parameter ptimizatin The aim f this tutrial is t prvide yu with a feeling f hw a few f the parameters that can be set n a QQQ instrument affect SRM results.
More information37 Maxwell s Equations
37 Maxwell s quatins In this chapter, the plan is t summarize much f what we knw abut electricity and magnetism in a manner similar t the way in which James Clerk Maxwell summarized what was knwn abut
More informationRevised 2/07. Projectile Motion
LPC Phsics Reised /07 Prjectile Mtin Prjectile Mtin Purpse: T measure the dependence f the range f a prjectile n initial elcit height and firing angle. Als, t erif predictins made the b equatins gerning
More informationA Scalable Recurrent Neural Network Framework for Model-free
A Scalable Recurrent Neural Netwrk Framewrk fr Mdel-free POMDPs April 3, 2007 Zhenzhen Liu, Itamar Elhanany Machine Intelligence Lab Department f Electrical and Cmputer Engineering The University f Tennessee
More information