RED BOX RULES ARE FOR PROOF STAGE ONLY. DELETE BEFORE FINAL PRINTING.
HANDBOOK OF STATISTICAL SYSTEMS BIOLOGY Editors
...
197 downloads
2380 Views
12MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
RED BOX RULES ARE FOR PROOF STAGE ONLY. DELETE BEFORE FINAL PRINTING.
HANDBOOK OF STATISTICAL SYSTEMS BIOLOGY Editors
EDITORS
Stumpf Balding Girolami
Michael P.H. Stumpf, Imperial College London, UK David J. Balding, Institute of Genetics, University College London, UK Mark Girolami, Department of Statistical Science, University College London, UK
This book: • Provides a comprehensive account of inference techniques in systems biology. • Introduces classical and Bayesian statistical methods for complex systems. • Explores networks and graphical modelling as well as a wide range of statistical models for dynamical systems. • Discusses various applications for statistical systems biology, such as gene regulation and signal transduction. • Features statistical data analysis on numerous technologies, including metabolic and transcriptomic technologies. • Presents an in-depth presentation of reverse engineering approaches. • Includes colour illustrations to explain key concepts. This handbook will be a key resource for researchers practising systems biology, and those requiring a comprehensive overview of this important field.
HANDBOOK OF STATISTICAL SYSTEMS BIOLOGY
Systems Biology is now entering a mature phase in which the key issues are characterising uncertainty and stochastic effects in mathematical models of biological systems. The area is moving towards a full statistical analysis and probabilistic reasoning over the inferences that can be made from mathematical models. This handbook presents a comprehensive guide to the discipline for practitioners and educators, in providing a full and detailed treatment of these important and emerging subjects. Leading experts in systems biology and statistics have come together to provide insight into the major ideas in the field, and in particular methods of specifying and fitting models, and estimating the unknown parameters.
Editors Michael P. H. Stumpf | David J. Balding | Mark Girolami
HANDBOOK OF STATISTICAL SYSTEMS BIOLOGY
Handbook of Statistical Systems Biology
Handbook of Statistical Systems Biology
Edited by
MICHAEL P. H. STUMPF Imperial College London, UK
DAVID J. BALDING Institute of Genetics, University College London, UK
MARK GIROLAMI Department of Statistical Science, University College London, UK
This edition first published 2011 © 2011 John Wiley & Sons, Ltd Registered office John Wiley & Sons Ltd, The Atrium, Southern Gate, Chichester, West Sussex, PO19 8SQ, United Kingdom For details of our global editorial offices, for customer services and for information about how to apply for permission to reuse the copyright material in this book please see our website at www.wiley.com. The right of the author to be identified as the author of this work has been asserted in accordance with the Copyright, Designs and Patents Act 1988. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, except as permitted by the UK Copyright, Designs and Patents Act 1988, without the prior permission of the publisher. Wiley also publishes its books in a variety of electronic formats. Some content that appears in print may not be available in electronic books. Designations used by companies to distinguish their products are often claimed as trademarks. All brand names and product names used in this book are trade names, service marks, trademarks or registered trademarks of their respective owners. The publisher is not associated with any product or vendor mentioned in this book. This publication is designed to provide accurate and authoritative information in regard to the subject matter covered. It is sold on the understanding that the publisher is not engaged in rendering professional services. If professional advice or other expert assistance is required, the services of a competent professional should be sought. Library of Congress Cataloging-in-Publication Data Stumpf, M. P. H. (Michael P. H.) Handbook of statistical systems biology / Michael P.H. Stumpf, David J. Balding, Mark Girolami. p. cm. Includes bibliographical references and index. ISBN 978-0-470-71086-9 (cloth) 1. Systems biology–Statistical methods–Handbooks, manuals, etc. 2. Biological systems–Mathematical models–Handbooks, manuals, etc. 3. Uncertainty–Mathematical models–Handbooks, manuals, etc. 4. Stochastic analysis–Mathematical models–Handbooks, manuals, etc. I. Balding, D. J. II. Girolami, Mark, 1963- III. Title. QH324.2.S79 2011 570.1’5195–dc23 2011018218
A catalogue record for this book is available from the British Library. Print ISBN: 978-0-470-71086-9 ePDF ISBN: 978-1-119-97061-3 obook ISBN: 978-1-119-97060-6 ePub ISBN: 978-1-119-95204-6 Mobi ISBN: 978-1-119-95205-3 Set in 10/12pt Times by Thomson Digital, Noida, India
Contents Preface
xvii
Contributors
xix
A
METHODOLOGICAL CHAPTERS
1
1
Two Challenges of Systems Biology
3
William S. Hlavacek
2
1.1 Introduction 1.2 Cell signaling systems 1.3 The challenge of many moving parts 1.4 The challenge of parts with parts 1.5 Closing remarks References
3 4 5 7 9 10
Introduction to Statistical Methods for Complex Systems
15
Tristan Mary-Huard and Stéphane Robin
3
2.1 2.2
Introduction Class comparison 2.2.1 Models for dependent data 2.2.2 Multiple testing 2.3 Class prediction 2.3.1 Building a classifier 2.3.2 Aggregation 2.3.3 Regularization 2.3.4 Performance assessment 2.4 Class discovery 2.4.1 Geometric methods 2.4.2 (Discrete) latent variable models 2.4.3 Inference References
15 16 16 19 22 22 25 27 29 31 31 32 33 36
Bayesian Inference and Computation
39
Christian P. Robert, Jean-Michel Marin and Judith Rousseau
3.1 3.2
Introduction The Bayesian argument 3.2.1 Bases 3.2.2 Bayesian analysis in action
39 39 39 41
vi
4
Contents
3.2.3 Prior distributions 3.2.4 Confidence intervals 3.3 Testing hypotheses 3.3.1 Decisions 3.3.2 The Bayes factor 3.3.3 Point null hypotheses 3.3.4 The ban on improper priors 3.3.5 The case of nuisance parameters 3.3.6 Bayesian multiple testing 3.4 Extensions 3.4.1 Prediction 3.4.2 Outliers 3.4.3 Model choice 3.5 Computational issues 3.5.1 Computational challenges 3.5.2 Monte Carlo methods 3.5.3 MCMC methods 3.5.4 Approximate Bayesian computation techniques Acknowledgements References
42 46 48 48 48 49 50 52 54 55 55 56 56 57 57 59 61 63 64 64
Data Integration: Towards Understanding Biological Complexity
66
David Gomez-Cabrero and Jesper Tegner
4.1
5
Storing knowledge: Experimental data, knowledge databases, ontologies and annotation 4.1.1 Data repositories 4.1.2 Knowledge Databases 4.1.3 Ontologies 4.1.4 Annotation 4.2 Data integration in biological studies 4.2.1 Integration of experimental data 4.2.2 Ontologies and experimental data 4.2.3 Networks and visualization software as integrative tools 4.3 Concluding remarks References
66 67 68 70 71 74 74 77 77 77 78
Control Engineering Approaches to Reverse Engineering Biomolecular Networks
83
Francesco Montefusco, Carlo Cosentino and Declan G. Bates
5.1
5.2
Dynamical models for network inference 5.1.1 Linear models 5.1.2 Nonlinear models Reconstruction methods based on linear models 5.2.1 Least squares 5.2.2 Methods based on least squares 5.2.3 Dealing with noise: CTLS 5.2.4 Convex optimization methods
83 84 85 89 89 90 91 97
Contents
6
vii
5.2.5 Sparsity pattern of the discrete-time model 5.2.6 Application examples 5.3 Reconstruction methods based on nonlinear models 5.3.1 Approaches based on polynomial and rational models 5.3.2 Approaches based on S-systems 5.3.3 A case-study References
100 101 104 105 107 109 111
Algebraic Statistics and Methods in Systems Biology
114
Carsten Wiuf
6.1 6.2 6.3 6.4
B 7
Introduction Overview of chapter Computational algebra Algebraic statistical models 6.4.1 Definitions 6.4.2 Further examples 6.5 Parameter inference 6.6 Model invariants 6.7 Log-linear models 6.8 Reverse engineering of networks 6.9 Concluding remarks References
114 115 116 118 118 119 122 124 126 129 130 130
TECHNOLOGY-BASED CHAPTERS
133
Transcriptomic Technologies and Statistical Data Analysis
135
Elizabeth Purdom and Sach Mukherjee
7.1 7.2
Biological background Technologies for genome-wide profiling of transcription 7.2.1 Microarray technology 7.2.2 mRNA expression estimates from microarrays 7.2.3 High throughput sequencing (HTS) 7.2.4 mRNA expression estimates from HTS 7.3 Evaluating the significance of individual genes 7.3.1 Common approaches for significance testing 7.3.2 Moderated statistics 7.3.3 Statistics for HTS 7.3.4 Multiple testing corrections 7.3.5 Filtering genes 7.4 Grouping genes to find biological patterns 7.4.1 Gene-set analysis 7.4.2 Dimensionality reduction 7.4.3 Clustering 7.5 Prediction of a biological response 7.5.1 Variable selection 7.5.2 Estimating the performance of a model References
135 136 136 137 137 139 140 140 141 142 143 145 147 147 149 150 153 153 156 157
viii
8
Contents
Statistical Data Analysis in Metabolomics
163
Timothy M. D. Ebbels and Maria De Iorio
9
8.1 8.2
Introduction Analytical technologies and data characteristics 8.2.1 Analytical technologies 8.2.2 Preprocessing 8.3 Statistical analysis 8.3.1 Unsupervised methods 8.3.2 Supervised methods 8.3.3 Metabolome-wide association studies 8.3.4 Metabolic correlation networks 8.3.5 Simulation of metabolic profile data 8.4 Conclusions Acknowledgements References
163 164 164 166 169 169 171 172 173 176 178 178 178
Imaging and Single-Cell Measurement Technologies
181
Yu-ichi Ozaki and Shinya Kuroda
10
9.1
Introduction 9.1.1 Intracellular signal transduction 9.1.2 Lysate-based assay and single-cell assay 9.1.3 Live cell and fixed cell 9.2 Measurement techniques 9.2.1 Western blot analysis 9.2.2 Immunocytochemistry 9.2.3 Flow cytometry 9.2.4 Fluorescent microscope 9.2.5 Live cell imaging 9.2.6 Fluorescent probes for live cell imaging 9.2.7 Image cytometry 9.2.8 Image processing 9.3 Analysis of signal cell measurement data 9.3.1 Time series (mean, variation, correlation, localization 9.3.2 Bayesian network modeling with single-cell data 9.3.3 Quantifying sources of cell-to-cell variation 9.4 Summary Acknowledgements References
181 181 182 182 182 183 183 184 185 187 188 190 191 194 194 197 197 197 199 199
Protein Interaction Networks and Their Statistical Analysis
200
Waqar Ali, Charlotte Deane and Gesine Reinert
10.1 10.2
Introduction Proteins and their interactions 10.2.1 Protein structure and function 10.2.2 Protein–protein interactions
200 201 201 202
Contents
10.2.3 Experimental techniques for interaction detection 10.2.4 Computationally predicted data-sets 10.2.5 Protein interaction databases 10.2.6 Error in PPI data 10.2.7 The interactome concept and protein interaction networks 10.3 Network analysis 10.3.1 Graphs 10.3.2 Network summary statistics 10.3.3 Network motifs 10.3.4 Models of random networks 10.3.5 Parameter estimation for network models 10.3.6 Approximate Bayesian Computation 10.3.7 Threshold behaviour in graphs 10.4 Comparison of protein interaction networks 10.4.1 Network comparison based on subgraph counts 10.4.2 Network alignment 10.4.3 Using functional annotation for network alignment 10.5 Evolution and the protein interaction network 10.5.1 How evolutionary models affect network alignment 10.6 Community detection in PPI networks 10.6.1 Community detection methods 10.6.2 Evaluation of results 10.7 Predicting function using PPI networks 10.8 Predicting interactions using PPI networks 10.8.1 Tendency to form triangles 10.8.2 Using triangles for predicting interactions 10.9 Current trends and future directions 10.9.1 Dynamics 10.9.2 Integration with other networks 10.9.3 Limitations of models, prediction and alignment methods 10.9.4 Biases, error and weighting 10.9.5 New experimental sources of PPI data References
ix
202 203 204 204 205 205 205 206 207 207 209 209 210 211 211 213 215 217 217 218 219 220 221 223 224 224 226 226 227 227 228 228 228
C NETWORKS AND GRAPHICAL MODELS
235
11
237
Introduction to Graphical Modelling Marco Scutari and Korbinian Strimmer
11.1 11.2
11.3 11.4
Graphical structures and random variables Learning graphical models 11.2.1 Structure learning 11.2.2 Parameter learning Inference on graphical models Application of graphical models in systems biology 11.4.1 Correlation networks 11.4.2 Covariance selection networks
237 241 242 246 246 247 247 248
x
12
Contents
11.4.3 Bayesian networks 11.4.4 Dynamic Bayesian networks 11.4.5 Other graphical models References
250 250 250 251
Recovering Genetic Network from Continuous Data with Dynamic Bayesian Networks
255
Gaëlle Lelandais and Sophie Lèbre
13
12.1
Introduction 12.1.1 Regulatory networks in biology 12.1.2 Objectives and challenges 12.2 Reverse engineering time-homogeneous DBNs 12.2.1 Genetic network modelling with DBNs 12.2.2 DBN for linear interactions and inference procedures 12.3 Go forward: how to recover the structure changes with time 12.3.1 ARTIVA network model 12.3.2 ARTIVA inference procedure and performance evaluation 12.4 Discussion and Conclusion References
255 255 256 256 256 259 261 262 263 267 268
Advanced Applications of Bayesian Networks in Systems Biology
270
Dirk Husmeier, Adriano V. Werhli and Marco Grzegorczyk
14
13.1
Introduction 13.1.1 Basic concepts 13.1.2 Dynamic Bayesian networks 13.1.3 Bayesian learning of Bayesian networks 13.2 Inclusion of biological prior knowledge 13.2.1 The ‘energy’ of a network 13.2.2 Prior distribution over network structures 13.2.3 MCMC sampling scheme 13.2.4 Practical implementation 13.2.5 Empirical evaluation on the Raf signalling pathway 13.3 Heterogeneous DBNs 13.3.1 Motivation: Inferring spurious feedback loops with DBNs 13.3.2 A nonlinear/nonhomogeneous DBN 13.3.3 MCMC inference 13.3.4 Simulation results 13.3.5 Results on Arabidopsis gene expression time series 13.4 Discussion Acknowledgements References
270 270 272 273 273 274 275 276 277 277 281 281 282 284 284 285 287 288 288
Random Graph Models and Their Application to Protein–Protein Interaction Networks
290
Desmond J. Higham and Nataˇsa Prˇzulj
14.1 14.2 14.3
Background and motivation What do we want from a PPI network? PPI network models
290 293 294
Contents
15
xi
14.3.1 Lock and key 14.3.2 Geometric networks 14.4 Range-dependent graphs 14.5 Summary References
294 297 301 305 306
Modelling Biological Networks via Tailored Random Graphs
309
Anthony C. C. Coolen, Franca Fraternali, Alessia Annibale, Luis Fernandes and Jens Kleinjung
15.1 15.2
Introduction Quantitative characterization of network topologies 15.2.1 Local network features and their statistics 15.2.2 Examples 15.3 Network families and random graphs 15.3.1 Network families, hypothesis testing and null models 15.3.2 Tailored random graph ensembles 15.4 Information-theoretic deliverables of tailored random graphs 15.4.1 Network complexity 15.4.2 Information-theoretic dissimilarity 15.5 Applications to PPINs 15.5.1 PPIN assortativity and wiring complexity 15.5.2 Mapping PPIN data biases 15.6 Numerical generation of tailored random graphs 15.6.1 Generating random graphs via Markov chains 15.6.2 Degree-constrained graph dynamics based on edge swaps 15.6.3 Numerical examples 15.7 Discussion References
D 16
DYNAMICAL SYSTEMS Nonlinear Dynamics: A Brief Introduction
309 310 310 311 312 312 313 315 315 316 317 320 320 323 323 324 325 325 327
331 333
Alessandro Moura and Celso Grebogi
17
16.1 Introduction 16.2 Sensitivity to initial conditions and the Lyapunov exponent 16.3 The natural measure 16.4 The Kolmogorov–Sinai entropy 16.5 Symbolic dynamics 16.6 Chaos in biology References
333 334 334 335 336 338 338
Qualitative Inference in Dynamical Systems
339
Fatihcan M. Atay and J¨urgen Jost
17.1 17.2
Introduction Basic solution types
339 343
xii
18
Contents
17.3 Qualitative behaviour 17.4 Stability and bifurcations 17.5 Ergodicity 17.6 Timescales 17.7 Time series analysis References
346 347 353 354 356 357
Stochastic Dynamical Systems
359
Darren J. Wilkinson
18.1 18.2
Introduction Origins of stochasticity 18.2.1 Low copy number 18.2.2 Other sources of noise and heterogeneity 18.3 Stochastic chemical kinetics 18.3.1 Reaction networks 18.3.2 Markov jump process 18.3.3 Diffusion approximation 18.3.4 Reaction rate equations 18.3.5 Modelling extrinsic noise 18.4 Inference for Markov process models 18.4.1 Likelihood-based inference 18.4.2 Partial observation and data augmentation 18.4.3 Data augmentation MCMC approaches 18.4.4 Likelihood-free approaches 18.4.5 Approximate Bayesian computation 18.4.6 Particle MCMC 18.4.7 Iterative filtering 18.4.8 Stochastic model emulation 18.4.9 Inference for stochastic differential equation models 18.5 Conclusions Acknowledgements References 19
359 359 359 360 360 360 360 364 365 365 366 366 367 368 369 370 371 371 371 372 372 373 373
Gaussian Process Inference for Differential Equation Models of Transcriptional Regulation 376 Neil Lawrence, Magnus Rattray, Antti Honkela and Michalis Titsias
19.1
Introduction 19.1.1 A simple systems biology model 19.2 Generalized linear model 19.2.1 Fitting basis function models 19.2.2 An infinite basis 19.2.3 Gaussian processes 19.2.4 Sampling approximations 19.3 Model based target ranking 19.4 Multiple tanscription factors 19.5 Conclusion References
376 377 379 380 383 385 387 387 391 393 394
Contents
20
Model Identification by Utilizing Likelihood-Based Methods
xiii
395
Andreas Raue and Jens Timmer
20.1
ODE models for reaction networks 20.1.1 Rate equations 20.2 Parameter estimation 20.2.1 Sensitivity equations 20.2.2 Testing hypothesis 20.2.3 Confidence intervals 20.3 Identifiability 20.3.1 Structural nonidentifiability 20.3.2 Practical nonidentifiability 20.3.3 Connection of identifiability and observability 20.4 The profile likelihood approach 20.4.1 Experimental design 20.4.2 Model reduction 20.4.3 Observability and confidence intervals of trajectories 20.4.4 Application 20.5 Summary Acknowledgements References
E 21
APPLICATION AREAS Inference of Signalling Pathway Models
396 397 398 399 400 401 403 403 404 405 405 406 407 407 408 413 414 415
417 419
Tina Toni, Juliane Liepe and Michael P. H. Stumpf
22
21.1 21.2 21.3
Introduction Overview of inference techniques Parameter inference and model selection for dynamical systems 21.3.1 Model selection 21.4 Approximate Bayesian computation 21.5 Application: Akt signalling pathway 21.5.1 Exploring different distance functions 21.5.2 Posteriors 21.5.3 Parameter sensitivity through marginal posterior distributions 21.5.4 Sensitivity analysis by principal component analysis (PCA) 21.6 Conclusion References
419 420 422 424 425 426 428 430 430 430 435 436
Modelling Transcription Factor Activity
440
Martino Barenco, Daniel Brewer, Robin Callard and Michael Hubank
22.1 22.2
Integrating an ODE with a differential operator Computation of the entries of the differential operator 22.2.1 Taking into account the nature of the biological system being modelled 22.2.2 Bounds choice for polynomial interpolation
441 443 443 445
xiv
23
Contents
22.3 Applications 22.4 Estimating intermediate points Acknowledgements References
447 449 450 450
Host–Pathogen Systems Biology
451
John W. Pinney
24
23.1 Introduction 23.2 Pathogen genomics 23.3 Metabolic models 23.4 Protein–protein interactions 23.5 Response to environment 23.6 Immune system interactions 23.7 Manipulation of other host systems 23.8 Evolution of the host–pathogen system 23.9 Towards systems medicine for infectious diseases 23.10 Concluding remarks Acknowledgements References
451 453 453 455 457 458 459 460 462 462 463 463
Bayesian Approaches for Mass Spectrometry-Based Metabolomics
467
Simon Rogers, Richard A. Scheltema, Michael Barrett and Rainer Breitling
25
24.1 Introduction 24.2 The challenge of metabolite identification 24.3 Bayesian analysis of metabolite mass spectra 24.4 Incorporating additional information 24.5 Probabilistic peak detection 24.6 Statistical inference 24.7 Software development for metabolomics 24.8 Conclusion References
467 468 469 471 472 473 474 475 475
Systems Biology of microRNAs
477
Doron Betel and Raya Khanin
25.1 25.2 25.3 25.4 25.5
25.6 25.7
Introduction Current approaches in microRNA Systems Biology Experimental findings and data that guide the developments of computational tools Approaches to microRNA target predictions Analysis of mRNA and microRNA expression data 25.5.1 Identifying microRNA activity from mRNA expression 25.5.2 Modeling combinatorial microRNA regulation from joint microRNA and mRNA expression data Network approach for studying microRNA-mediated regulation Kinetic modeling of microRNA regulation 25.7.1 A basic model of microRNA-mediated regulation
477 477 478 479 482 482 484 485 486 487
Contents
25.7.2 Estimating fold-changes of mRNA and proteins in microRNA transfection experiments 25.7.3 The influence of protein and mRNA stability on microRNA function 25.7.4 microRNA efficacy depends on target abundance 25.7.5 Reconstructing microRNA kinetics 25.8 Discussion References Index
xv
488 489 489 489 490 491 495
Preface
Systems biology is data-rich. Technological advances over the past 50 years have allowed us to probe, map and interfere with biological organisms in a number of ways. Most notable are perhaps the sequencing efforts that are continuing to catalogue the genetic diversity of life, including our own species. A whole host of other techniques from biochemistry, molecular, cell and structural biology have been used to study the function of the protein products and other biomolecules that are encoded by these sequences. So we live in a time with ready access to sophisticated techniques that allow us to study how biological systems – ranging from single molecules to whole organisms – function and work. But systems biology is also hypothesis-rich. By this we mean that there are an overwhelmingly large number of potential mechanisms that could explain many, if not all, biological systems. And each of these models has associated unknown parameters, most of which cannot be measured directly using experimental approaches. Systems biology is also one of the most fertile fields for modern statistics. The richness in both data and hypotheses pose serious challenges to classical statistical theory. Fisher, Neyman and Pearson and their successors typically dealt with problems where there are only a small number of hypotheses that are evaluated in light of adequate data derived from well designed experiments. The situation in systems biology could hardly be more different: in humans we have some 24 000 genes (and probably several hundred thousand protein products), but only a small number of measurements for each of these genes. A priori each of these genes (or worse, each combination of these genes) could be involved in any biological process or phenotype of interest; the number of hypotheses is vastly larger than the amount of available data. But the resulting so-called ‘large p small n problem’ and the multiple testing problem is only a small part of the problem. The lack of suitable models weighs much more heavily. Mechanistic models, framed in suitable mathematical language, allow us to summarize our knowledge about biological systems and make testable predictions, which probe our understanding. Iteration between modelling and experimental analysis will thus be required, and in the long run is believed to yield better understanding of biological systems in both health and disease. But where do these models come from? In a recent polemic, Sydney Brenner has put down the challenge, stating essentially that solving the so-called inverse problem in systems biology is doomed to fail. Given the central role that learning or inferring the structure and dynamics of biological systems has for systems biology this would amount to the long-term failure of the whole enterprise (also of synthetic biology, which cannot do without the mechanistic insights and models provided by systems biology). Rather than inferring models from data, Delbrück proposes to use maps, i.e. mathematical models that connect the different molecular entities inside cells, tissues, organs or whole organisms, to put the wealth of information collected by traditional reductionist molecular and cell biology research into context. Where these maps are coming from or how they are constructed is not clear, however. In the chapters in this handbook we hope to provide a more optimistic but also nuanced perspective on the inverse problem in systems biology. The different chapters in this handbook provide accessible accounts of basic statistical methodologies and their application in a systems biology setting. There is ample need for such a unified account. First of all, the field is progressing rapidly and technological advances have allowed researchers to gather data at a phenomenal rate. Not all data are good data, however, from a statistical or reverse-engineering perspective. The type of data collected and the manner in which they are collected can make or break any
xviii
Preface
statistical analysis. Thus some familiarity with statistical methodologies, but also the potential pitfalls will be essential for the design of better experiments and technologies. Secondly, once a model is given, mathematical analysis and exploration is relatively straightforward. But specifying the model and inferring its parameters are fraught with statistical challenges. The curse of dimensionality is encountered almost everywhere, data are noisy, incomplete and exhibit high levels of dependence and colinearity. Learning anything from such data is challenging. But the fact that biological systems change constantly with time and in response to environmental, physiological and developmental cues means that the window we have for observing a well specified system may be very small indeed. Thirdly, frequently we are dealing with mathematical models that are much more complex and challenging than those typically considered in statistics. Many nice properties of classical probability models are absent from the contingent, complex and complicated models considered in e.g. the context of metabolic networks or signal transduction networks. Moreover, a host of recent results has led us to re-evaluate our perspective on inference of parameters for dynamical systems. Being able to infer parameters is intimately related to properties of the dynamical system that include stability (of equilibrium solutions) and identifiability. These in turn, however, change with the parameters. In other words, the same dynamical systems may in effect be identifiable in some regions of parameter space but not others. To make any progress in this arena requires us to be aware of both statistics and dynamical systems theory. This brings us to the fourth point: systems biology is a highly interdisciplinary research area. None of the present practitioners has received any formal training in systems biology; instead they come from a diverse set of backgrounds ranging from mathematics, computer science, physics and the engineering sciences to biology and medicine. The different modelling and experimental approaches must be melded together in order to make progress. Since data take a central part in this dialogue, statistics must also play an essential role at this interface between traditional disciplines. This handbook aims to introduce researchers, practitioners and students to the statistical approaches that are making an impact on cutting edge systems biology research. It is born out of the editors’ belief that the inferential perspective is essential to the whole enterprise of systems biology, and that there is a lack of suitable resources for researchers in the field. We are therefore grateful to Wiley for providing us with the opportunity to develop this handbook. This would, of course, not have been possible without the cooperation of the many contributing authors. Producing comprehensive reviews and overviews over methodologies in such a rapidly moving field is challenging and may often be considered as a distraction from the work we would really like to be getting on with. We are therefore delighted and hugely grateful for the warm response that we have had from our contributors. Each chapter provides insights into some of the areas that we believe are essential for tackling inference problems in systems biology (and biomedical research more generally). Overlap between different chapters is unavoidable but rather than having resulted in redundancy or repetitiveness, these areas of overlap really serve to highlight the different perspectives and validity of alternative approaches. We are also hugely grateful to Kathryn Sharples, who helped to get this project off the ground and provided invaluable assistance in the early stages. We thank Richard Davies for his unwavering support, diligence and help in bringing the work on the handbook to fruition. He together with Heather Kay and Prachi SinhaSahay also delivered the most challenging aspect of the book by editing and proofing chapters and making a consistent whole out of the many individual contributions. Wiley and especially Kathryn, Richard, Heather and Prachi have been wonderful to work with and have accommodated the editors’ wishes and concerns with great patience and grace. M. Stumpf, D. Balding and M. Girolami
Contributors
Waqar Ali, Department of Statistics, University of Oxford, UK. Alessia Annibale, Department of Mathematics, King’s College London, The Strand, London, UK. Fatihcan M. Atay, Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany. Martino Barenco, Institute of Child Health, University College London, UK. Michael Barrett, Institute of Infection, Immunity and Inflammation, College of Medical, Veterinary and Life Sciences, University of Glasgow, UK. Declan G. Bates, College of Engineering, Mathematics and Physical Sciences, University of Exeter, UK. Doron Betel, Institute of Computational Biomedicine, Weill Cornell Medical College, New York, USA. Rainer Breitling, Institute of Molecular, Cell and Systems Biology, College of Medical, Veterinary and Life Sciences, University of Glasgow, UK. Daniel Brewer, Institute of Cancer Research, Sutton, UK. David Gomez-Cabrero, Unit of Computational Medicine, Department of Medicine, Karolinska Institutet, Stockholm, Sweden. Robin Callard, Institute of Child Health, University College London, UK. Anthony C. C. Coolen, Department of Mathematics, King’s College London, The Strand, London, and Randall Division of Cell and Molecular Biophysics, King’s College London, New Hunt’s House, London, UK. Carlo Cosentino, School of Computer and Biomedical Engineering, Università degli Studi Magna Græcia di Catanzaro, Catanzaro, Italy. Charlotte Deane, Department of Statistics, University of Oxford, UK. Timothy M. D. Ebbels, Biomolecular Medicine, Department of Surgery and Cancer, Imperial College, London, UK. Luis Fernandes, Randall Division of Cell and Molecular Biophysics, King’s College London, New Hunt’s House, London, UK. Franca Fraternali, Randall Division of Cell and Molecular Biophysics, King’s College London, New Hunt’s House, London, UK. Celso Grebogi, Institute for Complex Systems and Mathematical Biology, School of Natural and Computing Sciences, King’s College, University of Aberdeen, UK. Marco Grzegorczyk, Department of Statistics, TU Dortmund University, Dortmund, Germany. Desmond J. Higham, Department of Mathematics and Statistics, University of Strathclyde, Glasgow, UK.
xx
Contributors
William S. Hlavacek, Theoretical Division, Los Alamos National Laboratory, Los Alamos, USA. Antti Honkela, Helsinki Institute for Information Technology, University of Helsinki, Finland. Tristan Mary-Huard, AgroParisTech and INRA, Paris, France. Michael Hubank, Institute of Child Health, University College London, UK. Dirk Husmeier, Biomathematics and Statistics Scotland (BioSS) JCMB, Edinburgh, UK. Maria De Iorio, Department of Epidemiology and Biostatistics, Imperial College, St Mary’s Campus, Norfolk Place, London, UK. Jürgen Jost, Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany, and Santa Fe Institute for the Sciences of Complexity, USA. Raya Khanin, Bioinformatics Core, Memorial Sloan-Kettering Cancer Center, New York, USA. Jens Kleinjung, Divison of Mathematical Biology, MRC National Institute for Medical Research, London, UK. Shinya Kuroda, Department of Biophysics and Biochemistry, Graduate School of Science, University of Tokyo, and CREST, Japan Science and Technology Agency, University of Tokyo, Japan. Neil Lawrence, Department of Computer Science and Sheffield Institute for Translational Neuroscience, University of Sheffield, UK. Gaëlle Lelandais, DSIMB, INSERM, University of Paris Diderot and INTS, Paris, France. Juliane Liepe, Division of Molecular Biosciences, Imperial College London, UK. Sophie Lèbre, LSIIT, University of Strasbourg, France. Jean-Michel Marin, Institut de Mathematiques et Modelisation de Montpellier, Université de Montpellier 2, France. Francesco Montefusco, College of Engineering, Mathematics and Physical Sciences, University of Exeter, UK and School of Computer and Biomedical Engineering, Università degli Studi Magna Græcia di Catanzaro, Catanzaro, Italy. Alessandro Moura, Institute for Complex Systems and Mathematical Biology, School of Natural and Computing Sciences, King’s College, University of Aberdeen, UK. Sach Mukherjee, Department of Statistics, University of Warwick, Coventry, UK. Yu-ichi Ozaki, Laboratory for Cell Signaling Dynamics, RIKEN Quantitative Biology Center, Kobe, Japan. John W. Pinney, Centre for Bioinformatics, Division of Molecular Biosciences, Imperial College London, UK. Nataša Prˇzulj, Department of Computing, Imperial College London, UK. Elizabeth Purdom, Department of Statistics, University of California at Berkeley, USA. Magnus Rattray, Department of Computer Science and Sheffield Institute for Translational Neuroscience, University of Sheffield, UK.
Contributors
xxi
Andreas Raue, Institute of Physics and Freiburg Institute for Advanced Studies (FRIAS) and Centre for Biological Systems Analysis (ZBSA), University of Freiburg, Germany. Gesine Reinert, Department of Statistics, University of Oxford, UK. Christian P. Robert, Université Paris-Dauphine, CEREMADE, France, and CREST and ENSAE, Malakoff, France. Stéphane Robin, AgroParisTech and INRA, Paris, France. Simon Rogers, School of Computing Science, University of Glasgow, UK. Judith Rousseau, Université Paris-Dauphine, CEREMADE, France, and CREST and ENSAE, Malakoff, France. Richard A. Scheltema, Proteomics and Signal Transduction, Max Planck Institute for Biochemistry, Martinsried, Germany. Marco Scutari, UCL Genetics Institute (UGI), University College London, UK. Korbinian Strimmer, Institute for Medical Informatics, Statistics and Epidemiology (IMISE), University of Leipzig, Germany. Michael P. H. Stumpf, Division of Molecular Biosciences, Imperial College London, UK. Jesper Tegner, Unit of Computational Medicine, Department of Medicine, Karolinska Institutet, Stockholm, Sweden. Jens Timmer, Institute of Physics and Freiburg Institute for Advanced Studies (FRIAS) and Centre for Biological Systems Analysis (ZBSA), University of Freiburg, Germany. Michalis Titsias, School of Computer Science, University of Manchester, UK. Tina Toni, Department of Biological Engineering, Massachusetts Institute of Technology, Cambridge, USA. Adriano V. Werhli, Centro de Ciências Computacionais, Universidade Federal do Rio Grande (FURG), Rio Grande, RS, Brazil. Darren J. Wilkinson, School of Mathematics and Statistics, Newcastle University, Newcastle-upon-Tyne, UK. Carsten Wiuf, Bioinformatics Research Centre, Aarhus University, Denmark.
Part A METHODOLOGICAL CHAPTERS
1 Two Challenges of Systems Biology William S. Hlavacek Theoretical Division, Los Alamos National Laboratory, Los Alamos, USA
1.1
Introduction
Articulating the challenges faced by a field, or rather the problems that seem worthy of pursuit, can be a useful exercise. A famous example is Hilbert’s problems (Hilbert 1902), which profoundly influenced mathematics. This entire handbook can be viewed as an attempt to define challenges faced by systems biologists, especially challenges requiring a statistical approach, and to provide tools for addressing these challenges. This particular chapter provides a personal perspective. If the editors had invited someone else to write it, I am sure it would have materialized in a very different form, as there are many challenges worthy of pursuit in this field. Much has been written about systems biology, and excellent overviews of the field are available (for example, see Kitano 2002). For many years, I believe one of the challenges faced by systems biology has been community building. In recent years, thanks in part to events such as the International Conference on Systems Biology (Kitano 2001) and the q-bio Summer School and Conference (Edwards et al. 2007), a community of systems biology researchers has established itself. This community identifies with the term ‘systems biology’ and broadly agrees upon its loose definition and the general goals of the field. If one is looking for a definition of systems biology, the work presented at the meetings mentioned above serves the purpose well. A characteristic of systems biology is the systems approach, which is aided by modeling. In systems biology, there has been special interest in the study and modeling of cellular regulatory systems, such as genetic circuits (Alon 2006). This chapter will be focused on a discussion of challenges faced by modelers. Of course, modeling would be aided by technology development, the generation of new quantitative data and in other ways, but I will be concerned mainly with the practice of modeling. Moreover, I will focus on modeling of cell signaling systems, although I believe the discussion is relevant for modeling of other types of cellular regulatory systems. We need models of cellular regulatory systems to accelerate elucidation of the molecular mechanisms of cellular information processing, to understand design principles of cellular regulatory systems (i.e. the
Handbook of Statistical Systems Biology, First Edition. Edited by Michael P. H. Stumpf, David J. Balding and Mark Girolami. © 2011 John Wiley & Sons, Ltd. Published 2011 by John Wiley & Sons, Ltd.
4
Handbook of Statistical Systems Biology
relationships between system structures and functions), and ultimately, to engineer cells for useful purposes. Cell engineering encompasses a number of application areas, including manipulation of cellular metabolism for production of desirable metabolic products (Keasling 2010), such as biofuels; identification of drug targets for effective treatment or prevention of diseases (Klipp et al. 2010), such as cancer; and creation of cells with entirely new functions and properties through synthetic biology approaches (Khalil and Collins 2010). In each of these areas, predictive models can be used to guide the manipulation of cellular phenotypes through interventions at the molecular level (e.g. genetic modifications or pharmacological perturbations). In traditional engineering fields, predictive models play a central role, and I believe predictive modeling will be just as central to cell engineering efforts in the future. Another more immediate reason to seek models of cellular regulatory systems is that model-guided studies of the molecular mechanisms of cellular information processing can accelerate the pace at which these mechanisms and their design principles are elucidated (Wall et al. 2004; Alon 2006; Nov´ak and Tyson 2008; Rafelski and Marshall 2008; Mukherji and van Oudenaarden 2009). A model of a cellular regulatory system essentially represents a hypothesis about how the system operates and such a model can be used to interpret experimental observations, to design experiments, and generally to extend the reach of human intuition and reasoning. A model can be constructed in a systematic step-by-step fashion and the logical consequences of a model, no matter how complicated, can usually be determined. Although models are useful because they make predictions, models are also useful for other reasons, which are sometimes overlooked, as recently discussed by Lander (2010). It is often assumed, presumably because of the long tradition of modeling in science and engineering and the many successes of modeling (e.g. celestial modeling), that modeling of cell signaling systems should be fairly straightforward and that all the necessary tools (e.g. numerical methods and software implementations of these methods) should be more or less readily available. I do not believe that this is the case or even close to the case. I believe that predictive modeling of cell signaling systems will require the solution of unique and difficult problems and that there is much work to be done.
1.2
Cell signaling systems
Cell signaling (Hunter 2000; Scott and Pawson 2009) controls the phenotypes and fates of cells. By conveying information through a signal-initiated cascade of molecular interactions, a cell signaling system enables a cell to sense changes in its environment and respond to them. Cell signaling is mediated in large part by complex networks of interacting proteins, each of which is itself complex. A signaling protein may contain a catalytic subunit that is tightly regulated, such as a tyrosine kinase (Bradshaw 2010; Lemmon and Schlessinger 2010), as well as other functional components, including modular protein interaction domains [e.g. a Src homology 2 (SH2) domain] (Pawson and Nash 2003), short linear motifs (e.g. a proline-rich sequence that can be recognized by an SH3 domain) (Gould et al. 2010), and sites of post-translational modification (e.g. substrates of kinases and phosphatases) (Walsh et al. 2005). Many of the components of signaling proteins enable and regulate interactions with binding partners, and regulated assembly of protein complexes plays an important role in cell signaling by co-localizing enzymes and substrates, which affects both enzyme activity and specificity (Ptashne and Gann 2001). Although many of the molecular-level properties of specific cell signaling systems have been elucidated and characterized, we are only now beginning to investigate system-level properties, i.e. how the parts work together to process information (Aldridge et al. 2006; Kholodenko 2006; Kholodenko et al. 2010). A systems-level understanding of cell signaling is central to a basic understanding of cell biology. This type of understanding is also relevant for finding better treatments for a number of diseases involving dysregulation of cell signaling systems, such as cancer. The malignancy of cancer cells is driven and/or sustained in part by mutations that affect signaling proteins, many of which are the products of oncogenes and tumor
Two Challenges of Systems Biology 5
suppressor genes (Hanahan and Weinberg 2000). We can hope to reverse the effects of deleterious mutations by understanding the system-level properties of cell signaling systems (Kreeger and Lauffenburger 2010; Xu and Huang 2010). However, the complexity of cell signaling systems poses a formidable barrier to understanding and rational manipulation of system-level properties. There is a pressing need to find better ways to reason about cell signaling, so that we can relate the molecular interactions in cell signaling systems to the higher level phenomena that emerge from these interactions (Nurse 2008). Addressing this need now seems timely, given recent advances in proteomics that allow quantitative multiplex assays of the molecular states of cell signaling systems (Gstaiger and Aebersold 2009; Choudhary and Mann 2010; Kolch and Pitt 2010) and opportunities to take advantage of molecular therapeutics (Gonzalez-Angulo et al. 2010), i.e. drugs that specifically target signaling proteins, such as imatinib (Deininger et al. 2005; Hunter 2007). A fairly standard aid for reasoning about a cell signaling system is a network wiring diagram, which is used to provide a visual representation and summary of available knowledge about a system, in particular the molecules involved and their interactions. Wiring diagrams come in many forms, from simple cartoons to elaborate depictions that make use of formalized iconography (Kohn 1999; Kitano et al. 2005). A testament to the importance of wiring diagrams is the Systems Biology Graphical Notation (SBGN) project, an effort to develop standardized conventions for diagrammatic representation of biological knowledge (Le Nov`ere et al. 2009). Although diagrams are clearly useful, they lack predictive power. A more powerful aid for reasoning about a cell signaling system is a mathematical model (Kholodenko et al. 2010; Kreeger and Lauffenburger 2010; Xu and Huang 2010). Models of cell signaling systems are less commonly used and less accessible than network wiring diagrams, but modeling provides a means to cast available knowledge in a form that allows predictions to be made via computation. Once a model has been formulated, computational procedures can usually be applied to elucidate the logical consequences of the model. We can expect modeling to be useful for understanding cell signaling systems, especially given emerging capabilities in synthetic biology (Bashor et al. 2010; Gr¨unberg and Serrano 2010; Lim 2010), which present opportunities for model-guided cell engineering. However, it is becoming clear that traditional modeling approaches, such as the formalism of ordinary differential equations (ODEs), will not be entirely adequate. Modeling of cell signaling systems presents unique challenges for which new approaches are needed. Two of these challenges are discussed below.
1.3
The challenge of many moving parts
To address many interesting questions, we need large models (Hlavacek 2009). The reason is twofold. First, we need models of entire cell signaling systems and indeed models that encompass sets of connected cell signaling systems and other regulatory systems (e.g. metabolic circuits) to understand how the molecular states of cells affect their fates and phenotypes. The molecular state of a cell can be perturbed and potentially rationally manipulated. For example, pharmacological inhibition of a receptor tyrosine kinase might be used to impact cell-cycle control and reduce proliferation. However, the effect of a perturbation must generally propagate through a network of regulatory systems to bring about a change in phenotype, and these systems are rife with interconnections and feedback loops (Tyson et al. 2003; Brandman and Meyer 2008). The effects of some perturbations can be intuited. Others can be predicted with greater accuracy on the basis of simple or coarse-grained models or on the basis of mechanistically detailed but circumscribed models (Tyson and Nov´ak 2010). However, at some point, to obtain deep understanding and/or exquisite control, we will seek to develop models that are large in scope and heavy in detail. Such models may only promise minor improvements in understanding or controllability, but even minor improvements, given the potential benefits, could provide strong motivation to pursue ambitious modeling efforts. In the United States, the annual cost of treating cancer is estimated to now be greater than US $100 billion and rising (Mariotto et al. 2011). This cost could perhaps
6
Handbook of Statistical Systems Biology
be reduced and/or care could be improved with greater predictive capabilities with regard to the effects of perturbations on cell signaling. The second reason we need large models is that a cell signaling system typically comprises a large number of proteins and other signaling molecules (e.g. lipids), as well as a larger number of molecular interactions. For example, documentation of a cell signaling system in NetPath (netpath.org) includes, on average, information about >80 different molecules (counts from ‘Molecules Involved’ fields) and >150 molecular interactions (counts from ‘Physical Interactions’ and ‘Enzyme Catalysis’ fields) (Kandasamy et al. 2010). This problem can be dramatically exacerbated when one attempts to translate biological knowledge of a cell signaling system into mathematical form because the number of formal elements in a conventional, or traditional, model (e.g. variables or equations) is typically much larger than the number of molecules or interactions considered in the model. For example, a recent model encompassing only about 30 proteins is composed of nearly 500 ODEs (Chen et al. 2009). Models that are far more comprehensive than available models, such as models that couple receptor signaling to cell cycle control, can be developed, evaluated, and incrementally improved through an iterative process, including parameter estimation, experimental tests of model predictions, and model refinement. This iterative process is often discussed, but the process is difficult to implement. It will continue to be difficult to implement until certain types of resources and conventions are developed to aid modelers. In addition, methods are needed to make modeling more automatic, such as methods for data-driven model specification [for an example of inference of network structure in the context of cell signaling, see Ciaccio et al. (2010)], automated comparison of model predictions to known, formalized system properties (Batt et al. 2005; Calzone et al. 2006; Gong et al. 2010), and automated model-guided design of experiments (Bongard and Lipson 2007). The resources I have in mind would provide the type of information available at the Tyson Lab website (mpf.biol.vt.edu), where for example, one can find an impressively long list of budding yeast mutants and their cell cycle phenotypes. This collection of information, which would be time consuming to reproduce, serves to document the basis of the model of Chen et al. (2004) and also provides a set of known system properties, which can be used to validate any new model for the budding yeast cell cycle or to compare alternative models. There is a wealth of information in the primary literature about system properties, which are mostly qualitative in nature. This information could perhaps be better used by modelers to (tightly) constrain the values of parameters in models. The information available about a cell signaling system is often so abundant that only a fraction of the available information can be held in memory at a time. In fact, it may be impossible to even enter into memory all the available information. Available information must be systematized (ideally in the form of reusable and extensible models), reporting of new knowledge must be made more formal, and protocols and standardized conventions for accomplishing these tasks are needed. Translating available knowledge into formal elements of a model specification or into benchmarks for validating a model is currently a rate-limiting step in the modeling process, and it requires an unusual combination of skills. (It also requires a rare temperament.) With the adoption of conventions for reporting observed system properties, this burden could be lifted from modelers. A standard language for specifying dynamical system properties could perhaps be developed on the basis of a temporal logic (Calzone et al. 2006; Gong et al. 2010). An important element of such a language will be a capacity to represent system perturbations, such as mutations. Progress on formal representation of perturbations has been made by Danos et al. (2009). It should be noted that a common concern about the development of a large model is the difficulty of estimating the many parameters in such a model. Recently, Apgar et al. (2010) demonstrated, via an assumed ground truth model and synthetic data, that the parameters of a model can be identified via fitting to measurements from an unexpectedly small number of experiments if the experiments are well chosen and under the assumptions that model structure is correct and all variables of the model are observable in the form of time-series data. Despite these caveats, this study suggests cautious optimism. The parameters in large models may be more identifiable than conventional wisdom suggests, and new statistical methods could perhaps be
Two Challenges of Systems Biology 7
developed for better addressing the problem of parameter estimation in the the context of large models for cell signaling systems. One need in this area is the development of parameter estimation methods that respect thermodynamic constraints, which are easily enforced in the case of a small model but not so easily enforced in the case of a large model (Yang et al. 2006; Ederer and Gilles 2007, 2008; Vlad and Ross 2009; Jenkinson et al. 2010).
1.4
The challenge of parts with parts
The parts of cell signaling systems (e.g. proteins) themselves have parts (e.g. sites of post-translational modification). To faithfully represent the mechanisms of cell signaling, we need models that account for the site-specific details of molecular interactions (Hlavacek et al. 2006; Hlavacek and Faeder 2009; Mayer et al. 2009). A signaling protein is typically composed of multiple functional components or sites. Tracking information about these sites is critical for modeling the system-level dynamics of molecular interactions because protein interactions are context sensitive, i.e. they depend on site-specific details. For example, many protein– protein interactions are regulated by phosphorylation (Pawson and Kofler 2009). It is difficult to document and/or visualize the contextual dependencies of molecular interactions in a way that is both clear and precise. Online resources, such as NetPath (Kandasamy et al. 2010), Phospho.ELM (Dinkel et al. 2011) and Reactome (Matthews et al. 2009), provide (limited) information about the site-specific details of protein–protein interactions through combinations of illustrations, lists (e.g. a list of sites of phosphorylation), comments, and literature citations. It is also difficult to incorporate the site-specific details of molecular interactions into a conventional or traditional model (e.g. ODEs) (Hlavacek et al. 2003). Nevertheless, our mechanistic understanding of site-specific details is fairly advanced and such details can be monitored experimentally (Gstaiger and Aebersold 2009; Choudhary and Mann 2010; Kolch and Pitt 2010), which encourages a consolidation of this knowledge in the form of models. As mentioned above, ODEs are traditionally used to model the kinetics of (bio)chemical reaction systems, and many models of cell signaling systems take the form of a system of coupled ODEs (Kholodenko et al. 1999; Schoeberl et al. 2002). Another commonly used modeling approach involves using Gillespie’s method, or kinetic Monte Carlo (KMC), to execute a stochastic simulation of the kinetics of a given list of reactions (Gillespie 2007; Voter 2007). This approach is typically applied in preference to the ODE-based approach when one is concerned about stochastic fluctuations that arise from small population sizes (McAdams and Arkin 1999). Both approaches require a listing of the reactions that are possible and the chemical species that can be populated in a system. The approach of using ODEs to represent the kinetics of chemical reaction systems was first applied by Harcourt and Esson (1865), long before we understood how cells process information. Cell signaling systems have features that distinguish these systems from other reaction systems, such as many reaction systems of importance in the chemical processing industry. In a typical commercial reactor or test tube, there are large numbers of molecules that can populate a relatively small number of chemical species. In contrast, in a cell signaling system, because of the combinatorial potential of protein interactions, relatively small numbers of molecules populate a tiny fraction of a large, possibly astronomical or even super astronomical number of possible chemical species (Endy and Brent 2001; Bray 2003; Hlavacek et al. 2003, 2006). This feature of cell signaling systems has been called combinatorial complexity. Combinatorial complexity hinders application of traditional modeling approaches, because in these approaches, one must write an equation for each chemical species that could be populated in a system, or the equivalent. To overcome the problem of combinatorial complexity, the rule-based modeling approach has been developed (Hlavacek et al. 2006). In this approach, graphs are used to model proteins, and graph-rewriting rules are used to model protein interactions. Rules can be specified using a formal language, such as the BioNetGen language (BNGL) (Faeder et al. 2009) or Kappa (Feret et al. 2009; Harmer et al. 2010), which is closely
8
Handbook of Statistical Systems Biology
related to BNGL. The two basic ideas underlying the rule-based modeling approach are to treat molecules as the building blocks of chemical species and to model the molecular interactions that generate chemical species as rules rather than to specify a list of reactions connecting the chemical species that can be populated, which is equivalent to specifying a set of ODEs under the assumption of mass action kinetics. A rule can be viewed as implicitly defining a set of individual reactions, which involve a common transformation. A rule includes a specification of the necessary and sufficient conditions that a chemical species must satisfy to undergo a transformation defined by the rule and a rate law for the transformation. If the conditions are minimal, the number of individual reactions implied by the rule is maximal. For example, if ligand–receptor binding is independent of receptor signaling, then a rule can be specified that captures ligand–receptor interaction without considering the interaction of the receptor with cytosolic signaling proteins. However, there is no free lunch. The cost of the rule-based modeling approach is that the reactions implied by a rule are all assumed to be characterized by the same rate law. Thus, the approach relies on a coarse-grained description of reaction kinetics, because each individual reaction in a system may truly be characterized by a unique rate law. Although it is important to keep this limitation of rule-based modeling in mind, the reliance on coarse-grained reaction kinetics is not onerous, as the granularity of a rule can be adjusted as needed. At the finest level of granularity, a rule implies only a single reaction, i.e. a rule is equivalent to a reaction in the traditional sense. Thus, the rule-based modeling approach can be viewed as a generalization of conventional modeling approaches. Rule-based modeling provides a practical solution to the problem of combinatorial complexity. A number of methods for simulating rule-based models have been developed and these methods have been implemented in various software tools (Blinov et al. 2004; Lok and Brent 2005; Meier-Schellersheim et al. 2006; Moraru et al. 2008; Colvin et al. 2009, 2010; Lis et al. 2009; Mallavarapu et al. 2009; Andrews et al. 2010; Gruenert et al. 2010; Ollivier et al. 2010; Sneddon et al. 2010). A few recently developed tools are briefly discussed below to point to newly available modeling capabilities and to identify capability gaps. The tools discussed below all implement statistical methods. Once a rule-based model has been specified, it can be simulated in a number of different ways. For example, the set of ODEs for mass action kinetics corresponding to the list of reactions implied by a model can be derived from the rules of the model (Blinov et al. 2004; Faeder et al. 2005), or a smaller set of ODEs for the dynamics of collective variables can be derived from the rules (Borisov et al. 2008; Conzelmann and Gilles 2008; Koschorreck and Gilles 2008; Feret et al. 2009; Harmer et al. 2010). However, statistical methods are particularly well suited for simulation of a rule-based model, because tracking individual molecules in a stochastic simulation can be easier than tracking the population levels of chemical species in a deterministic simulation (Morton-Firth and Bray 1998; Danos et al. 2007; Yang et al. 2008; Colvin et al. 2009, 2010). The stochastic simulation compiler (SSC) of Lis et al. (2009) implements a ‘next subvolume’ method for simulation of spatial rule-based models, in which subvolumes of a reaction volume are considered to be well mixed but transport between subvolumes is included to capture the effects of diffusion. Within a subvolume, KMC is used to simulate reaction kinetics, i.e. Gillespie’s method is applied. SSC uses a constructive solid geometry approach, in which Boolean operators are used to combine primitive shapes/objects, to define surfaces and objects. A limitation of SSC is its reliance on the computationally expensive procedure of network generation, as SSC implements a ‘generate-first’ approach to simulation (Blinov et al. 2005). In this approach, a rule set is expanded into the corresponding reaction network (or equivalently, the list of reactions implied by the rules) before a simulation is performed. Network generation is expensive and impractical for many rule-based models. It is also unnecessary, as various ‘network-free’ approaches are available (Danos et al. 2007; Yang et al. 2008; Colvin et al. 2009, 2010). In these approaches, rules are used directly to advance a stochastic simulation. In fact, network-free simulation can be viewed as an extension of Gillespie’s method in which a list of reactions is replaced with a list of rules. A number of software tools implement network-free simulation methods, including DYNSTOC (Colvin et al. 2009), RuleMonkey (Colvin et al. 2010) and NFsim (Sneddon et al. 2010), which are all compliant with BNGL. None of these tools have a spatial modeling
Two Challenges of Systems Biology 9
capability, i.e. the methods implemented in DYNSTOC, RuleMonkey and NFsim all rely on the assumption of a well-mixed reaction compartment. Network-free simulation tools compliant with Kappa with similar capabilities and limitations, such as KaSim, are available at kappalanguage.org/tools. Another software tool for simulation of spatial rule-based models is Smoldyn (Andrews et al. 2010), which performs particle-based reaction-diffusion calculations. These types of calculations are well suited for dealing with complex geometrical constraints, such as a reconstructed 3D surface (Mazel et al. 2009). Smoldyn implements an ‘on-the-fly’ approach to simulation (Faeder et al. 2005; Lok and Brent 2005), which limits network generation by expanding a list of reactions as chemical species become populated during the course of a simulation. However, on-the-fly simulation still relies on network generation, and because of this, on-the-fly simulation is impractical for many rule-based models (Hlavacek et al. 2006; Yang et al. 2008). Interestingly, the network-free simulation approaches implemented in DYNSTOC, RuleMonkey, NFsim and KaSim are particle-based methods, and it should be straightforward to extend any of these methods to include molecule positions (spatial coordinates) and propagation of molecules in space, on or off a lattice. Powerful tools are available for specifying model geometry and visualizing results in 3D (Czech et al. 2009), and such tools could perhaps be coupled to rule-based simulation capabilities. Finally, I wish to call attention to the simulation capability provided by the SRSim package (Gruenert et al. 2010), which couples BNGL (Faeder et al. 2009) to LAMMPS (Plimpton 1995), a package for performing molecular dynamics (MD) calculations. The MD simulation capability provided by SRSim allows molecules and their binding sites to be modeled as patchy particles and molecular interactions to be modeled in terms of force fields. This capability could be used to study the effects of orientation constraints on molecular interactions, molecular size (i.e. volume exclusion), and both translational and rotational diffusion. A wealth of structural information is available about the modular domains of signaling proteins, other molecules involved in signaling, and biomolecular complexes (Rose et al. 2011). Structures or models for protein signaling complexes could perhaps be built and used to identify potential steric clashes and other factors that potentially impact protein–protein interactions involved in signaling. Relating such structural information to function could perhaps be aided by system-level modeling of the dynamics of protein–protein interactions. A model for a signaling complex is static, whereas assembly of a signaling complex during the course of cell signaling is dynamic. Tools such as SRSim could provide a bridge for connecting structural data available about signaling proteins to system-level dynamics of protein–protein interactions, i.e. to protein function. The study of Monine et al. (2010) provides another example, but no general-purpose software, of how structural constraints on molecular interactions can be considered within the framework of rule-based modeling.
1.5
Closing remarks
Interest in modeling of cellular regulatory systems has increased dramatically in recent years, especially interest in stochastic modeling. In 2010, the classic paper of Gillespie (1977) was cited over 300 times, which is more than the number of times the paper was cited in the 20 years before Gillespie’s method was applied by McAdams and Arkin (1997) to study gene regulation. Although modeling of cellular regulatory systems is more commonplace now than ever, the models being considered are usually small models, which also tend to incorporate little of the known mechanistic details (e.g. the site-specific details of protein–protein interactions). Much can be learned from small models, but cellular regulatory systems are large, and there are interesting questions that can be addressed with large and mechanistically detailed models. I am reminded of the saying attributed to Einstein, ‘everything should be as simple as it can be, but not simpler.’ It will not be easy to develop useful large models of cell signaling systems for a variety of reasons. One reason is that there is no biological expert available to help the ambitious modeler, who may be a physicist or mathematician by training, with formalization of the known biology. I could be wrong, but I do not
10 Handbook of Statistical Systems Biology
believe there is a person alive today who has what can be considered a complete command of the known facts about any well-studied cell signaling system. One could be discouraged by this situation or motivated by it, as the systematization of knowledge provided by a model could help us make better use of available knowledge. Another difficulty for the ambitious modeler is the lack of support that can be expected from colleagues through the peer review process. Once an ODE-based model, for example, crosses some threshold of complexity, a modeler can expect little proofreading of equations, questioning of model assumptions, or helpful suggestions on how to improve parameter estimates. This situation points to a need to develop methods for better communicating the content of large models. Finally, one should keep in mind that models should be formulated to address specific questions, not for the sake of modeling. Finding the right questions to ask, the ones that can be answered with the help of large models, is the crux of the matter. Whether, or rather when, these questions can be found will determine when large modeling efforts become commonplace in the future.
References Aldridge BB, Burke JM, Lauffenburger DA and Sorger PK 2006 Physicochemical modelling of cell signalling pathways. Nat. Cell Biol. 8, 1195–1203. Alon U 2006 An Introduction to Systems Biology: Design Principles of Biological Circuits. Chapman and Hall/CRC, Boca Raton, FL. Andrews SS, Addy NJ, Brent R and Arkin AP 2010 Detailed simulations of cell biology with Smoldyn 2.1. PLoS Comput. Biol. 6, e1000705. Apgar JF, Witmer DK, White FM and Tidor B 2010 Sloppy models, parameter uncertainty, and the role of experimental design. Mol. Biosyst. 6, 1890–1900. Bashor CJ, Horwitz AA, Peisajovich SG and Lim WA 2010 Rewiring cells: synthetic biology as a tool to interrogate the organizational principles of living systems. Annu. Rev. Biophys. 39, 515–537. Batt G, Ropers D, de Jong H, Geiselmann J, Mateescu R, Page M and Schneider D 2005 Validation of qualitative models of genetic regulatory networks by model checking: analysis of the nutritional stress response in Escherichia coli. Bioinformatics 21, i19–i28. Blinov ML, Faeder JR, Goldstein B and Hlavacek WS 2004 BioNetGen: software for rule-based modeling of signal transduction based on the interactions of molecular domains. Bioinformatics 20, 3289–3291. Blinov ML, Faeder JR, Yang J, Goldstein B and Hlavacek WS 2005 ‘On-the-fly’ or ‘generate-first’ modeling? Nat. Biotechnol. 23, 1344–1345. Bongard J and Lipson H 2007 Automated reverse engineering of nonlinear dynamical systems. Proc. Natl. Acad. Sci. USA 104, 9943–9948. Borisov NM, Chistopolsky AS, Faeder JR and Kholodenko BN 2008 Domain-oriented reduction of rule-based network models. IET Syst. Biol. 2, 342–351. Bradshaw JM 2010 The Src, Syk, and Tec family kinases: distinct types of molecular switches. Cell. Signal. 22, 1175–1184. Brandman O and Meyer T 2008 Feedback loops shape cellular signals in space and time. Science 322, 390–395. Bray D 2003 Molecular prodigality. Science 299, 1189–1190. Calzone L, Fages F and Soliman S 2006 BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge. Bioinformatics 22, 1805–1807. Chen KC, Calzone L, Csikasz-Nagy A, Cross FR, Novak B and Tyson JJ 2004 Integrative analysis of cell cycle control in budding yeast. Mol. Biol. Cell 15, 3841–3862. Chen WW, Schoeberl B, Jasper PJ, Niepel M, Nielsen UB, Lauffenburger DA and Sorger PK 2009 Input-output behavior of ErbB signaling pathways as revealed by a mass action model trained against dynamic data. Mol. Syst. Biol. 5, 239. Choudhary C and Mann M 2010 Decoding signalling networks by mass spectrometry-based proteomics. Nat. Rev. Mol. Cell Biol. 11, 427–439. Ciaccio MF, Wagner JP, Chuu CP, Lauffenburger DA, and Jones RB 2010 Systems analysis of EGF receptor signaling dynamics with microwestern arrays. Nat. Methods 7, 148–155.
Two Challenges of Systems Biology 11 Conzelmann H and Gilles ED 2008 Dynamic pathway modeling of signal transduction networks: a domain-oriented approach. Methods Mol. Biol. 484, 559–578. Colvin J, Monine MI, Faeder JR, Hlavacek WS, Von Hoff DD and Posner RG 2009 Simulation of large-scale rule-based models. Bioinformatics 25, 910–917. Colvin J, Monine MI, Gutenkunst RN, Hlavacek WS, Von Hoff DD and Posner RG 2010 RuleMonkey: software for stochastic simulation of rule-based models. BMC Bioinformatics 11, 404. Czech J, Dittrich M and Stiles JR 2009 Rapid creation, Monte Carlo simulation, and visualization of realistic 3D cell models. Methods Mol. Biol. 500, 237–287. Danos V, Feret J, Fontana W and Krivine J 2007 Scalable simulation of cellular signaling networks. Lect. Notes Comput. Sci. 4807, 139–157. Danos V, Feret J, Fontana W, Harmer R and Krivine J 2009 Rule-based modelling and model perturbation. Lect. Notes Comput. Sci. 5750, 116–137. Deininger M, Buchdunger E and Druker BJ 2005 The development of imatinib as a therapeutic agent for chronic myeloid leukemia. Blood 105, 2640–2653. Dinkel H, Chica C, Via A, Gould CM, Jensen LJ, Gibson TJ and Diella F 2011 Phopho.ELM: a database of phosphorylation sites—update 2011. Nucleic Acids Res. 39, D261–D267. Ederer M and Gilles ED 2007 Thermodynamically feasible kinetic models of reaction networks. Biophys. J. 92, 1846– 1857. Ederer M and Gilles ED 2008 Thermodynamic constraints in kinetic modeling: thermodynamic-kinetic modeling in comparison to other approaches. Eng. Life Sci. 8, 467–476. Edwards JS, Faeder JR, Hlavacek WS, Jiang Y, Nemenman I and Wall ME 2007 q-bio 2007: a watershed moment in modern biology. Mol. Syst. Biol. 3, 148. Endy D and Brent R 2001 Modelling cellular behaviour. Nature 409, 391–395. Faeder JR, Blinov ML, Goldstein B and Hlavacek WS 2005 Rule-based modeling of biochemical networks. Complexity 10, 22–41. Faeder JR, Blinov ML and Hlavacek WS 2009 Rule-based modeling of biochemical systems with BioNetGen. Methods Mol. Biol. 500, 113–167. Feret J, Danos V, Krivine J, Harmer R and Fontana W 2009 Internal coarse-graining of molecular systems. Proc. Natl. Acad. Sci. USA 106, 6453–6458. Gillespie DT 1977 Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81, 2340–2361. Gillespie DT 2007 Stochastic simulation of chemical kinetics. Annu. Rev. Phys. Chem. 58, 35–55. Gonzalez-Angulo AM, Hennessy BT and Mill GB 2010 Future of personalized medicine in oncology: a systems biology approach. J. Clin. Oncol. 28, 2777–2783. Gong H, Zuliani P, Komuravelli A, Faeder JR and Clarke EM 2010 Analysis and verification of the HMGB1 signaling pathway. BMC Bioinformatics 11, S10. Gould CM, Diella F, Via A, Puntervoll P, Gem¨und C, Chabanis-Davidson S, Michael S, Sayadi A, Bryne JC, Chica C, Seiler M, Davey NE, Haslam N, Weatheritt RJ, Budd A, Hughes T, Pas J, Rychlewski L, Trav´e G, Aasland R, Helmer-Citterich M, Linding R and Gibson TJ 2010 ELM: the status of the 2010 eukaryotic linear motif resource. Nucleic Acids Res. 38, D167–D180. Gruenert G, Ibrahim B, Lenser T, Lohel M, Hinze T and Dittrich P 2010 Rule-based spatial modeling with diffusing, geometrically constrained molecules. BMC Bioinformatics 11, 307. G¨unberg R and Serrano L 2010 Strategies for protein synthetic biology. Nucleic Acids Res. 38, 2663–2675. Gstaiger M and Aebersold R 2009 Applying mass spectrometry-based proteomics to genetics, genomics and network biology. Nat. Rev. Genet. 10, 617–627. Hanahan D and Weinberg RA 2000 The hallmarks of cancer. Cell 100, 57–70. Harcourt AV and Esson W 1865 On the laws of connexion between the conditions of a chemical change and its amount. Proc. R. Soc. 14, 470–474. Harmer R, Danos V, Feret J, Krivine J and Fontana W 2010 Intrinsic information carriers in combinatorial dynamical systems. Chaos 20, 037108. Hilbert D 1902 Mathematical problems. Bull. Am. Math. Soc. 8, 437–479. Hlavacek WS 2009 How to deal with large models? Mol. Syst. Biol. 5, 240.
12 Handbook of Statistical Systems Biology Hlavacek WS and Faeder JR 2009 The complexity of cell signaling and the need for a new mechanics. Sci. Signal. 2, pe46. Hlavacek WS, Faeder JR, Blinov ML, Perelson AS and Goldstein B 2003 The complexity of complexes in signal transduction. Biotechnol. Bioeng. 84, 783–794. Hlavacek WS, Faeder JR, Blinov ML, Posner RG, Hucka M and Fontana W 2006 Rules for modeling signal-transduction systems. Sci. STKE 2006, re6. Hunter T 2000 Signaling—2000 and beyond. Cell 100, 113–127. Hunter T 2007 Treatment for chronic myelogenous leukemia: the long road to imatinib. J. Clin. Invest. 117, 2036–2043. Jenkinson G, Zhong X and Goutsias J 2010 Thermodynamically consistent Bayesian analysis of closed biochemical reaction systems. BMC Bioinformatics 11, 547. Kandasamy K, Mohan SS, Raju R, Keerthikumar S, Sameer Kumar GS, Venugopal AK, Telikicherla D, Navarro JD, Mathivanan S, Pecquet C, Kanth Gollapudi S, Gopal Tattikota S, Mohan S, Padhukasahasram H, Subbannayya Y, Goel R, Jacob HKC, Zhong J, Sekhar R, Nanjappa V, Balakrishnan L, Subbaiah R, Ramachandra YL, Abdul Rahiman B, Keshava Prasad TS, Lin JX, Houtman JCD, Desiderio S, Renauld JC, Constantinescu SN, Ohara O, Hirano T, Kubo M, Singh S, Khatri P, Draghici S, Bader GD, Sander C, Leonard WJ and Pandey A 2010 NetPath: a public resource of curated signal transduction pathways. Genome Biol. 11, R3. Keasling JD 2010 Manufacturing molecules through metabolic engineering. Science 330, 1355–1358. Khalil AS and Collins JJ 2010 Synthetic biology: applications come of age. Nat. Rev. Genet. 11, 367–379. Kholodenko BN, Demin OV, Moehren G and Hoek JB 1999 Quantification of short term signaling by the epidermal growth factor receptor. J. Biol. Chem. 274, 30169–30181. Kholodenko BN 2006 Cell-signalling dynamics in time and space. Nat. Rev. Mol. Cell Biol. 7, 165–176. Kholodenko BN, Hancock JF and Kolch W 2010 Signalling ballet in space and time. Nat. Rev. Mol. Cell Biol. 11, 414–426. Kitano H (ed.) 2001 Foundations of Systems Biology. MIT Press, Cambridge, MA. Kitano H 2002 Systems biology: a brief overview. Science 295, 1662–1664. Kitano H, Funahashi A, Matsuoka Y and Oda K 2005 Using process diagrams for the graphical representation of biological networks. Nat. Biotechnol. 23, 961–966. Klipp E, Wade RC and Kummer U 2010 Biochemical network-based drug-target prediction. Curr. Opin. Biotechnol. 21, 511–516. Kohn KW 1999 Molecular interaction map of the mammalian cell cycle control and DNA repair systems. Mol. Biol. Cell 10, 2703–2734. Kolch W and Pitt A 2010 Functional proteomics to dissect tyrosine kinase signalling pathways in cancer. Nat. Rev. Cancer 10, 618–629. Koschorreck M and Gilles ED 2008 ALC: automated reduction of rule-based models. BMC Syst. Biol. 2, 91. Kreeger PK and Lauffenburger DA 2010 Cancer systems biology: a network modeling perspective. Carcinogenesis 31, 2–8. Lander AD 2010 The edges of understanding. BMC Biol. 8, 40. Lemmon MA and Schlessinger J 2010 Cell signaling by receptor tyrosine kinases. Cell 141, 1117–1134. Le Nov`ere N, Hucka M, Mi H, Moodie S, Schreiber F, Sorokin A, Demir E, Wegner K, Aladjem MI, Wimalaratne SM, Bergman FT, Gauges R, Ghazal P, Kawaji H, Li L, Matsuoka Y, Villeger A, Boyd SE, Calzone L, Courtot M, Dogrusoz U, Freeman TC, Funahashi A, Ghosh S, Jouraku A, Kim S, Kolpakov F, Luna A, Sahle S, Schmidt E, Watterson S, Wu G, Goryanin I, Kell DB, Sander C, Sauro H, Snoep JL, Kohn K and Kitano H 2009 The systems biology graphical notation. Nat. Biotechnol. 27, 735–741. Lim WA 2010 Designing customized cell signalling circuits. Nat. Rev. Mol. Cell Biol. 11, 393–403. Lis M, Artyomov MN, Devadas S and Chakraborty AK 2009 Efficient stochastic simulation of reaction-diffusion processes via direct compilation. Bioinformatics 25, 2289–2291. Lok L and Brent R 2005 Automatic generation of cellular reaction networks with Moleculizer 1.0. Nat. Biotechnol. 23, 131–136. Mallavarapu A, Thomson M, Ullian B and Gunawardena J 2009 Programming with models: modularity and abstraction provide powerful capabilities for systems biology. J. R. Soc. Interface 6, 257–270.
Two Challenges of Systems Biology 13 Mariotto AB, Robin Yabroff K, Shao Y, Feuer EJ and Brown ML 2011 Projections of the cost of cancer care in the United States: 2010–2020. J. Natl. Cancer Inst. 103, 117–128. Matthews L, Gopinath G, Gillespie M, Caudy M, Croft D, de Bono B, Garapati P, Hemish J, Hermjakob H, Jassal B, Kanapin A, Lewis S, Mahajan S, May B, Schmidt E, Vastrik I, Wu G, Birney E, Stein L and D’Eustachio P 2009 Reactome knowledge base of human biological pathways and processes. Nucleic Acids Res. 37, D619–D622. Mayer BJ, Blinov ML and Loew LM 2009 Molecular machines or pleiomorphic ensembles: signaling complexes revisited. J. Biol. 8, 81. Mazel T, Raymond R, Raymond-Stintz M, Jett S and Wilson BS 2009 Stochastic modeling of calcium in 3D geometry. Biophys. J. 96, 1691–1706. McAdams HH and Arkin A 1997 Stochastic mechanisms in gene expression. Proc. Natl. Acad. Sci. USA 94, 814–819. McAdams HH and Arkin A 1999 It’s a noisy business! Genetic regulation at the nanomolar scale. Trends Genet. 15, 65–69. Meier-Schellersheim M, Xu K, Angermann B, Kunkel EJ, Jin T and Germain RN 2006 Key role of local regulation in chemosensing revealed by a new molecular interaction-based modeling method. PLoS Comput. Biol. 2, e82. Monine MI, Posner RG, Savage PB, Faeder JR and Hlavacek WS 2010 Modeling multivalent ligand-receptor interactions with steric constraints on configurations of cell-surface receptor aggregates. Biophys. J. 96, 48–56. Moraru II, Schaff JC, Slepchenko BM, Blinov ML, Morgan F, Lakshminarayana A, Gao F, Li Y and Loew LM 2008 Virtual Cell modelling and simulation software environment. IET Syst. Biol. 2, 352–362. Morton-Firth CJ and Bray D 1998 Predicting temporal fluctuations in an intracellular signalling pathway. J. Theor. Biol. 192, 117–128. Mukherji S and van Oudenaarden A 2009 Synthetic biology: understanding biological design from synthetic circuits. Nat. Rev. Genet. 10, 859–871. Nov´ak B and Tyson JJ 2008 Design principles of biochemical oscillators. Nat. Rev. Mol. Cell Biol. 9, 981–991. Nurse P 2008 Life, logic and information. Nature 454, 424–426. Ollivier JF, Shahrezaei V and Swain PS 2010 Scalable rule-based modelling of allosteric proteins and biochemical networks. PLoS Comput. Biol. 6, e1000975. Pawson T and Kofler M 2009 Kinome signaling through regulated protein–protein interactions in normal and cancer cells. Curr. Opin. Cell Biol. 21, 147–153. Pawson T and Nash P 2003 Assembly of cell regulatory systems through protein interaction domains. Science 300, 445–452. Plimpton SJ 1995 Fast parallel algorithms for short-range molecular dynamics. J. Comput. Phys. 117, 1–19. Ptashne M and Gann A 2001 Genes & Signals. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, NY. Rafelski SM and Marshall WF 2008 Building the cell: design principles of cellular architecture. Nat. Rev. Mol. Cell Biol. 9, 593–602. Rose PW, Beren B, Bi C, Bluhm WF, Dimitropoulos D, Goodsell DS, Prli´c A, Quesada M, Quinn GB, Westbrook JD, Young J, Yukich B, Zardecki C, Berman HM and Bourne PE 2011 The RCSB Protein Data Bank: redesigned web site and web services. Nucleic Acids Res. 39, D392–D401. Schoeberl B, Eichler-Jonsson C, Gilles ED and M¨uller G 2002 Computational modeling of the dynamics of the MAP kinase cascade activated by surface and internalized EGF receptors. Nat. Biotechnol. 20, 370–375. Scott JD and Pawson T 2009 Cell signaling in space and time: where proteins come together and when they’re apart. Science 326, 1220–1224. Sneddon MW, Faeder JR and Emonet T 2010 Efficient modeling, simulation and coarse-graining of biological complexity with NFsim. Nat. Methods doi:10.1038/nmeth.1546. Tyson JJ and Nov´ak B 2010 Functional motifs in biochemical reaction networks. Annu. Rev. Phys. Chem. 61, 219–240. Tyson JJ, Chen KC and Novak B 2003 Sniffers, buzzers, toggles and blinkers: dynamics of regulatory and signaling pathways in the cell. Curr. Opin. Cell Biol. 15, 221–231. Vlad MO and Ross J 2009 Thermodynamically based constraints for rate coefficients of large biochemical networks. WIREs Syst. Biol. Med. 1, 348–358. Voter AF 2007 Introduction to the kinetic Monte Carlo method. In Radiation Effects in Solids (eds Sickafus KE, Kotomin EA, and Uberuaga BP), pp. 1–23. Springer, Dordrecht. Wall ME, Hlavacek WS and Savageau MA 2004 Design of gene circuits: lessons from bacteria. Nat. Rev. Genet. 5, 34–42.
14 Handbook of Statistical Systems Biology Walsh CT, Garneau-Tsodikova S and Gatto Jr GJ 2005 Protein posttranslational modifications: the chemistry of proteome diversifications. Angew. Chem. Int. Ed. Engl. 44, 7342–7372. Xu AM and Huang PH 2010 Receptor tyrosine kinase coactivation networks in cancer. Cancer Res. 70, 3857–3860. Yang J, Bruno WJ, Hlavacek WS and Pearson JE 2006 On imposing detailed balance in complex reaction mechanisms. Biophys. J. 91, 1136–1141. Yang J, Monine MI, Faeder JR and Hlavacek WS 2008 Kinetic Monte Carlo method for rule-based modeling of biochemical networks. Phys. Rev. E 78, 031910.
2 Introduction to Statistical Methods for Complex Systems Tristan Mary-Huard and St´ephane Robin AgroParisTech and INRA, Paris, France
2.1
Introduction
The aim of the present chapter is to introduce and illustrate some concepts of statistical inference useful in systems biology. Here we limit ourselves to the classical, so-called ‘frequentist’ statistical inference where parameters are fixed quantities that need to be estimated. The Bayesian approach will be presented in Chapter 3. Modelling and inference techniques are illustrated in three recurrent problems in systems biology: Class comparison aims at assessing the effect of some treatment or experimental condition on some biological response. This requires proper statistical modelling to account for the experimental design, various covariates or stratifications or dependence between the measurements. As systems biology often deals with high-throughput technologies, it also raises multiple testing issues. Class prediction refers to learning techniques that aim at building a rule to predict the status (e.g. well or ill) of an individual, based on a set of biological descriptors. An exhaustive list of classification algorithms is out of reach, but general techniques such as regularization or aggregation are of prime interest in systems biology where the number of variables often exceeds the number of observations by far. Evaluating the performances of a classifier also requires relevant tools. Class discovery aims at uncovering some structure in a set of observations. These techniques include distancebased or model-based clustering methods and allow to determine distinct groups of individuals in the absence of a prior classification. However, the underlying structure may have more complex forms, each raising specific issues in terms of inference. This chapter focuses on generic statistical concepts and methods, that can be applied no matter which technology is used for the data acquisition. In practice, applications to any biological problem will necessitate Handbook of Statistical Systems Biology, First Edition. Edited by Michael P. H. Stumpf, David J. Balding and Mark Girolami. © 2011 John Wiley & Sons, Ltd. Published 2011 by John Wiley & Sons, Ltd.
16 Handbook of Statistical Systems Biology
both a relevant strategy for the data collection, and a careful tuning of the methods to obtain meaningful results. These two steps of data collection (or experimental design conception) and adaptation of the generic methods require taking into account the nature of the data. Therefore, they are dependent on the data acquisition technology, and will be discussed in Part B of this Handbook. In this chapter, the data are assumed to arise from a static process. The analysis of a dynamic biological system would require more sophisticated methods, such as partial differential equations or network modelling. These topics are not discussed here as they will be reviewed in depth in Parts C and D. Lastly, a basic knowledge in statistics is assumed, covering topics including point estimation (in particular maximum likelihood estimation), hypothesis testing, and a background in regression and linear models.
2.2
Class comparison
We consider here the general problem of assessing the effect of some treatment, experimental condition or covariate on some response. We first address the problem of modelling the data resulting from the experiments, focusing on how to account for the dependency between the observations. We then turn to the problem of multiple testing, which is recurrent in high-throughput data analyses. 2.2.1
Models for dependent data
Many biological experiments aim at observing the effects of a given treatment (or combination of treatments) on a given response. ‘Treatment’ is used here in a very broad sense, including controlled experimental conditions, uncontrolled covariates, time, population structure, etc. In the following n will stand for the total number of experiments. Linear (Gaussian) models (Searle 1971; Dobson 1990) provide a general framework to describe the influence of a set of controlled conditions and/or uncontrolled covariates, summarized in a n × p-dimensional matrix X, on the observed response gathered in a n-dimensional vector Y as Y = Xθ + E
(2.1)
where θ is the p-dimensional vector containing all parameters. In the most classical setting, the response is supposed to be Gaussian, and the dependency structure between the observations is then fully specified by the (co-)variance matrix = V(Y) = V(E) which contains the variance of each observation on the diagonal, and the covariances between pairs of observations elsewhere. In the most simple setting, the responses are supposed to be independent with same variance σ 2 , that is = σ 2 I. 2.2.1.1
Writing the right (mixed) model
In more complex experiments, the assumption that observations are independent does not hold and the structure of needs to be adapted. Because it contains n(n + 1)/2 parameters, the shape of has to be strongly constrained to allow good inference. We first present here some typical experimental settings, and the associated dependency structures. Variance Components Consider the study of the combined effects of the genotype (indexed by i) and of the cell type (k) on some gene expression. Several individuals (j) from each genotype are included and cells from each type are harvested in each of them. In such a setting the expected response is E(Yijk ) = μik , which is often decomposed into a genotype effect, a cell type effect and an interaction as μik = μ + αi + βk + (αβ)ik .
Statistical Methods for Complex Systems
17
The most popular way to account for the dependency between measures obtained on the same individual is to add a random term Uij associated with each individual. The complete model can then be written as Yijk = μik + Uij + Eijk
(2.2)
where all Uij and Eijk are independent centred Gaussian variables with variance σU2 and σE2 , respectively. The variance of one observation is then σ 2 = σU2 + σE2 , where σU2 is the ‘biological’ variance and σE2 is the ‘technical’ one (Kerr and Churchill 2001). The random effect induces a uniform correlation between observations from the same individual since: Cov(Yijk , Yi j k ) = σU2
if
(ij) = (i j ),
k= / k
(2.3)
and 0 if (ij) = / (i j ). The matrix form of this model is a generalization of (2.1): Y = Xθ + ZU + E
(2.4)
where Z describes the individual structure: each row corresponds to one measurement and each column to one individual and Z contains a 1 at the intersection if the measurement has been made on the individual, and a 0 otherwise. The denomination ‘mixed’ of ‘linear mixed models’ comes from the simultaneous presence of fixed (θ) and random (U) effects. It corresponds to the simplest form of so-called ‘variance components’ models. The variance matrix corresponding to (2.3) is = σU2 ZZ + σE2 I. Application of such a model to gene expression data can be found in Wolfinger et al. (2001) or Tempelman (2008). Repeated Measurements One considers a similar design where, in place of cell types, we compare successive harvesting times (indexed by t) within each individual. The uniform correlation within each individual given in (2.3) may then seem inappropriate, for it does not account for the delay between times of observation. A common dependency form is then the so-called ‘autoregressive’, which states that
Cov(Yijt , Yi j t ) = σ 2 ρ−|t−t |
if
(ij) = (i j )
and 0 otherwise. This is to assume that the correlation decreases (at an exponential rate) with the time delay. Such a variance structure cannot be put in a simple matrix form similar to (2.4). Note that Equation (2.1) is still valid, but with nondiagonal variance matrix = V(E). Spatial Dependency It is also desirable to account for spatial dependency when observations have some spatial localization. Suppose one wants to compare treatments (indexed by i), and that replicates (j) have respective localizations ij . A typical variance structure (Cressie 1993) is V(Yij ) = σ 2 = σS2 + σE2 , Cov(Yij , Yi j ) = σS2 ρ−ij −i j where σE2 accounts for the measurement error variability and ρ controls the speed at which the dependency decreases with distance. The dependency structures described above can of course be combined. Also note that this list is far from exhaustive. The limitations often come from the software at hand or the specific computing developments that can be made. A large catalogue of such structures can be found in software such as SAS (2002–03) or R (www.r-project.org).
18 Handbook of Statistical Systems Biology
2.2.1.2
Inference
Some problems related to the inference of mixed linear models are still unresolved. We only provide here an introduction to the most popular approaches and emphasize some practical issues that can be faced when using them. Estimation Mixed model inference requires to estimate both θ and . We start with the estimation of , which reduces to the estimation of a few variance parameters such as σ 2 , σU2 , σE2 , σS2 , ρ in the examples given above. Moment estimates can be obtained (Searle 1971; Demindenko 2004), typically for variance component models. Such estimates are often based on sums of squares, that are squared distances between Y and its projection on various linear spaces, such as span(X), span(Z) or span(X, Z). The expectation of these sums of squares can often be related to the different variance parameters and the estimation then reduces to solving a set of linear equations. The maximum likelihood (ML) estimator is defined as ML = arg max log P(Y; θ, )
and can be used for all models. Unfortunately, ML variance estimates are known to be biased in many (almost all) situations, because both θ and have to be estimated at the same time. The most popular way to circumvent this problem consists of changing to a model where θ is known (Verbeke and Molenberghs 2000). Defining = TY which satisfies some matrix T such that TX = 0, we may define the Gaussian vector Y =0 E(Y)
= TT . V(Y)
and
The most natural choice for T is the projector on the linear space orthogonal to span(X). The so-called ‘restricted’ maximum likelihood (ReML) of is then defined as ). ReML = arg max log P(Y;
Note that ReML estimates are ML estimates and therefore inherit all their properties (consistency, asymptotic normality). Also note that ReML provides less biased variance estimates than ML. The ReML estimates can be shown to be unbiased only for some specific cases such as orthogonal designs where they are equivalent to moment estimates. The estimates of θ (and the variance of this estimator) are the same for ML and generalized least squares (Searle 1971): −1 X)−1 X −1 Y, θ = (X
−1 X)−1 . V( θ) = (X
described above. However, These estimates are often calculated with a simple plug-in of one of the estimates as it relies on the shape of specified in the model, such an estimator of V( θ) is not robust to a misspecification of the dependency structure. Alternative estimators such as the ‘sandwich’ estimator can be defined, that are both consistent and robust (Diggle et al. 2002). Tests As many experiments aim to assess the significance of a given effect, we are often interested in testing the hypothesis H0 stating that the corresponding contrast between the elements of θ is null. The global procedure is similar to that of model (2.1): writing the contrast under study as a linear combination of the parameters c θ, we get the usual test statistic: c V( (2.5) θ T = c θ)c ≈ Tν . H0
Statistical Methods for Complex Systems
19
A central practical issue is the determination of the (approximate) degree of freedom of the Student’s t distribution as it depends on both the experimental design and the contrast itself. As an example, in model (2.2), we first consider the average difference between genotype i and i : μi• − μi • that is estimated by Yi•• − Yi •• (the notation ‘•’ means that the variables are averaged over the index it replaces) (Searle 1971). We then consider the difference between two cell types k and k is μ•k − μ•k and its estimate Y••k − Y••k . If the design is completely balanced with I genotypes, J individuals per genotype and K cell types within each individual, the respective variances of these estimates are i • ) = (2σU2 /J) + (2σE2 /JK), V( μi• − μ •k ) = 2σE2 /IJ. V( μ•i − μ We see here that the biological variance σU2 does not affect the contrast on the cell types (that are harvested within each individual) whereas it is predominant for the genotype contrast, which refers to differences between the individuals. The distribution of the test statistics is Student in both cases, but with different degrees of freedom: IJ − I for the genotype and IJK − IK for the cell types. The intuition is that the number of observations is the number of individuals IJ for the genotype, whereas it is the total number of measures IJK for the cell type. Hence, in such a design the power will be (much) greater for distinguishing cell types than genotypes. For more complex dependency structures such as repeated measurements or spatial data, the distribution of (2.5) is only approximated and the degrees of freedom ν need to be approximated (Fai and Cornelius 1996; Kenward and Roger 1997; Khuri et al. 1998). 2.2.1.3
Generalized Linear Mixed Models
Observations cannot always be modelled with a Gaussian distribution. The linear model can however easily be generalized to most usual distributions such as binomial, Poisson, Gamma, etc., giving rise to the ‘generalized’ linear model (Dobson 1990; Demindenko 2004; Zuur et al. 2009). A key ingredient is the introduction of a ‘link function’ g between the expectation of the responses and the linear model as g(EY) = Xθ. For non Gaussian models, a canonical parametrization of the correlation between the observations does not always exist. A specific modelling of the dependency is then required. As an example, in the Poisson case, the variance components model (2.4) will typically be rewritten as g[E(Y|U)] = Xθ + ZU where g is the log function and the coordinates of U are independent Gamma distributed variables. However the Gaussian modelling can be re-used in all generalized linear models, stating that g[E(Y|V)] = Xθ + V, where V is a centred Gaussian vector with variance matrix similar to those seen above in the Gaussian context. 2.2.2
Multiple testing
Models such as those described in the preceding section allow to assess or reject the existence of some effect on a given response. They typically allow to assess whether a given gene is differentially expressed between several conditions in microarray experiments, accounting for possible covariates and dependency between the replicates. Because of the large number of genes spotted on each microarray, we are then faced with a multiple testing since we get one test statistic Ti similar to (2.5) for each of the genes. This example has become common place (Dudoit et al. 2003), but similar issues are encountered in SNP studies, QTL detection and mass spectrometry, that is in all statistical analyses dealing with high-throughput technologies.
20 Handbook of Statistical Systems Biology
2.2.2.1
The basic problem
One Test Setting We first consider hypothesis Hi that states that the expression level of gene i is not affected by the treatment under study. To assess Hi , a test statistic Ti is calculated from the observations such that a large value of Ti will lead to reject Hi (gene i is then said to be ‘differentially expressed’). More precisely, denoting the cumulative distribution function (c.d.f.) of Ti if Hi holds, we calculate a p-value defined as Pi = 1 − (Ti ) and reject Hi if Pi is below a pre-specified level t. Pi measures the significance of the test and t is the level of the test, that is the risk (probability) to reject Hi whereas it is true. When testing one hypothesis at a time, t is generally set to 1% or 5%. Multiple Testing Now consider m null hypotheses H1 , . . . , Hm . Suppose that among these m hypotheses, m0 actually hold. For a given level t, denote FP(t) the number of false positives, that is the number of tests i for which Hi actually holds, whereas Pi falls below t. The expected number of false positives is E[FP(t)] = m0 t. This number can exceed several hundreds when m0 reaches 104 or 106 , as in microarray or SNP analyses. The primary goal of a multiple testing procedure (MTP) is to keep this number of false positives small, by tuning the threshold t. Distribution of the p-Value Most MTPs apply to the set of p-values P1 , . . . , Pm and the control of FP(t) relies essentially on their distribution. If Hi is true, we have Ti ∼
⇒
Pi ∼ U[0;1] ,
which means that, when Hi holds, Pi is uniformly distributed over the interval [0; 1]. As we shall see, this property is one of the key ingredients of all MTPs. It is therefore highly recommended to make a graphical check of it by simply plotting the histogram of the Pi s: it should show a peak close to 0 (corresponding to truly differentially expressed genes associated with small Pi s) and a uniform repartition along the rest of the interval [0, 1] [see Figure 2.1(a)]. 2.2.2.2
Global risk
Because FP(t) is random, an MTP aims at controlling some characteristic of its distribution. Such a characteristic can be viewed as a global risk since it considers all the tests at the same time. Our goal is to maintain it at some pre-specified value α. We assume that m0 is known; if not, it can be either estimated or replaced by a surrogate (see later). Family-Wise Error Rate (FWER)
The most drastic approach is to keep FP(t) close to 0, that is to make FWER = Pr{FP > 0}
small. The goal is then to find the right level t to guarantee a targeted FWER α. When all tests are assumed to be independent, FP(t) has a binomial B(m0 , t) distribution so FWER = 1 − (1 − t)m0 = α
⇐⇒
t = 1 − (1 − α)1/m0 .
This MTP is known as the Sidak procedure. When independence is not assumed, FWER can be upper bounded via the Bonferroni inequality which leads to FWER ≤ m0 t = α
⇐⇒
t = α/m0 .
For a small α, we have 1 − (1 − α)1/m0 ≈ 1 − (1 − α/m0 ) = α/m0 , so the two MTPs lead to similar thresholds t.
Statistical Methods for Complex Systems
21
False Discovery Rate (FDR) Because it basically aims at maintaining FP at 0, FWER control often leads to too stringent thresholds, especially when m0 is large. Benjamini and Hochberg (1995) suggest to rather control the FDR, that is the expected proportion of false positives among all positives: FDR(t) = E[FP(t)/P(t)] where P(t) denotes the number of Pi s smaller than t [the precise definition of the FDR is slightly different to account for the case where P(t) = 0.]. These authors propose the following MTP: denoting P(1) ≤ · · · ≤ P(i) ≤ · · · ≤ P(n) the ordered p-values, define i∗ = max{i : m0 P(i) /i ≤ α} and reject all hypotheses Hi such that Pi ≤ P(i∗ ) , then E[FDR(P(i∗ ) )] ≤ α. The intuition behind this is that if t is chosen as t = P(i) then P(t) = i and E[FP(t)] = m0 P(i) , so E[FP(t)/P(t)|P(i) ] = m0 P(i) /i. 2.2.2.3
Some extensions
Estimation of π0 Most MTPs involve the number of true hypotheses m0 , which is unknown, in general. A conservative strategy consists of replacing m0 with m, but this leads to a (sometimes dramatic) loss of power. A reliable estimation of m0 , or equivalently π0 = m0 /m, strongly improves the MTP. Thanks to the large number of tested hypotheses, the proportion π0 of true ones can be accurately estimated and several estimates have been proposed (Langaas et al. 2005; Blanchard and Roquain 2009; Celisse and Robin 2010; and references therein). The basic idea traces back to Storey (2002) who suggests to consider the number N(λ) of p-values exceeding a given threshold λ, above which only true null hypotheses should be found. π0 can then be estimated by 0 = N(λ)/(1 − λ). π 0 can then be plugged into the MTP. The properties of the resulting procedure can be assessed via a careful m study of the behaviour of the empirical c.d.f. of the p-value and associated false positive and negative empirical processes (Genovese and Wasserman 2002, 2004). The choice of λ can also be made in an adaptive way (Celisse and Robin 2010). Dependency The independence hypothesis stated up to now does not hold in most real situations: gene expressions are typically correlated and the test statistics associated with each gene are therefore not independent. A strong departure from this hypothesis may have strong consequences (Kim and van de Wiel 2008). When permutation tests are used, the dependency structure can be embedded in the permutation algorithm so no specific adjustment is required (Westfall and Young 1993). In a more general context, the MTP can be adapted to still control FDR under dependency. This field is active and we only provide here a few references: Sun and Cai (2008) consider a Markovian dependency, Friguet et al. (2009) propose a general approach to model the dependency and Blanchard and Roquain (2008) consider a more general context and define adaptive MTPs. Local FDR FDR only informs us about the proportion of false positives within a set of rejected tests. Some information about the probability for each of them to be a false positive is clearly desirable in practice. This is the aim of the local FDR (FDR) defined by Efron et al. (2001) who rephrase the multiple testing problem as a mixture model (see Section 2.4). By construction, p-values associated with true null hypotheses have a uniform distribution over [0, 1], so the distribution of all p-values displayed in Figure 2.1(a) can be written as g(p) = π0 + (1 − π0 )f (p)
22 Handbook of Statistical Systems Biology
Figure 2.1 (a) Typical distribution of the p-values in a multiple testing setting. (b) Receiver operating characteristic (ROC) curves for four different classifiers A, B, C and D
where f is some density concentrated toward 0. This modelling is consistent with most estimates of π0 presented above. The local FDR of hypothesis Hi is then defined as in (2.19): FDRi = π0 g(Pi ). Various estimates of f and π0 have been proposed in this context. Efron et al. (2001) considered a empirical Bayes approach, Allison et al. (2002) proposed a parametric mixture of Beta distribution, while McLachlan et al. (2006) applied a Gaussian mixture to probit-tranformed p-values. This last transformation turns out to be very efficient in practice, as it zooms into the region where true and false hypotheses are mixed, making the mixture more identifiable. More flexible modellings have also been proposed, including a semi-parametric estimate of f (Robin et al. 2007), or estimation under constraint of convexity (Strimmer 2008). R packages are associated with most of these procedures, the ‘Mutoss’ R-project aims at gathering them (r-forge.rproject.org/projects/mutoss/).
2.3
Class Prediction
2.3.1 2.3.1.1
Building a classifier Classification problem
In classification, the goal is to predict the class or label Y of an observation, according to some information X collected on this observation. Here are two examples of classification problems in computational biology: • Cancer diagnosis. Based on information X that consists of gene activity measured via microarray technology on a given tissue sample collected from an individual, one wants to determine the disease status Y of the individual that can be 0 if the individual is healthy, 1 if a moderate form of cancer is diagnosed or 2 if the cancer is invasive (Golub et al. 1999). • Protein–protein interaction. The problem is to predict whether a protein interacts (i.e. binds) with a protein of interest. In this problem, each candidate protein can be described by its amino-acid sequence and/or its surfacic geometrical elements that constitute the available information X, and the label Y is +1 if the candidate protein interacts, −1 otherwise (Hue et al. 2010).
Statistical Methods for Complex Systems
23
In these examples information X is of various forms, while Y is a qualitative variable with usually few possible values. In the following we only consider binary classification problems where Y = −1 or +1. In order to predict Y from X, one has to build a classifier, i.e. a function f : X → {−1, +1}, whose predictions are as accurate as possible. The prediction performance of a classifier can be quantified by its classification error rate L(f ) = Pr{f (X) = / Y} Theoretically, the problem is simple: define the Bayes classifier as +1 if p+1 (x) > 0.5 +1 if p+1 (x) > p−1 (x) = fB (x) = −1 otherwise, −1 otherwise,
(2.6)
(2.7)
where p (x) = Pr{Y = |X = x} is the posterior probability for point x to belong to class (to have label ). This classifier is known to be optimal, in the sense that it minimizes the classification error rate. However in practice this classifier is not available, because the joint distribution P(X, Y ) is usually unknown. In fact, the only information at our disposal to build a classifier is a training set, i.e. a sample of n independent observations (X1 , Y1 ), . . . , (Xn , Yn ) for which both information and labels are known. Still, the Bayes classifier gives important clues about how to build a classifier: the decision to classify an observation as +1 is based on the posterior probabilities p+1 (x) and p−1 (x). One then needs to either estimate these probabilities, or at least to identify the set of points x such that p+1 (x) > p−1 (x). Many classification algorithms have been proposed to build a classifier, three of the most popular ones are presented next. 2.3.1.2
Some classification algorithms
For the sake of simplicity, we will assume here that X is a collection of p quantitative descriptors X1 , . . . , Xp , such as the expression measurements of genes in a given tissue. Logistic Regression x, we have:
The logistic regression algorithm is based on the following hypothesis: for any point log
p+1 (x) p−1 (x)
= α0 +
p
αj xj = g(x).
(2.8)
j=1
We can infer the unknown parameters αj , j = 0, . . . , p via ML estimation, and then estimate the ratio of posterior probabilities by ⎞ ⎛ p
(x) p +1 = j xj ⎠ . 0 + α = exp ⎝α R p−1 (x) j=1
The logistic regression classifier is then fLReg (x) =
+1
>1 if R
−1
otherwise.
A consequence of hypothesis (2.8) is that the boundary between the two classes, i.e. the points such that p−1 (x) = p+1 (x), is linear. Therefore the logistic regression classifier results in a hyperplane that splits space X in two. Note that the model can be extended to quadratic or higher polynomial decompositions. One difficulty is then to make a relevant choice of the polynomial order. A low order may result in a too simplistic regression function and a poor fit to the training data. A high order will result in a very good fit to the traning data, but will poorly generalize to new observations. This last phenomenon is often referred to as ‘over-fitting’.
24 Handbook of Statistical Systems Biology
Nearest Neighbour (NN) Algorithm The posterior probabilities p−1 (x0 ) and p+1 (x0 ) of any new observation x0 can be locally estimated by looking at points that are close to x0 in the training set. This is the principle of the kNN algorithm (Fix and Hodges 1951, 1952): first, for a given observation x0 to classify, find X(1) , . . . , X(k) the k points closest to x0 in the training set, then classify x0 according to a majority vote decision rule among these k neighbours. We have: −1 (x0 ) +1 (x0 ) > p +1 if p fkNN (x) = −1 otherwise. 1
I{Y(i) = }. k k
(x0 ) = where p
i=1
A variant of this simple algorithm is the weighted kNN algorithm (WkNN), where each neighbour has a x specific weight w(i)0 in the majority vote decision rule, according to its proximity to x0 (the closer to x0 , the higher the weight). When elaborating a kNN classifier, the difficulty lies in the choice of the distance measure between points and the number of neighbours k to consider. Classification Tree A classification tree is a classifier that predicts the label of an observation by verifying a sequence of conditions, of the form ‘is measurement Xj higher than threshold sj for this observation ?’. Since the prediction is the result of the sequential checking process, such classifiers can be graphically represented as binary trees, where each node corresponds to a condition, except for the terminal nodes that correspond to the predictions. Assuming that the size of the tree (its number of nonterminal nodes) is K, then there are K + 1 profiles of answers leading to one of the K + 1 terminal nodes Nd1 , . . . , NdK+1 . Assuming without loss of generality that nodes Nd1 , . . . , Ndk and Ndk+1 , . . . , NdK+1 are associated to labels −1 and +1, respectively, we have: +1 if x0 ∈ Nd , ∈ {1, . . . , k} ftree (x) = −1 otherwise. When elaborating a tree classifier, the difficulty lies in the choice of the number K of conditions to check, their ordering, the variable Xj and threshold sj that should be used at each condition. Many algorithms have been proposed to build tree classifiers, CART (Breiman et al. 1984) and C4.5 (Quinlan 1993) being the most popular ones. Compared with the kNN algorithm, a major specificity of tree classifiers lies in their embedded variable selection process: at most K of the p variables will be used for the classification of any observation. This may be of importance when the number of variables is large, with most of them being irrelevant for the prediction purpose and only a small subset being informative. These examples illustrate the great diversity of existing classification algorithms, many more being detailed in Hastie et al. (2001). One may wonder how these algorithms would perform in high dimensional settings where the number of descriptors p in X is much larger than the number of observations (often referred to as the ‘p n’ paradigm), a classical situation in computational biology. It appears that all will deteriorate in performance as the dimension increases, but for different reasons. Due to their internal variable selection process, classification trees may be unstable: small changes in the training set will yield different classifiers with different sets of selected variables, and large discrepancies in prediction. Nearest neighbours will be much more stable since no variable selection is performed, but the pertinent information may be diluted if most variables are uninformative, leading to poor prediction performance. Lastly, logistic regression may be inefficient too, since it requires estimating one parameter per variable, each estimation being vitiated by noise. We therefore need efficient strategies to deal with high dimensional data. Two of them, aggregation and regularization, are presented in Sections 2.3.2 and 2.3.3, respectively.
Statistical Methods for Complex Systems
2.3.2
25
Aggregation
Aggregation may be motivated by different purposes: to ease the interpretation of the classification rule, or to improve the predictions of a given classification algorithm. When interpretation is at stake, aggregation is usually performed at the variable level. If the goal is to improve the prediction performance, one will rather aggregate classifiers. We briefly review variable aggregation and then focus on the two classical strategies to aggregate classifiers, bagging and boosting. 2.3.2.1
Variable aggregation
High dimensional data are usually characterized by a high level of redundancy: different variables or sets of variables may share the same information about the label. When classification is based on a subset of the p variables at hand, as in a classification tree, different (and sometimes nonoverlapping) subsets may be used to achieve the same prediction performance. The choice between the equivalent subsets will arbitrarily depend on the training sample, and small changes of the training sample may lead to drastic changes in subset selection, hence to noninterpretable classifiers (Michiels et al. 2005). To deal with the redundancy problem, several authors proposed to first aggregate the variables that share the same information into clusters, and then to build a classifier based on these clusters. Several strategies have been proposed (Hastie et al. 2000; Dettling and Buhlmann 2002; Mary-Huard and Robin 2009), that differ from each other on mainly two points: • •
supervised/unsupervised: the aggregation method can take into account the label or not; summarizing: once the clustering of redundant variables is done, the classifier can be built on the complete clusters, on some of the variables of each cluster, or on a synthesized variable that sums up the cluster information (for instance a linear combination of the cluster variables).
Variable aggregation should be distinguished from variable compression, where one tries to summarize the information shared by the whole set of variables. While variable compression often improves the classification error rate, it usually does not lead to an interpretable classifier. 2.3.2.2
Classifier aggregation
Bagging Bagging can be understood as an application of the classical bootstrap (Efron and Tibshirani 1993) to classification algorithms. In the classical setting where a parameter θ has to be estimated from a sample, bootstrap consists of re-sampling the sample at hand B times, obtaining an estimation of θ from each sample and then averaging the B estimates. This averaging process results in a bootstrap estimator whose variance is lower than the initial estimator, i.e. the one obtained by estimating θ from the initial sample. The same idea can be exploited in the classification context to improve the performance of an unstable classification algorithm A. Given a training sample, B bootstrap samples are drawn. A classifier fAb is obtained by applying algorithm A to each bootstrap sample, and the bagging classifier is then defined as
bag fA (x0 )
−1 (x0 ) +1 (x0 ) > p +1 if p = −1 otherwise,
(x0 ) = where p
B 1
I{fAb (x0 ) = }. B b=1
(2.9)
26 Handbook of Statistical Systems Biology
While bagging can be applied to any classification algorithm, one may wonder in which circumstances it is fruitful to use it. This can be theoretically answered by looking at the regression case. Assume for this section that the variable Y is quantitative, and that an algorithm A is available to predict Y from X. Let μA (x0 ) = EP [fA (x0 )] denote the average prediction at a fixed point x0 (with unknown label Y0 ) over all the possible classifiers obtained by applying A to a sample drawn from the joint distribution P of (X, Y ). We have (Breiman 1996): EP
2
(Y0 − fA (x)
= EP [(Y0 − μA (x0 )]2 + VP fA (x0 ) ,
where VP fA (x) is the variance of the prediction at point x0 . From this equation we deduce two important results: • •
The average discrepancy between the true label of x0 and the prediction given by fA (x) is always higher than the discrepancy between the true label of x0 and the average prediction μA (x0 ). The difference between EP {[Y0 − fA (x)]2 } and EP {[(Y0 − μA (x0 )]2 } is proportional to variance VP [fA (x0 )], that directly measures the stability of the prediction of algorithm A at point x0 .
The first point means that it is always better (equivalent at worst) to use μA (x0 ) rather than fA (x0 ). Since μA (x0 ) cannot be computed in practice (since P is unknown), we can use its bagging version (2.9) as a surrogate. The second point shows that the relative improvement due to bagging will be greater as the variance (instability) of algorithm A increases. As an example, the CART algorithm described in Section 2.3.1.2 is a classical example of an unstable classification algorithm (because of its internal variable selection process), and many articles demonstrated the efficiency of bagging when applied to CART. In contrast, the kNN algorithm is a much more stable algorithm, and application of bagging to kNN yields little improvement of the classification performance (Breiman 1996). Choosing the number of bootstrap samples is an open question. Selecting a small B can lead to suboptimality of the resulting classifier in terms of classification performance, but increasing B comes at a cost in terms of computational burden that is not worthwhile if the gain in performance is marginal. A discussion on this topic can be found in Sutton (2005). Boosting In Schapire (2002), it is argued that building a classifier with good prediction performance is difficult, but building moderately efficient classifiers is often simple. The idea is then to combine such classifiers to build a prediction rule that will be more accurate than any one of the basic classifiers. The boosting algorithm builds the combination iteratively: at each step a new basic classifier is added to the combination. This classifier is trained on a weighted version of the original training set, where increased weights are given to observations that were frequently misclassified during the previous iterations. The final combination then votes to predict the label of any new information. Many boosting algorithms have been proposed. Here we briefly introduce the Adaboost algorithm of Freund and Schapire (1997). For a given classification algorithm A, starting with initial weights w1i = 1/n for observations i = 1, . . . , n, Adaboost runs B times the following program: 1. Build classifier fAb on the training set with weights wbi n b b wi I{fA (xi ) = / yi } 2. Compute errb = i=1 n b i=1
3. Compute αb =
b log( 1−err errb )
wi
∝ wbi exp(αb I{fAb (xi ) = / yi }) 4. Set wb+1 i
Statistical Methods for Complex Systems
27
The final classifier is then: fAboost (x0 )
=
1 −1
if
B
b b=1 αb fA (x0 )
otherwise.
>0
(2.10)
Equation (2.10) and point 3 show that the weight αb given to classifier fAb in the final voting rule depends on its performance errb : efficient classifiers receive more weights in the final decision. Point 4 of the program shows that misclassified points during step b will have their weights inflated by a factor exp(αb ) at step b + 1. While many applications showed the efficiency of boosting in practice (Dettling and Buhlmann 2003), one may wonder why boosting works. Compared with bagging, boosting does not rely on the fact that many classifiers are built on samples drawn from the same empirical distribution, since the distribution (i.e. the weights) change at each boosting iteration. In fact, theoretical arguments have been advanced that show that the way boosting concentrates on observations that are hard to classify is a key of its accuracy (Schapire et al. 1998). Hard-to-classify points often lie on the boundary between the two classes in X, i.e. in regions where p+1 (x) ≈ p−1 (x), hence the need to focus on these points to sharply evaluate these two quantities at stake in (2.7). As for bagging, boosting can be applied to any classification algorithm, and in practice is often (but not only) applied to trees of moderate size or neural networks (Schwenk and Bengio 1998; Dietterich 2000). The choice of the number of iterations is also critical. In bagging, increasing the number of iterations makes the resulting classification rule more robust. In boosting, increasing the number of observations may lead to an over-fit of the data. Over-fitting refers to classifiers that exhibit optimistic performance on the training set that are not reproducible on future data to classify. This usually happens when the classification algorithm is free to adapt to the training data without restriction. In boosting, the higher the number of iterations, the higher the risk of over-fitting. However, some authors observed that in practice boosting was robust to over-fitting, even for large number of iterations. This behaviour is still under theoretical investigation (Friedman et al. 1998). 2.3.3
Regularization
Once a classification algorithm is chosen and the training data collected, obtaining a classifier usually requires the solution of an optimization problem. The function to optimize can be directly the classification error rate (or one of its surrogates, such as the resubstitution error rate, see Section 2.3.4), or some other objective function that depends on the training sample. In large dimension problems, a direct resolution of the optimization problem may lead to over-fitting. Regularization refers to the strategy that consists of adding some constraints to the optimization process to avoid the aforementioned problems. 2.3.3.1
L2 regularization
Penalized Logistic Regression (LR) To build a LR classifier, one has to estimate parameters αj , j = 0, . . . , p. This is done by minimizing the negative log-likelihood of the training data n
log {1 + exp[−yi g(xi )]},
i=1
with notation of Equation (2.8). In large dimension problems, applying minimization without any constraint on the norm of the parameters will lead to inconsistent parameter estimates, with possibly infinite values. To
28 Handbook of Statistical Systems Biology
avoid this problem, one can consider the quadratically regularized log-likelihood (Zhu and Hastie 2004): n
log {1 + exp[−yi g(xi )]} + λg22 ,
i=1
where the last term is a quadratic penalization function defined as g22 =
(2.11) p
2 j=1 αj .
Support Vector Machine (SVM) SVM is another popular classification algorithm, that can be understood as a classification method with an embedded regularization process. Indeed, the SVM algorithm (Vapnik 1995) p fits a function g(x) = α0 + j=1 αj xj that minimizes n
1 − yi g(xi )
+
+ λg22 ,
(2.12)
i=1
where (u)+ = u if u is positive, 0 otherwise. The resulting SVM classifier is +1 if g(x) > 0 fSVM (x) = −1 otherwise. Interpretation It is worth noticing that expressions (2.11) and (2.12) are similar, and lead to a general interpretation of regularized methods. The regularized optimization problem can be rewritten as: n
(g, (xi , yi )) + λR(g).
i=1
The loss function (., .) evaluates the quality of adjustment of function g to the training data: if g(xi ) and yi have the same sign, then the classifier associated with g makes the right prediction for xi , and the loss is low. If the signs of g(xi ) and yi differ, the loss is high. Note that the loss increases according to −yi g(xi ): severe classification errors make the loss higher. The penalization function R(.) takes into account the statistical cost of function g. For example, in (2.11) and (2.12), the regularization function is the Euclidian norm of the parameters (also called the L2 -norm). This term implies that given two functions g1 and g2 with identical fits to the training set, the simplest one (in terms of norm) should be preferred. Regularization amounts to finding a trade-off between adjustment and cost. Depending on parameter λ, emphasis will be put either on fit or on cost. Tuning parameter λ to achieve optimal performance is a difficult task. In practice, λ can be chosen by cross-validation (see Section 2.3.4). 2.3.3.2
Other regularization functions
We observed that penalized LR and SVM correspond to the same regularization strategy, applied with different loss functions. It is also possible to consider alternative regularization functions, that are more adapted to the nature of the data, or to the classification problem at hand. L1 Regularization In large dimension problems, it is sometimes assumed that only a small subset of variables is informative to predict the label. In this situation, a relevant classifier should only depend on this (unknown) subset. While L2 regularization globally shrinks coefficients, in practice, even for a large value of λ, no or only a few of them will be shrunk to 0. Conversely, the use of the L1 regularization function p R(g) = j=1 |αj | will tend to sparse solutions where only a few parameters will be nonzero (Tibshirani 1996; Lee et al. 2006). Therefore, L1 regularization (also called Lasso regularization) is commonly used as a variable selection strategy.
Statistical Methods for Complex Systems
29
Fused Lasso Regularization In some situations, a natural ordering of the predictor variables can be defined. Consider for instance Comparative Genomic Hybridization (CGH) array experiments where variables correspond to probe measurements. Since two adjacent probes on a given chromosome are likely to share the same copy number, their associated weights in the decision rule should be similar. A relevant classifier should be sparse (only some chromosomal regions are informative), and parameter estimates corresponding to adjacent variables (i.e. adjacent probes) should be identical (Rapaport et al. 2008; Tibshirani and Wang 2008). For this purpose, the following regularization function can be considered: R(g) = λ1
p
|αj | + λ2
|αj − αj+1 |.
j
j=1
The first term corresponds to the Lasso penalty that guarantees sparsity, and the second term causes the classification algorithm to produce similar weights for adjacent variables. These two examples illustrate the flexibility of regularization methods, and shed light on their effectiveness to benefit from prior information about the data structure, and produce classifiers with good prediction performance. In practice, the implementation of regularization methods may raise difficult optimization problems, that have to be taken into account when elaborating a new regularization function. 2.3.4
Performance assessment
In previous sections we have been many algorithms to build or combine classifiers. While some algorithms may be preferred for some specific applications, we usually have little clue about how to select the classification algorithm to use. In practice, the choice will often be based on the respective performance of each classifier. It is therefore critical to have at our disposal efficient tools to assess the performance of any classifier, both for evaluation and comparison. An intuitive strategy would be to evaluate the classifier f on the training data, and compare the prediction obtained for the true labels. The ‘’ notation in f underlines the fact that f was already built using the training data. More precisely, we can compute the empirical error rate (EER, also called the resubstitution error rate) n 1 EER(f) = I f (xi ) = / yi . n i=1
Unfortunately, this strategy leads to a biased estimation of the true classification error rate of the classifier, as defined in (2.6). Indeed, since the data are used both for building and evaluating the classifier, EER will lead to an optimistic estimation of the true error rate. Therefore no fair evaluation or comparison between classifiers is possible using EER. From this, we conclude that an unbiased evaluation necessitates splitting the data into two distinct samples, one for construction and one for evaluation. The next section presents different strategies of splitting that are commonly used. 2.3.4.1
Hold-out and cross-validation
Hold-Out (HO) Usually, a single sample is collected at once, and then split into a train and a test sample, for construction and evaluation, respectively. This strategy is called Hold-out. Defining e = (X1 , Y1 ), . . . , (Xn−m , Yn−m ) and e¯ = (Xn−m+1 , Yn−m+1 ), . . . , (Xn , Yn ), the HO estimator is n
1 e e (Xj ) = e ) = 1 I f / Yj = I f (Xj ) = / Yj , HO(f m m j=n−m+1
j∈¯e
e is the classifier built on sample e. Although HO is unbiased, the splitting of the data into train/test where f induces some randomness due to the arbitrary choice of the withdrawn data points.
30 Handbook of Statistical Systems Biology
Leave-m-Out (LmO) To avoid an arbitrary choice between classifiers based on a particular splitting of the data, every possible subset of m observations is successively left out of the initial sample and used as the test set. The algorithm with the smallest averaged classification error rate is then selected. The LmO estimator is then ⎡ ⎤ −1
−1
1 n n e (Xj ) = e ), ⎣ I f / Yj ⎦ = HO(f LmO(f) = m m m e e j∈¯e where the sum is over all the possible subsets e of size n − m. While LmO solves the randomness problem of HO, its computational cost is prohibitive for large values of m, and in practice only the leave-one-out (LOO) procedure is routinely used. K-Fold (KF) An intermediate strategy consists in dividing the complete dataset into K subsamples e¯ 1 , . . . , e¯ K with roughly equal size n/K, each subsample being successively used for validation. This leads to the following estimator: 1
ek ). KF (f) = HO(f K e k
KF with m = n/K is a compromise between HO and LmO: it is more stable than HO since it averages the results of different samplings, and its computational cost is much lower than the one of LmO. Choosing the Train/Test Proportions All these procedures require the tuning of a parameter that balances the sizes of the training and test sets: m for HO and LmO, K for KF. Choosing different values for this parameter yields different evaluations of the performance, and sometimes different conclusions about which classifier performs best. The optimal tuning of this parameter is still an open question. A review can be found in Arlot and Celisse (2010). About the Good Use of Cross-Validation We emphasize again that all the resampling methods presented here assume that the test set is never used in any step of the training. In particular, selecting a subset of variables, or tuning the inner parameters of a classification algorithm are part of the training process, and therefore should not involve the test set. In Ambroise and McLachlan (2002) for instance, the authors showed that the performance estimation could be severely biased when the variable selection step is performed external to rather than within the cross-validation loop, an error that still occurs in publications. 2.3.4.2
ROC curves
So far, we worked under the implicit hypothesis that all types of classification error have the same cost: whether an observation is misclassified as +1 or misclassified as −1 is equivalent. In many applications this assumption does not hold: for instance, in cancer diagnosis, to misclassify an individual as ‘healthy’ or ‘ill’ does not have the same consequences. In such cases, one needs to focus either on the sensitivity or the specificity of the classification rule, where Sensitivity = Pr{f (X) = 1|Y = 1} and
Specificity = Pr{f (X) = −1|Y = −1}.
In Section 2.3.1.1, we defined the optimal classifier as +1 if p+1 (x) > t fB (x) = −1 otherwise,
Statistical Methods for Complex Systems
31
where t = 0.5. This particular choice of threshold t assumes a balance between sensitivity and specificity. It is possible to change the trade-off between these two quantities by tuning the threshold: the higher t, the higher the specificity (and the lower the sensitivity). The evolution of the sensitivity/specificity trade-off can be investigated for a given classifier via the ROC curve, that plots sensitivity versus 1−specificity as t varies from 0 to 1. Figure 2.1 (b) exhibits four ROC curves obtained from classifiers A, B, C and D. The bottom-left corner corresponds to high values of t, for which sensitivity is high and specificity low. As t increases, sensitivity decreases whereas specificity increases. For instance, if one requests a specificity of at least 80% then classifier B will score a sensitivity of 65%. ROC curves may also be useful to compare classifiers. For instance, in Figure 2.1 classifier C should be preferred to the other ones since its ROC curve is uniformly higher. In practice though, different classifiers may be optimal for different sets of values of t, resulting in no obvious leader: in Figure 2.1, if a high specificity is requested, one should prefer B to D. In contrast, if the goal is to achieve high sensitivity, D should be preferred to D. The area under the curve (AUC) provides a summary of the classifier performance over all values of t. A perfect classifier with high sensitivity and specificity at the same time would score an AUC of 1. Classifiers can then be compared using their AUC scores, according to the rule ‘the higher the better’. According to this criterion, classifier B should be preferred to classifier D since their AUC score are 0.78 and 0.71, respectively.
2.4
Class discovery
Clustering is one of the most used techniques to find some structure within a dataset of entities. This problem is also known as ‘unsupervised classification’ for the classes are discovered based on a set of unlabelled observations. This makes a strong distinction with the previous section where classes were ‘learned’, based on a set of labelled observations. Clustering aims at finding an underlying structure (i.e. clusters) that is a priori unknown. Although other descriptive techniques, such as principal component analysis (PCA), may sometimes reveal the existence of clusters, this is not their primary goal. They are therefore not considered as clustering methods. Gene clustering based on expression data has become common place in the last few decades and tens (hundreds?) of strategies have been proposed to this end. Two main approaches can be distinguished: geometric (or distance-based) techniques and probabilistic (or model-based) techniques. We will briefly introduce the former and concentrate on the latter. As for the notations, we consider a dataset of n observations (i = 1, . . . , n), each characterized by a vector Xi , that we aim at clustering into K distinct clusters. Depending on the application, K may be known a priori or not. 2.4.1 2.4.1.1
Geometric methods Hierarchical algorithms
Distance-based clustering traces back to the early stages of taxonomy (Sokal and Sneath 1963). The most typical algorithms provide a hierarchical structure and work as follows. Start with n clusters each made of one observation. At each step the two closest individuals (or groups of individuals) are merged to make a new cluster (Hastie et al. 2001). The number of clusters is hence reduced by 1 at each step. The clustering process is often depicted as a tree, also called a ‘dendrogram’, with n leaves corresponding to each individual, and one root corresponding to the final cluster that includes them all. Such algorithms are based on three key ingredients [a more detailed presentation can be found in Mary-Huard et al. (2006)]. Distance between observations. We first need a distance (or similarity, or dissimilarity) measure d(i, j) between observations, to decide which ones have to be first clustered. It is not possible to summarize the huge
32 Handbook of Statistical Systems Biology
variety of distances that can be considered. It goes from simple Euclidean distances d(i, j) = Xi − Xj when observations Xi are vectors of real numbers [e.g. gene expression levels, see D’haeseleer (2005) for some examples] to so-called kernels when observations are made of complex heterogenous descriptors (Sch¨olkopf and Smola 2002). Aggregation criterion. Once the hierarchical clustering process has started, some observations are gathered into clusters that are themselves to be clustered. This requires defining a second distance D(A, B), where A and B are clusters. Again, there exists an impressive list of such distances (simple linkage, diameter, UPGMA, etc.), which often give their name to the clustering algorithm itself. Stopping rule. Because clustering aims at finding a ‘reasonable’ number of groups, the process has to be stopped before it ends with one single cluster. In the absence of modelling, the choice of the number of clusters often relies on some heuristics, such as finding long branches in the dendrogram, or finding change-points in the behaviour of the variance between clusters along the clustering process. 2.4.1.2
K means
Nonhierarchical methods where the number of groups is known a priori also exist. The most emblematic is probably the K means algorithm where the K clusters are associated with K centroids (Hastie et al. 2001). The algorithm starts with K randomly chosen centroids ands then alternates two steps: 1. Each observation is clustered with its closest centroid; 2. Centroids are updated as the mean of the observations clustered together. This kind of algorithm is known to converge very quickly and to be very sensitive to the choice of the initial centroids (‘seeds’). 2.4.2
(Discrete) latent variable models
The clustering problem can be set in a model-based setting via the definition of latent random variables Zi ∈ {1 . . . K} corresponding to the labels of each observation. (Equivalently, we define the binary variable Zik which is 1 if Zi = k and 0 otherwise.) In this setting, the observations Xi are often supposed to be independent conditionally to the Zi , with label-dependent distribution: {Xi }i=1...n independent |{Zi }i=1...n ,
(Xi |Zik = 1) ∼ f (·; θk ).
(2.13)
f is often chosen within a family of parametric distributions (with parameter θk ) that seem relevant for the observed data Xi . Note that f can be any distribution, up to non-parametric regression (Luan and Li 2003) or even more complex structures. Denoting X = {Xi } the observed data and Z = {Zi } the unobserved labels, the conditional log-likelihood of X under (2.13) is
Zik log f (Xi ; θk ) (2.14) log P(X|Z) = i
k
Such models mostly differ for the distribution of the unobserved labels Z. We give here a quick overview of the most classical models: Mixture. The simplest model assumes that the labels are independent and identically distributed (i.i.d.) with multinomial distribution M(1; π) where π is the vector of proportions of each group (McLachlan and Peel 2000), so we have
Zik log πk . (2.15) log P(Z) = i,k
Statistical Methods for Complex Systems
33
Hidden Markov Model (HMM). When data are observed along a single direction (such as time or genomic position), it may be relevant to introduce a dependency between the labels of adjacent positions. So-called HMMs often actually refer to hidden Markov chain models where Z is assumed to be a Markov chain with transition matrix π:
Zi−1,k Zi log πk . (2.16) log P(Z) i,k,
Such models are intensively used in sequence analysis (Durbin et al. 1999). Hidden Markov Random Field (HMRF). When the data have a more general spatial organization (such as pixels in an image), {Zi } can be assumed to be a Markov random field where each Zi only depends on its neighbours and is conditionally independent from the rest (Besag 1974). Stochastic Block Model (SBM). This last example refers to interaction graphs where nodes can be proteins or species linked to each other by edges revealing possible physical interactions or some similarity in terms of phenotype. The observed data are then the (possibly valued) edges {Xij } between the n nodes. The SBM is a mixture model stating that the unknown labels are i.i.d. M(1; π) and that the edge values are conditionally independent with distribution depending on the labels of both nodes (Nowicki and Snijders 2001): Xij |(Zi = k, Zj = ) ∼ f (·, θk ). The log-likelihood of Z is hence the same as in (2.15) but, due to the network structure, the conditional log-likelihood of X differs from (2.14):
Zik Zj log f (Xij ; θk ). (2.17) log P(X|Z) = i,j k,
2.4.3 2.4.3.1
Inference Maximum likelihood inference
As for all incomplete data models, the main issue for the inference of such models comes from the unobserved labels Zi . Although several approaches do exist, ML is the most commonly used. In order to maximize the likelihood of the observed data log P(X), most inference algorithms include a ‘retrieval’ step where the conditional distribution of the unobserved labels given the observations P(Z|X) is calculated or approximated. Likelihoods The likelihood of the observed data log P(X) is often difficult (or even impossible) to handle, whereas the likelihood of the complete dataset log P(X, Z) = log P(Z) + log P(X|Z) generally has a much more convenient form, as seen in Section 2.4.2. A connexion between these likelihoods can be made (Dempster et al. 1977) as log P(X) = E[log P(X, Z)|X] + H[P(Z|X)] (2.18) where H(F ) stands for the entropy of distribution F defined as H(F ) = − F (z) log F (z)dz. The calculation of the two elements in the right-hand side requires the evaluation of the conditional distribution P(Z|X), or at least some of its moments. All expectation-maximization (EM) like algorithms alternate 1. E-step: evaluation of P(Z|X); 2. M-step: maximization of E[log P(X, Z)|X] with respect to the parameters. The M-step does, not in general, raise more difficulties than classical ML inference.
34 Handbook of Statistical Systems Biology
Conditional Distribution The evaluation of P(Z|X) is hence the crucial step for the inference of such models. We go back to some models presented above to illustrate how this can be achieved. Mixture. Because all couples (Xi , Zi ) are independent, the Zi are conditionally independent and the distribution of each of them is given by the Bayes formula:
P(Zi = k|X) = P(Zi = k|Xi ) = πk f (Xi ; θk ) π f (Xi ; θ ) (2.19)
HMM. Due to the underlying Markov structure, the Zi are not conditionally independent. However, adding (2.16) and (2.14) shows that only single labels Zik and couples of adjacent labels Zi−1,k Zi, are involved in log P(X, Z). This proves that the Zi still have a Markovian dependency structure. The conditional distribution P(Z|X) can be obtained via the so-called ‘forward-backward’ recursion, with a linear complexity (Capp´e et al. 2005). The forward step iteratively calculates the conditional distribution of Zi given the past observations: P(Zi |X1 , . . . , Xi ). The backward step completes the calculation of all P(Zi |X), starting from P(Zn |X1 , . . . , Xn ) = P(Zn |X), and going back to P(Z1 |X). HMRF and SBM. The conditional distribution of the labels displays a more intricate dependency structure. In HRMF it is still a Markovian structure but, in the absence of natural order in two dimensions or more, no efficient recursion such as ‘forward-backward’ can be derived. In SBM, the sum of (2.15) and (2.17) involves both single labels Zik and all couples of labels Zi,k Zj, . This proves that their conditional dependency structure is a clique (Daudin et al. 2008) and no simplification can be expected. In such models, the conditional distribution P(Z|X) can only be either estimated via Monte-Carlo techniques [giving rise to stochastic versions of EM such as Stochastic EM (SEM) (Celeux and Diebolt 1992) and Stochastic Approximation EM (SAEM) (Delyon et al. 1999) or approximated with mean-field (Jaakkola 2000) or message-passing (Winn and Bishop 2005) techniques. Variational Point of View From a more general point of view, these inference strategies can be considered as variational techniques which aim at finding the distribution Q(Z) that best approximates P(Z|X). The most popular strategy consists in minimizing the K¨ullback–Leibler (KL) divergence KL[Q(Z); P(Z|X)], where KL[F (Z); G(Z)] = F (z) log[F (z)/G(z)]dz. As the KL divergence is always positive, for any distribution Q(Z), log P(X) can be lower-bounded by log P(X) − KL[Q(Z); P(Z|X)], that can be reformulated as (Jaakkola 2000) log P(X) ≥ Q(z) log P(X, z)dz + H(Q). (2.20) This lower bound is similar to (2.18), except that P(Z|X) is replaced by Q(Z). Regular EM algorithms correspond to cases (such as mixtures or HMM) where P(Z|X) can actually be computed, so Q(Z) is chosen as Q(Z) = P(Z|X). The divergence is hence set to zero, so (2.20) equals (2.18) and ML inference is achieved. In more complex cases (HMRF, SBM), Q(Z) is chosen as the best possible approximation (in terms of KL divergence) of P(Z|X) among a certain class of manageable distributions. It results in the maximization of a lower bound of the likelihood, which is not equivalent to ML inference (Gunawardana and Byrne 2005). Such strategies can be generalized to many graphical models (Jordan et al. 1999) that will be introduced later in this book. Note that the class of incomplete data models is not limited to those described here, but also includes mixed models described in Section 2.2. Another interesting example of such a modelling can be found in Beal et al. (2005). Note also that a Bayesian version of variational inference does exist in the context of exponential family distributions (Beal and Ghahramani 2003).
Statistical Methods for Complex Systems
2.4.3.2
35
Additional issues
Model Selection The determination of the number of groups K is a problem per se. Although in some situations it may be made based on some prior knowledge, K generally needs to be estimated as well as the other parameters. Because K class mixtures are part of the set of K + 1 class mixtures, the maximized K , θK ) cannot be used to choose K as it always increases when K increases. In the context likelihood log P(X; π of ML inference, most criteria consist of adding a penalty to the likelihood, which accounts for the complexity of the model (Burnham and Anderson 1998). The Akaike Information Criterion (AIC) and the Bayesian Informaion Criterion (BIC) are the two most famous examples of that kind. The latter is an approximation of the probability P(K, X) based on a Laplace approximation. It is hence only valid for reasonably large datasets. BIC is clearly most popular in unsupervised classification (McLachlan and Peel 2000) and is defined as K , BIC(K) = log P(X; π θ K ) − 0.5(# parameters) × log n and where π θ are the ML estimates of π and θ. In the example of a HMM where each parameter θk has dimension D, there are K(K − 1) independent transition probabilities, so the total number of parameters is K(D + K − 1). In the context of classification, the fit of the model may not be the only desirable property to achieve. It is also important to account for the reliability of the classification which can be measured by the entropy of the conditional distribution H[P(Z|X)]. A large value of this entropy reveals that the classification is uncertain for a large part of the observation. Biernacki et al. (2000) defined the Integrated Completed Likelihood (ICL) criterion, which consists of adding this entropy to the penalty. Combined with the decomposition (2.18), this reduces to , ICL(K) = E[log P(X; π θ)|X] − 0.5(# parameters) × log n. Variable Selection When the clustering is based on a large set of descriptors (e.g. Xi ∈ Rd , d 1), the question of selecting the relevant descriptors is raised naturally. The distribution of relevant descriptors is supposed to change from one group to another, whereas irrelevant descriptors keep a constant distribution for all observations. If the labels were known, the problem would reduce to a class comparison problem (see Section 2.2). In the unsupervised context, it must be combined with the determination of the classes and this raises both theoretical and algorithmic issues (Raftery and Dean 2006; Maugis et al. 2009). Classification As explained above, the inference of latent-variable models provides the (approximate) conditional distribution of the labels P(Z|X). The posterior probability P(Zi = k|X) may seem sufficient as it provides a ‘fuzzy’ classification. This also informs us about the reliability of the classification: classification is clearly risky when all conditional probabilities are similar. When a formal classification is needed, the maximum a posteriori (MAP) strategy consists of classifying each observation in the class with highest conditional probability: i = arg max P(Zi = k|X). Z k
i } is not equal to the most probable set of It is worth noting that, in general, the set of most probable labels {Z labels Z. As an example, in an HMM, the most probable hidden path = arg max P(Z = z|X) Z z
can be retrieved via the Viterbi algorithm (Capp´e et al. 2005). It is not made from the succession of MAP i at each position. The difference is due to the distinction between the marginal classification of predictions Z one observation and the joint classification of all observations. The latter provides a path which is typically more consistent with the estimated transition probabilities than the former, which concentrates on the separate classification of each observation.
36 Handbook of Statistical Systems Biology
References Allison DB, Gadbury G, Heo M, Fernandez J, Lee CK, Prolla TA and Weindruch RA 2002 Mixture model approach for the analysis of microarray gene expression data. Comput. Statist. Data Anal. 39, 1–20. Ambroise C and McLachlan J 2002 Selection bias in gene extraction on the basis of microarray gene-expression data. Proc. Nat Acad. Sci. USA 99, 6562–6. Arlot S and Celisse A 2010 A survey of cross-validation procedures for model selection. Statist. Surv. 4, 40–79. Beal MJ and Ghahramani Z 2003 The variational Bayesian EM algorithm for incomplete data: with application to scoring graphical model structures. Bayes. Statist. 7, 543–52. Beal MJ, Falciani F, Ghahramani Z, Rangel C and Wild D 2005 A bayesian approach to reconstructing genetic regulatory networks with hidden factors. Bioinformatics 21(3), 349–56. Benjamini Y and Hochberg Y 1995 Controlling the false discovery rate: a practical and powerful approach to multiple testing. JRSSB 57(1), 289–300. Besag J 1974 Spatial interaction and the statistical analysis of lattice systems (with discussion). J. R. Statist. Soc. B 36(2), 192–326. Biernacki C, Celeux G and Govaert G 2000 Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Trans. Pattern Anal. Machine Intel. 22(7), 719–25. Blanchard G and Roquain E 2008 Two simple sufficient conditions for FDR control. Electron. J. Statist. 2, 963–92. Blanchard G and Roquain E 2009 Adaptive false discovery rate control under independence and dependence. J. Machine Learn. Res. 10, 2837–71. Breiman L 1996 Bagging predictors. Mach. Learn. 24, 123–40. Breiman L, Friedman J, Olshen R and Stone C 1984 Classification and Regression Trees. Wadsworth International, Belmont, CA. Burnham KP and Anderson RA 1998 Model Selection and Inference: a Practical Information-Theoretic Approach. John Wiley & Sons, Ltd, New York. Capp´e O, Moulines E and Ryd´en T 2005 Inference in Hidden Markov Models. Springer, Berlin. Celeux G and Diebolt J 1992 A stochastic approximation type EM algorithm for the mixture problem. Stochastics 1–2, 119–34. Celisse A and Robin S 2010 A cross-validation based estimation of the proportion of true null hypotheses. J. Statist. Planning Inference. 140, 3132–47. Cressie N 1993 Statistics for Spatial Data. John WIley & Sons, Ltd, New York. Daudin JJ, Picard F and Robin S 2008 A mixture model for random graphs. Stat. Comput. 18(2), 173–83. Delyon B, Lavielle M and Moulines E 1999 Convergence of a stochastic approximation version of the EM algorithm. Ann. Statist. 27(1), 94–128. Demindenko E 2004 Mixed Models: Theory and Applications. John Wiley & Sons, Ltd, Hoboken, NJ. Dempster AP, Laird NM and Rubin DB 1977 Maximum likelihood from incomplete data via the EM algorithm. J. R. Statist. Soc. B 39, 1–38. Dettling M and Buhlmann P 2002 Supervised clustering of genes. Genome Biol. 3(12), 1–15. Dettling M and Buhlmann P 2003 Boosting for tumor classification with gene expression data. Bioinformatics 19(9), 1061–1069. D’haeseleer P 2005 How does gene expression clustering work? Nat. Biotechnol. 23, 1499–501. Dietterich T 2000 An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Mach. Learn. 40(2), 139–57. Diggle P, Liang K and Zeger S 2002 Analysis of Longitudinal Data, 2nd edn. Oxford Science, London. Dobson AJ 1990 An Introduction to Generalized Linear Models. Chapman & Hall, London. Dudoit S, Shaffer JP and Boldrick JC 2003 Multiple hypothesis testing in microarray experiments. Stati. Sci. 18(1), 71–103. Durbin R, Eddy S, Krogh A and Mitchison G 1999 Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge. Efron B and Tibshirani R 1993 An Introduction to the Bootstrap. Chapman & Hall/CRC, Boca Raton, FL.
Statistical Methods for Complex Systems
37
Efron B, Tibshirani R, Storey JD and Tusher V 2001 Empirical Bayes analysis of a microarray experiment. J. Am. Statist. Assoc. 96, 1151–60. Fai A and Cornelius P 1996 Approximate F-tests of multiple degree of freedom hypotheses in generalized least squares analyses of unbalanced split-plot experiments. J. Stat. Comput. Simul. 54, 363–78. Fix E and Hodges J 1951 Discriminatory analysis, nonparametric discrimination: consistency properties. Technical Report 4, US Air Force, School of Aviation Medicine. Fix E and Hodges J 1952 Nonparametric discrimination: small sample performance. Technical Report 11, US Air Force, School of Aviation Medicine. Freund Y and Schapire R 1997 A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55, 119–39. Friedman J, Hastie T and Tibshirani R 1998 Additive logistic regression: a statistical view of boosting. Ann. Statist. 28, 2000. Friguet C, Kloareg M and Causeur D 2009 A factor model approach to multiple testing under dependence. J. Am. Statist. Assoc. 104(488), 1406–15. Genovese C and Wasserman L 2002 Operating characteristics and extensions of the fdr procedure. J. R. Statist. Soc. B 64(3), 499–517. Genovese C and Wasserman L 2004 A stochastic process approach to false discovery control. Ann. Statist. 32(3), 499–518. Golub TR, Slonim DK, Tamayo P, Huard C, Gaasenbeek M, Mesirov J, Coller H, Loh M, Downing J, Caligiuri M, Bloomfield C and Lander E 1999 Class prediction and discovery using gene expression data. Science 286, 531–7. Gunawardana A and Byrne W 2005 Convergence theorems for generalized alternating minimization procedures. J. Mach. Learn. Res. 6, 2049–73. Hastie T, Tibshirani R, Eisen M, Alizadeh A, Levy R, Staudt L, Chan W, Botstein D and Brown P 2000 ‘Gene shaving’ as a method for identifying distinct sets of genes with similar expression patterns. Genome Biol. 1(RESEARCH0003), 1–21. Hastie T, Tibshirani R and Friedman J 2001 The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, New York. Hue M, Riffle M, Vert J and Noble W 2010 Large-scale prediction of protein-protein interactions from structures. BMC Bioinformatics 11, 144. Jaakkola T 2000 Tutorial on variational approximation methods. In Advanced Mean Field Methods: Theory and Practice (eds Opper M and Saad D), pp. 129–59. MIT Press, Cambridge, MA. Jordan MI, Ghahramani Z, Jaakkola T and Saul LK 1999 An introduction to variational methods for graphical models. Mach. Learn. 37(2), 183–233. Kenward M and Roger J 1997 Small sample inference for fixed effects from restricted maximum likelihood. Biometrics 53, 983–97. Kerr MK and Churchill G 2001 Experimental design gene expression microarrays. Biostatistics 2, 183–201. Khuri A, Mathew T and Sinha B 1998 Statistical Tests for Mixed Linear Models. John Wiley & Sons, Ltd, New York. Kim KI and van de Wiel MA 2008 Effects of dependence in high-dimensional multiple testing problems. BMC Bioinformatics 9, 114. Langaas M, Lindqvist B and Ferkingstad E 2005 Estimating the proportion of true null hypotheses, with applications to DNA microarray data. J. R. Statist. Soc. B 67(4), 555–72. Lee S, Lee H, Abbeel P and Ng A 2006 Efficient L1 regularized logistic regression. AAAI. Luan Y and Li H 2003 Clustering of time-course gene expression data using a mixed-effects model with b-splines. Bioinformatics 19(4), 474–82. Mary-Huard T and Robin S 2009 Tailored aggregation for classification. IEEE Trans. Pattern Anal. Mach. Intell. 31, 2098–105. Mary-Huard T, Picard F and Robin S 2006 Introduction to statistical methods for microarray data analysis. In Mathematical and Computational Methods in Biology (eds Maass A, Martinez S and Pecou E), pp. 56–126. Hermann, Paris. Maugis C, Celeux G and Martin-Magniette ML 2009 Variable selection in model-based clustering: a general variable role modeling. Comput. Stat. Data Anal. 53(11), 3872–82. McLachlan G and Peel D 2000 Finite Mixture Models. John Wiley & Sons, Ltd, New York.
38 Handbook of Statistical Systems Biology McLachlan G, Bean R and Ben-Tovim Jones L 2006 A simple implementation of a normal mixture approach to differential gene expression in multiclass microarrays. Bioinformatics 22, 1608–15. Michiels S, Koscielny S and Hill C 2005 Prediction of cancer outcome with microarrays: a multiple random validation strategy. Lancet 365, 488–92. Nowicki K and Snijders T 2001 Estimation and prediction for stochastic block-structures. J. Am. Statist. Assoc. 96, 1077–87. Quinlan J 1993 C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc, San Francisco, CA. Raftery A and Dean N 2006 Variable selection for model-based clustering. J. Am. Statist. Assoc. 101(473), 168–78. Rapaport F, Barillot E and Vert J 2008 Classification of arraycgh data using fused svm. Bioinformatics. 24, i375–82. Robin S, Bar-Hen A, Daudin JJ and Pierre L 2007 A semi-parametric approach for mixture models: Application to local false discovery rate estimation. Comput. Statist. Data Anal. 51(12), 5483–93. SAS 2002-03 SAS OnlineDoc 9.1.3. support.sas.com/onlinedoc/913/. Schapire R 2002 The boosting approach to machine learning: an overview. In Nonlinear Estimation and Classification (eds Denison DD, Hansen MH, Holmes C, Mallick B and Yu B), pp. 149–72. Springer, Berlin. Schapire R, Freund Y, Bartlett P and Lee W 1998 Boosting the margin: a new explanation for the effectiveness of voting methods. Ann. Statist. 26(5), 1651–86. Sch¨olkopf B and Smola A 2002 Learning with Kernels. MIT Press, Cambridge, MA. Schwenk H and Bengio Y 1998 Training methods for adaptive boosting of neural networks. In Conference on Advances in Neural Information (ed. Cohn DA), pp. 647–53. Searle S 1971 Linear Models, 1st edn. John Wiley & Sons, Ltd, New York. Sokal RR and Sneath PHA 1963 Principles of Numerical Taxonomy. Freeman, San Francisco, CA. Storey JD 2002 A direct approach to false discovery rate. J. R. Statist. Soc. B 64(3), 479–98. Strimmer K 2008 fdrtool: a versatile R package for estimating local and tail area-based false discovery rates. Bioinformatics 24(12), 1461–2. Sun W and Cai TT 2008 Large-scale multiple testing under dependence. J. R. Statist. Soc. B 71(2), 393–424. Sutton CD 2005 Classification and regression trees, bagging, and boosting. In Handbook of Statistics: Data Mining and Data Visualization (eds Rao C, Wegman E and Solka J), pp. 303–29. Elsevier/North-Holland, Amsterdam. Tempelman RJ 2008 Statistical analysis of efficient unbalanced factorial designs for two-color microarray experiments. Int. J. Plant Genomics 2008, 584360. Tibshirani R 1996 Regression shrinkage and selection via the lasso. J. R. Statist. Soc B 58(1), 267–88. Tibshirani R and Wang P 2008 Spatial smoothing and hot spot detection for CGH data using the fused lasso. Biostatistics 9, 18–29. Vapnik V 1995 The Nature of Statistical Learning Theory. Springer Verlag, New York. Verbeke G and Molenberghs G 2000 Linear Mixed Models for Longitudinal Data. Springer Verlag, New York. Westfall PH and Young SS 1993 Resampling-Based Multiple Testing: Examples and Methods for P-value Adjustment. John Wiley & Sons, Ltd, New York. Winn JM and Bishop C 2005 Variational message passing. J. Mach. Learn. Res. 6, 661–94. Wolfinger RD, Gibson G, Wolfinger ED, Bennett L, Hamadeh H, Bushel P, Afshari C and Paules RS 2001 Assessing gene significance from cDNA microarray expression data via mixed models. J. Comput. Biol. 8(6), 625–37. Zhu J and Hastie T 2004 Classification of gene microarrays by penalized logistic regression. Biostatistics 5(3), 427–43. Zuur A, Ieno E, Walker N, Saveliev A and Smith G 2009 Mixed Effects Models and Extensions in Ecology with R. Springer, New York.
3 Bayesian Inference and Computation Christian P. Robert1,3 , Jean-Michel Marin2 and Judith Rousseau1,3
2
3.1
1 Universit´e Paris-Dauphine, CEREMADE, France Institut de Mathematiques et Modelisation de Montpellier, Universit´e de Montpellier 2, France 3 CREST and ENSAE, Malakoff, France
Introduction
This chapter provides a overview of Bayesian inference, mostly emphasising that it is a universal method for summarising uncertainty and making estimates and predictions using probability statements conditional on observed data and an assumed model (Gelman 2008). The Bayesian perspective is thus applicable to all aspects of statistical inference, while being open to the incorporation of information items resulting from earlier experiments and from expert opinions. We provide here the basic elements of Bayesian analysis when considered for standard models, referring to Marin and Robert (2007) and to Robert (2007) for book-length treatments.1 In the following, we refrain from embarking upon philosophical discussions about the nature of knowledge [see, e.g., Robert (2007) chapter 10] opting instead for a mathematically sound presentation of an eminently practical statistical methodology. We indeed believe that the most convincing arguments for adopting a Bayesian version of data analyses are in the versatility of this tool and in the large range of existing applications, rather than in those polemical arguments [for such perspectives, see, e.g., Jaynes (2003) and MacKay (2002)].
3.2
The Bayesian argument
3.2.1
Bases
We start this section with some notations about the statistical model that may appear to be over-mathematical but are nonetheless essential. 1 The
chapter borrows heavily from chapter 2 of Marin and Robert (2007).
Handbook of Statistical Systems Biology, First Edition. Edited by Michael P. H. Stumpf, David J. Balding and Mark Girolami. © 2011 John Wiley & Sons, Ltd. Published 2011 by John Wiley & Sons, Ltd.
40 Handbook of Statistical Systems Biology
Given an independent and identically distributed (i.i.d.) sample Dn = (x1 , . . . , xn ) from a distribution represented by its density fθ , with an unknown parameter θ ∈ , like the mean μ of the benchmark normal distribution, the associated likelihood function is (θ|Dn ) =
n
fθ (xi ).
i=1
This quantity is a fundamental entity for the analysis of the information provided about the parameter θ by the sample Dn , and Bayesian analysis relies on this function to draw inference on θ.2 Since all models are approximations of reality, the choice of a sampling model is wide-open for criticisms [see, e.g., Templeton (2008)], but those criticism go far beyond Bayesian modelling and question the relevance of completely built models for drawing inference or running predictions. We will therefore address the issue of model assessment later in the chapter. The major input of the Bayesian perspective, when compared with a standard likelihood approach, is that it modifies the likelihood – which is a function of θ – into a posterior distribution on the parameter θ – which is a probability distribution on defined by π(θ|Dn ) =
(θ|Dn )π(θ) . (θ|Dn )π(θ) dθ
(3.1)
The factor π(θ) in (3.1) is called the prior (often omitting the qualificative density) and it must be determined to start the analysis. A primary motivation for introducing this extra factor is that the prior distribution summarises the prior information on θ; that is, the knowledge that is available on θ prior to the observation of the sample Dn . However, the choice of π(θ) is often decided on practical or computational grounds rather than on strong subjective beliefs or on overwhelming prior information. As will be discussed later, there also exist less subjective choices, made of families of so-called noninformative priors. The radical idea behind Bayesian modelling is thus that the uncertainty on the unknown parameter θ is more efficiently modelled as randomness and consequently that the probability distribution π is needed on as a reference measure. In particular, the distribution Pθ of the sample Dn then takes the meaning of a probability distribution on Dn that is conditional on (the event that the parameter takes) the value θ, i.e. fθ is the conditional density of x given θ. The above likelihood offers the dual interpretation of the probability density of Dn conditional on the parameter θ, with the additional indication that the observations in Dn are independent given θ. The numerator of (3.1) is therefore the joint density on the pair (Dn , θ) and the (standard probability calculus) Bayes theorem provides the conditional (or posterior) distribution of the parameter θ given the sample Dn as (3.1), the denominator being called the marginal (likelihood) m(Dn ). There are many arguments which make such an approach compelling. When defining a probability measure on the parameter space , the Bayesian approach endows notions such as the probability that θ belongs to a specific region with a proper meaning and those are particularly relevant when designing measures of uncertainty like confidence regions or when testing hypotheses. Furthermore, the posterior distribution (3.1) can be interpreted as the actualisation of the knowledge (uncertainty) on the parameter after observing the data. At this early stage, we stress that the Bayesian perspective does not state that the model within which it operates is the ‘truth’, nor that it believes that the corresponding prior distribution π it requires has a connection with the ‘true’ production of parameters (since there may even be no parameter at all). It simply provides an inferential machine that has strong optimality properties under the right model and that can similarly be evaluated under any other well-defined alternative model. Furthermore, the Bayesian approach 2 Resorting
to an abuse of notations, we will also call (θ|Dn ) our statistical model, even though the distribution with the density fθ is, strictly speaking, the true statistical model.
Bayesian Inference and Computation
41
includes techniques to check prior beliefs as well as statistical models (Gelman 2008), so there seems to be little reason for not using a given model at an earlier stage even when dismissing it as ‘un-true’ later (always in favour of another model). 3.2.2
Bayesian analysis in action
The operating concept that is at the core of Bayesian analysis is that one should provide an inferential assessment conditional on the realised value of Dn , and Bayesian analysis gives a proper probabilistic meaning to this conditioning by allocating to θ a (reference) probability (prior) distribution π. Once the prior distribution is selected, Bayesian inference formally is ‘over’; that is, it is completely determined since the estimation, testing, prediction, evaluation, and any other inferential procedures are automatically provided by the prior and the associated loss (or penalty) function.3 For instance, if estimations θˆ of θ are evaluated via the quadratic loss function ˆ = θ − θ ˆ 2, L(θ, θ) the corresponding Bayes estimator is the expected value of θ under the posterior distribution, θˆ = E[θ|Dn ], for a given sample Dn . For instance, observing a frequency 38/58 of survivals among 58 breast-cancer patients and assuming a binomial B(58, θ) with a uniform U(0, 1) prior on θ leads to the Bayes estimate 1 58 38 θ 38 θ (1 − θ)20 dθ 38 + 1 θ = 0 1 58 = , 38 20 58 +2 0 38 θ (1 − θ) dθ since the posterior distribution is then a beta Be(38 + 1, 20 + 1) distribution. When no specific loss function is available, the posterior expectation is often used as a default estimator, although alternatives also are available. For instance, the maximum a posteriori (MAP) estimator is defined as θˆ = arg max π(θ|Dn ) = arg max π(θ)(θ|Dn ), θ
θ
(3.2)
where the function to maximise is usually provided in closed form. However, numerical problems often make the optimisation involved in finding the MAP estimator far from trivial. Note also here the similarity of (3.2) with the maximum likelihood (ML) estimator: The influence of the prior distribution π(θ) progressively disappears with an incrasing number of observations, and the MAP estimator recovers the asymptotic properties of the ML estimator. See Schervish (1995) for more details on the asymptotics of Bayesian estimators. As an academic example, consider the contingency table provided in Figure 3.1 on survival rate for breastcancer patients with or without malignant tumours, extracted from Bishop et al. (1975), the goal being to distinguish between the two types of tumour in terms of survival probability. We then consider each entry of the table on the number of survivors (first column of figures in Figure 3.1) to be independently Poisson distributed P(Nit θi ), where t = 1, 2, 3, denotes the age group, i = 1, 2, the tumour group, distinguishing between malignant (i = 1) and nonmalignant (i = 2), and Nit is the total number of patients in this age group and for this type of tumour (i.e. the sums of the rows). Therefore, denoting by xit the number of survivors in age group t and tumour group i, the corresponding prbability density is fθi (xit |Nit ) = e−θi Nit
3 Hence
(θi Nit )xit , xit !
the concept, introduced above, of a complete inferential machine.
x ∈ N.
4
5
42 Handbook of Statistical Systems Biology
above 70
2
3
survive yes no 77 10 51 13 51 11 38 20 7 3 6 3
1
50–69
malign no yes no yes no yes
0
age under 50
0.4 (a)
(b)
0.6
0.8 θ
1.0
1.2
Figure 3.1 (a) Data describing the survival rates of some breast-cancer patients (Bishop et al. 1975) and (b) representation of two gamma posterior distributions on the survival rates i differentiating between malignant (dashed, i = 1) versus nonmalignant (solid, i = 2) breast cancer survival rates
The corresponding likelihood on θi (i = 1, 2) is thus L(θi |D3 ) =
3
(θi Nti )xti exp{−θi Nti }
t=1
which, under an exponential θ ∼ Exp(2) prior with scale parameter 2, leads to the posterior x +x2i +x3i
π(θi |D3 ) ∝ θi 1i
exp {−θi (2 + N1i + N2i + N3i )}
i.e. a Gamma (x1i + x2i + x3i + 1, 2 + N1i + N2i + N3i ) distribution. The choice of the (prior) exponential parameter 2 corresponds to a prior estimate of 50% survival probability over the period.4 In the case of the nonmalignant breast cancers, the parameters of the (posterior) Gamma distribution are a = 136 and b = 161, while, for the malignant cancers, they are a = 96 and b = 133. Figure 3.1 shows the difference between both posteriors, the nonmalignant case being stochastically closer to 1, hence indicating a higher survival rate. [Note that the posterior in this figure gives some weight to values of θ larger than 1. This drawback can be fixed by truncating the exponential prior at 1 or even more easily by a beta-binomial modelling with a binomial B(Nit , θi ) distribution on the xit ’s and a beta Be(1/2, 1/2) prior on the θi ’s.] 3.2.3
Prior distributions
The selection of the prior distribution is an important issue in Bayesian modelling. When prior information is available about the data or the model, it can be used in building the prior, and we will see some illustrations of this recommendation in the following chapters. In many situations, however, the selection of the prior distribution is quite delicate in the absence of reliable prior information, and generic solutions must be chosen instead. Since the choice of the prior distribution can have a considerable influence on the resulting inference, this choice must be conducted with the utmost care. It is straightforward to come up with examples where a particular choice of the prior leads to absurd decisions. Before entering into a brief description of some 4 Once again, this is an academic example. The prior survival probability would need to be assessed by a physician in a real life situation.
Bayesian Inference and Computation
43
existing approaches of constructing prior distributions, note that, as part of model checking, every Bayesian analysis needs to assess the influence of the choice of the prior, for instance through a sensitivity analysis. Since the prior distribution models the knowledge (or uncertainty) prior to the observation of the data, the sparser the prior information is, the flatter the prior should be. There actually exists a category of priors whose primary aim is to minimise the impact of the prior selection on the inference; they are called noninformative priors and we will detail them below. When the sample model is from an exponential family of distributions5 with densities of the form fθ (x) = h(x) exp {θ · R(x) − (θ)} ,
θ, R(x) ∈ Rp ,
where θ · R(x) denotes the canonical scalar product in Rp , there exists an associated class of priors called the class of conjugate priors, of the form π(θ|ξ, λ) ∝ exp {θ · ξ − λ(θ)} , which are parameterised by two quantities, λ > 0 and ξ, the rescaled λξ being of the same nature as R(y). These parameterised prior distributions on θ are appealing for the simple computational reason that the posterior distributions are exactly of the same form as the prior distributions; that is, they can be written as π(θ|ξ (Dn ), λ (Dn )),
(3.3)
where (ξ (Dn ), λ (Dn )) is defined in terms of the sample of observations Dn (Robert 2007, section 3.3.3). Equation (3.3) simply says that the conjugate prior is such that the prior and posterior densities belong to the same parametric family of densities but with different parameters. In this conjugate setting, it is the parameters of the posterior density themselves that are ‘updated’, based on the observations, relative to the prior parameters, instead of changing the whole shape of the distribution. To avoid confusion, the parameters involved in the prior distribution on the model parameter are usually called hyperparameters. (They can themselves be associated with prior distributions, then called hyperpriors.) The computation of estimators, of confidence regions or of other types of summaries of interest on the conjugate posterior distribution often becomes straightforward. As a first illustration, note that a conjugate family of priors for the Poisson model is the collection of gamma distributions (a, b), since fθ (x)π(θ|a, b) ∝ θ a−1+x e−(b+1)θ leads to the posterior distribution of θ given X = x being the gamma distribution Ga(a + x, b + 1). [Note that this includes the exponential distribution Exp(2) used on the dataset of Figure 3.1. The Bayesian estimator of the average survival rate, associated with the quadratic loss, is then given by θˆ = (1 + x1 + x2 + x3 )/(2 + N1 + N2 + N3 ), the posterior mean.] As a further illustration, consider the case of the normal distribution N (μ, 1), which is indeed another case of an exponential family, with θ = μ, R(x) = x, and (μ) = μ2 /2. The corresponding conjugate prior for the normal mean μ is thus normal, N λ−1 ξ, λ−1 . This means that, when choosing a conjugate prior in a normal setting, one has to select both a mean and a variance a priori. (In some sense, this is the advantage of using a conjugate prior, namely that one has to select only a few parameters to determine the prior distribution. Conversely, the drawback of conjugate priors is 5 This
framework covers most of the standard statistical distributions, see Lehmann and Casella (1998) and Robert (2007). If this sounds too high a level of abstraction, consider the special cases of Poisson and normal distributions.
44 Handbook of Statistical Systems Biology
that the information known a priori on μ either may be insufficient to determine both parameters or may be incompatible with the structure imposed by conjugacy.) Once ξ and λ are selected, the posterior distribution on μ for a single observation x is determined by Bayes’ theorem, π(μ|x) ∝ exp(xμ − μ2 /2) exp(ξμ − λμ2 /2)
2 ∝ exp −(1 + λ) μ − (1 + λ)−1 (x + ξ) /2 , i.e. a normal distribution with mean (1 + λ)−1 (x + ξ) and variance (1 + λ)−1 . An alternative representation of the posterior mean is λ−1 1 x+ λ−1 ξ, 1 + λ−1 1 + λ−1
(3.4)
that is, a weighted average of the observation x and the prior mean λ−1 ξ. The smaller λ is, the closer the posterior mean is to x (under the additional assumption that λ−1 ξ remains fixed as λ goes to zero). The general case of an i.i.d. sample Dn = (x1 , . . . , xn ) from the normal distribution N (μ, 1) is processed in exactly the same manner, since xn is a sufficient statistic with normal distribution N (μ, 1/n): each 1 in (3.4) is then replaced with n−1 . The general case of an i.i.d. sample Dn = (x1 , . . . , xn ) from the normal distribution N (μ, σ 2 ) with an unknown θ = (μ, σ 2 ) also allows for a conjugate processing. The normal distribution does indeed remain an exponential family when both parameters are unknown. It is of the form
(σ 2 )−λσ −3/2 exp − λμ (μ − ξ)2 + α /2σ 2 since
π((μ, σ 2 )|Dn ) ∝ (σ 2 )−λσ −3/2 exp − λμ (μ − ξ)2 + α /2σ 2
×(σ 2 )−n/2 exp − n(μ − x)2 + sx2 /2σ 2
∝ (σ 2 )−λσ (Dn ) exp − λμ (Dn )(μ − ξ(Dn ))2 + α(Dn ) /2σ 2 ,
(3.5)
where sx2 = ni=1 (xi − x)2 . Therefore, the conjugate prior on θ is the product of an inverse gamma distribution on σ 2 , I G (λσ , α/2), and, conditionally on σ 2 , a normal distribution on μ, N (ξ, σ 2 /λμ ). The apparent simplicity of conjugate priors is however not a reason that makes them altogether appealing, since there is no further (strong) justification to their use. One of the difficulties with such families of priors is the influence of the hyperparameter (ξ, λ). If the prior information is not rich enough to justify a specific value of (ξ, λ), arbitrarily fixing (ξ, λ) = (ξ0 , λ0 ) is problematic, since it does not take into account the prior uncertainty on (ξ0 , λ0 ) itself. To improve on this aspect of conjugate priors, one solution is to consider a hierarchical prior, i.e. to assume that γ = (ξ, λ) itself is random and to consider a probability distribution with density q on γ, leading to θ|γ ∼ π(θ|γ) γ ∼ q(γ), as a joint prior on (θ, γ). The above is equivalent to considering, as a prior on θ π(θ|γ)q(γ)dγ. π(θ) =
Bayesian Inference and Computation
45
As a general principle, q may also depend on some further hyperparameters η. Higher order levels in the hierarchy are thus possible, even though the influence of the hyper(-hyper)-parameter η on the posterior distribution of θ is usually smaller than that of γ. But multiple levels are nonetheless useful in complex populations as those found in animal breeding (Sørensen and Gianola 2002). Instead of using conjugate priors, even when mixed with hyperpriors, one can opt for the so-called noninformative (or vague) priors (Robert et al. 2009) in order to attenuate the impact on the resulting inference. These priors are defined as refinements of the uniform distribution, which rigorously does not exist on unbounded spaces. A peculiarity of those vague priors is indeed that their density usually fails to integrate to one since they have infinite mass, i.e. π(θ)dθ = +∞,
and they are defined instead as positive measures, the first and foremost example being the Lebesgue measure on Rp . While this sounds like an invalid extension of the standard probabilistic framework – leading to their denomination of improper priors – it is quite correct to define the corresponding posterior distributions by (3.1), provided the integral in the denominator is defined, i.e. π(θ)(θ|Dn ) dθ = m(Dn ) < ∞. In some cases, this difficulty disappears when the sample size n is large enough. In others like mixture models (see also Section 3.3), the impossibility of using a particular improper prior may remain whatever the sample size is. It is thus strongly advised, when using improper priors in new settings, to check that the above finiteness condition holds. The purpose of noninformative priors is to set a prior reference that has very little bearing on the inference (relative to the information brought by the likelihood function). More detailed accounts are provided in Robert (2007, section 1.5) about this possibility of using σ-finite measures in settings where genuine probability prior distributions are too difficult to come by or too subjective to be accepted by all. While a seemingly natural way of constructing noninformative priors would be to fall back on the uniform (i.e. flat) prior, this solution has many drawbacks, the worst one being that it is not invariant under a change of parameterisation. To understand this issue, consider the example of a Binomial model: the observation x is a B(n, p) random variable, with p ∈ (0, 1) unknown. The uniform prior π(p) = 1 could then sound like the most natural noninformative choice; however, if, instead of the mean parameterisation by p, one considers the logistic parameterisation θ = log[p/(1 − p)] then the uniform prior on p is transformed into the logistic density π(θ) = eθ /(1 + eθ )2 by the Jacobian transform, which is not uniform. There is therefore a lack of invariance under reparameterisation, which in its turn implies that the choice of the parameterisation associated with the uniform prior is influencing the resulting posterior. This is generaly considered to be a drawback. Flat priors are therefore mostly restricted to location models x ∼ p(x − θ), while scale models x ∼ p(x/θ)/θ are associated with the log-transform of a flat prior, that is, π(θ) = 1/θ.
0
5
10
15
20
25
46 Handbook of Statistical Systems Biology
−0.10
−0.05
0.00
0.05
Figure 3.2 Two posterior distributions on a normal mean corresponding to the flat prior (solid) and a conjugate prior (dotted) for a dataset of 90 observations. Source: Marin and Robert (2007)
In a more general setting, the (noninformative) prior favoured by most Bayesians is the so-called Jeffreys’ (1939) prior, which is related to Fisher’s information I F (θ) by 1/2 πJ (θ) = I F (θ) , where |I| denotes the determinant of the matrix I. Since the mean μ of a normal model N(μ, 1) is a location parameter, the standard choice of noninformative prior is then π(μ) = 1 (or any other constant). Given that this flat prior formally corresponds to the choice λ = μ = 0 in the conjugate prior, it is easy to verify that this noninformative prior is associated with the posterior distribution N (x, 1). An interesting consequence of this remark is that the posterior density (as a function of the parameter θ) is then equal to the likelihood function, which shows that Bayesian analysis subsumes likelihood analysis in this sense. Therefore, the MAP estimator is also the ML estimator in that special case. Figure 3.2 provides the posterior distributions associated with both the flat prior on μ and the conjugate N (0, σˆ 2 /10) prior for a crime dataset discussed in Marin and Robert (2007). The difference between the two posteriors is still visible after 90 observations and it illustrates the impact of the choice of the hyperparameter (ξ, λ) on the resulting inference. 3.2.4
Confidence intervals
As should now be clear, the Bayesian approach is a complete inferential approach. Therefore, it covers among other things confidence evaluation, testing, prediction, model checking, and point estimation. Unsurprisingly, the derivation of the confidence intervals (or of confidence regions in more general settings) is based on the posterior distribution π(θ|Dn ). Since the Bayesian approach processes θ as a random variable and conditions upon the observables Dn , a natural definition of a confidence region on θ is to determine C(Dn ) such that π(θ ∈ C(Dn )|Dn ) = 1 − α
(3.6)
where α is either a predetermined level such as 0.05,6 or a value derived from the loss function (that may depend on the data). The important difference from a traditional perspective is that the integration here is done over the parameter space, rather than over the observation space. The quantity 1 − α thus corresponds to the probability that a 6 There
is nothing special about 0.05 when compared with, say, 0.87 or 0.12. It is just that the famous 5% level is adopted by most as an acceptable level of error.
Bayesian Inference and Computation
47
Figure 3.3 (a) Posterior distribution of the location parameter of a Cauchy sample for a N (0, 10) prior and corresponding 95% HPD region. Source: Marin and Robert (2007). (b) Representation of a posterior sample of 103 values of (, 2 ) for the normal model, x1 , . . . , x10 ∼ N(, 2 ) with x = 0, s2 = 1 and n = 10, under Jeffreys’ prior, along with the pointwise approximation to the 10% HPD region (darker shading). Source: Robert and Wraith (2009)
random θ belongs to this set C(Dn ), rather than to the probability that the random set contains the ‘true’ value of θ. Given this interpretation of a confidence set (called a credible set by Bayesians in order to stress this major difference with the classical confidence set), the determination of the best7 confidence set turns out to be easier than in the classical sense: It simply corresponds to the values of θ with the highest posterior values, C(Dn ) = {θ; π(θ|Dn ) ≥ kα } , where kα is determined by the coverage constraint (3.6). This region is called the highest posterior density (HPD) region. When the prior distribution is not conjugate, the posterior distribution is not necessarily so easily managed. For instance, if the normal N (μ, 1) distribution is replaced with the Cauchy distribution, C (μ, 1), in the likelihood n n n (μ|Dn ) = fμ (xi ) = 1 π (1 + (xi − μ)2 ), i=1
i=1
there is no conjugate prior available and we can consider a normal prior on μ, say N (0, 10). The posterior distribution is then proportional to n 2 ˜ (1 + (xi − μ)2 ). π(μ|D n ) = exp(−μ /20) i=1
˜ Solving π(μ|D n ) = k is not possible analytically, only numerically, and the derivation of the bound kα requires some amount of trial-and-error in order to obtain the correct coverage. Figure 3.3 gives the posterior distribution of μ for the observations x1 = −4.3 and x2 = 3.2. For a given value of k, a trapezoidal approximation can 7 In
the sense of offering a given confidence coverage for the smallest possible length/volume.
48 Handbook of Statistical Systems Biology
be used to compute the approximate coverage of the HPD region. For α = 0.95, a trial-and-error exploration of a range of values of k then leads to an approximation of kα = 0.0415 and the corresponding HPD region is represented in Figure 3.3(a). As illustrated in the above example, posterior distributions are not necessarily unimodal and thus the HPD regions may include several disconnected sets. This may sound counterintuitive from a classical point of view, but it must be interpreted as indicating indeterminacy, either in the data or in the prior, about the possible values of θ. Note also that HPD regions are dependent on the choice of the reference measure that defines the volume (or surface). The analytic derivation of HPD regions is rarely straightforward but, due to the fact that the posterior density is most often known up to a normalising constant, those regions can be easily derived from posterior simulations. For instance, Figure 3.3(b) illustrates this derivation in the case of a normal N(θ, σ 2 ) model with both parameters unknown and Jeffreys’ prior, when the sufficient statistics are x = 0 and s2 = 1, based on n = 10 observations.
3.3
Testing hypotheses
Deciding about the validity of some restrictions on the parameter θ or on the validity of a whole model – like whether or not the normal distribution is appropriate for the data at hand – is a major and maybe the most important component of statistical inference. Because the outcome of the decision process is clearcut, accept (coded by 1) or reject (coded by 0), the construction and the evaluation of procedures in this set-up are quite crucial. While the Bayesian solution is formally very close to a likelihood ratio statistic, its numerical values and hence its conclusions often strongly differ from the classical solutions. 3.3.1
Decisions
Without loss of generality, and including the set-up of model choice, we represent null hypotheses as restricted parameter spaces, namely θ ∈ 0 . For instance, θ > 0 corresponds to 0 = R+ . The evaluation of testing procedures can be formalised via the 0 − 1 loss that equally penalises all errors: If we consider the test of H0 : θ ∈ 0 versus H1 : θ ∈/ 0 , and denote by d ∈ {0, 1} the decision made by the researcher and by δ the corresponding decision procedure, the loss 1 − d if θ ∈ 0 , L(θ, d) = d otherwise, is associated with the Bayes decision (estimator) 1 if P π (θ ∈ 0 |x) > P π (θ ∈/ 0 |x), π δ (x) = 0 otherwise. This estimator is easily justified on an intuitive basis since it chooses the hypothesis with the largest posterior probability. The Bayesian testing procedure is therefore a direct transform of the posterior probability of the null hypothesis. 3.3.2
The Bayes factor
A notion central to Bayesian testing is the Bayes factor π B10 =
P π (θ ∈ 1 |x)/P π (θ ∈ 0 |x) , P π (θ ∈ 1 )/P π (θ ∈ 0 )
Bayesian Inference and Computation
49
which corresponds to the classical odds or likelihood ratio, the difference being that the parameters are integrated rather than maximised under each model. While it is a simple one-to-one transform of the posterior probability, it can be used for Bayesian testing without resorting to a specific loss, evaluating the strength of π the evidence in favour or against H0 by the distance of log10 (B10 ) from zero (Jeffreys 1939). This somehow ad-hoc perspective provides a reference for hypothesis assessment with no need to define the prior probabilities of H0 and H1 , which is one of the advantages of using the Bayes factor. In general, the Bayes factor does depend on prior information, but it can be perceived as a Bayesian likelihood ratio since, if π0 and π1 are the π prior distributions under H0 and H1 , respectively, B10 can be written as m1 (x) fθ (x)π1 (θ) dθ π = , B10 = 1 m0 (x) 0 fθ (x)π0 (θ) dθ thus replacing the likelihoods with the marginals under both hypotheses. By integrating out the parameters within each hypothesis, the uncertainty on each parameter is taken into account, which induces a natural penalisation for larger models, as intuited by Jeffreys (1939). The Bayes factor is connected with the Bayesian information criterion (BIC, see Robert 2007, chapter 5), with a penalty term of the form d log n/2, which makes the penalisation induced by Bayes factors in regular parametric models explicit. In a wide generality, the Bayes factor asymptotically corresponds to a likelihood ratio with a penalty of the form d ∗ log n∗ /2 where d ∗ and n∗ can be viewed as the effective dimension of the model and number of observations, respectively, see Berger et al. (2003) and Chambaz and Rousseau (2008). The Bayes factor therefore offers the major appeal that it does not require to compute a complexity measure (or penalty term) – in other words, to define what is d ∗ and what is n∗ – which often is quite complicated and may depend on the true distribution. 3.3.3
Point null hypotheses
At face value, testing a point null hypothesis, H0 : θ = θ0 , is essentially meaningless (how often can one distinguish θ = 0 from θ = 0.0001?). The prior reflects this difficulty in the construction of the Bayesian procedure, given that, for an absolutely continuous prior π, P π (θ = θ0 ) = 0. The only logical incorporation of the question within the inferential framework is indeed to consider it from a model choice perspective, namely whether or not the simpler model imposing that θ = θ0 is compatible with the observations. From this perspective, testing point null hypotheses naturally requires a modification of the prior distribution so that, when testing H0 : θ ∈ 0 versus H1 : θ ∈ 1 , π(0 ) > 0
and
π(1 ) > 0
hold, whatever the measures of 0 and 1 for the original prior, which means that the prior must be decomposed as π(θ) = P π (θ ∈ 0 ) × π0 (θ) + P π (θ ∈ 1 ) × π1 (θ) with positive prior probabilities on both 0 and 1 . Note that this modification makes sense from both informational and operational points of view. Given that H0 : θ = θ0 corresponds to a simpler (or more parsimonous) model, the fact that the hypothesis is tested implies that this simpler model is a possibile model and this fact brings some additional prior information on the model structure, hence by simplification on the parameter θ. In particular, if H0 is tested and accepted, this means that, in most situations, the (reduced) model under H0 should be used rather than the (full) model
50 Handbook of Statistical Systems Biology
considered previously. Thus, a prior distribution under the reduced model must be available from the start for potential later inference. (Formally, the fact that this later inference depends on the selection of H0 should also be taken into account.) In the special case 0 = {θ0 }, π0 is the Dirac mass at θ0 , denoted Iθ0 (θ), which simply means that P π0 (θ = θ0 ) = 1, and we need to introduce a separate prior weight of H0 , namely, ρ = P π (θ = θ0 )
and
π(θ) = ρIθ0 (θ) + (1 − ρ)π1 (θ).
Then, π(0 |x) =
fθ0 (x)ρ fθ0 (x)ρ = . fθ (x)π(θ) dθ fθ0 (x)ρ + (1 − ρ)m1 (x)
In the case when x ∼ N(μ, σ 2 ) and μ ∼ N(ξ, τ 2 ), consider the test of H0 : μ = 0. We can choose ξ equal to 0 if we do not have additional prior information. Then the Bayes factor is the ratio of marginals under both hypotheses, μ = 0 and μ = / 0, e−x /2(σ +τ m1 (x) σ = √ 2 2 f0 (x) σ 2 + τ 2 e−x /2σ 2
π B10 =
2
2)
and ⎡ 1−ρ π(μ = 0|x) = ⎣1 + ρ
σ2 exp σ2 + τ2
⎤ −1 τ 2 x2 ⎦ 2σ 2 (σ 2 + τ 2 )
is the posterior probability of H0 . Table 3.1 gives an indication of the values of the posterior probability when the normalised quantity x/σ varies. This posterior probability again depends on the choice of the prior variance τ 2 : The dependence is actually quite severe, as shown in the next section with the Jeffreys–Lindley paradox. 3.3.4
The ban on improper priors
Unfortunately, this decomposition of the prior distribution into two subpriors brings a serious difficulty related to improper priors, which amounts in practice to banning their use in testing situations. In fact, when using the representation π(θ) = P π (θ ∈ 0 ) × π0 (θ) + P π (θ ∈ 1 ) × π1 (θ), the probability weights P π (θ ∈ 0 ) and P π (θ ∈ 1 ) are meaningful only if π0 and π1 are normalised probability densities. Otherwise, they cannot be interpreted as weights. Table 3.1 Posterior probability of = 0 for different values of z = x/, = 1/2, and for = (top), 2 = 10 2 (bottom), when using a normal N(0, 2 ) prior on under the alternative z
0
0.68
1.28
1.96
( = 0|z) ( = 0|z)
0.586 0.768
0.557 0.729
0.484 0.612
0.351 0.366
Source: Marin and Robert (2007).
Bayesian Inference and Computation
51
Table 3.2 Posterior probability of H0 : = 0 for the Jeffreys’ prior 1 () = 1 under H1 . As explained in the text, these probabilities have no validity and should not be used x
0.0
1.0
1.65
1.96
2.58
( = 0|x)
0.285
0.195
0.089
0.055
0.014
Source: Marin and Robert (2007).
In the instance when x ∼ N(μ, 1) and H0 : μ = 0, the improper (Jeffreys’) prior is π1 (μ) = 1; if we write π(μ) =
1 1 I0 (μ) + · Iμ =/ 0 , 2 2
then the posterior probability is 1 e−x /2 √ = . 2 +∞ −(x−θ)2 /2 2 /2 −x 1 + 2πex /2 e + −∞ e dθ 2
π(μ = 0|x) =
A first consequence of this choice is that the posterior probability of H0 is bounded from above by √ π(μ = 0|x) ≤ 1/(1 + 2π) = 0.285. Table 3.2 provides the evolution of this probability as x goes away from 0. An interesting point is that the numerical values are close to the p-values used in classical testing (Casella and Berger 2001). If we are instead testing H0 : θ ≤ 0 versus H1 : θ > 0, then the posterior probability is 0 1 2 π(θ ≤ 0|x) = √ e−(x−θ) /2 dθ = (−x), 2π −∞ and the answer is now exactly the p-value found in classical statistics. The difficulty in using an improper prior also relates to what is called the Jeffreys–Lindley paradox, a phenomenon that shows that limiting arguments are not valid in testing settings. In contrast to estimation settings, the noninformative prior no longer corresponds to the limit of conjugate inferences. In fact, for a conjugate prior, the posterior probability ⎫ ⎧ ⎬−1 ⎨ σ2 τ 2 x2 1 − ρ0 exp π(θ = 0|x) = 1 + ⎩ ρ0 σ2 + τ2 2σ 2 (σ 2 + τ 2 ) ⎭ converges to 1 when τ goes to +∞, for every value of x, as√ already illustrated by Figure 3.4. This noninformative procedure differs from the noninformative answer [1 + 2π exp(x2 /2)]−1 above. The fundamental issue that bars us from using improper priors on one or both of the sets 0 and 1 is a normalising difficulty: If g0 and g1 are measures (rather than probabilities) on the subspaces 0 and 1 , the choice of the normalising constants influences the Bayes factor. Indeed, when gi is replaced by ci gi (i = 0, 1), where ci is an arbitrary constant, the Bayes factor is multiplied by c0 /c1 . Thus, for instance, if the Jeffreys’ prior is flat and g0 = c0 , g1 = c1 , the posterior probability ρ0 c0 0 fθ (x) dθ π(θ ∈ 0 |x) = ρ0 c0 0 fθ (x) dθ + (1 − ρ0 )c1 1 fθ (x) dθ is completely determined by the choice of c0 /c1 . This implies, for instance, that the function [1 + √ 2π exp(x2 /2)]−1 obtained earlier has no validity whatsoever. Hence, the numerical values found in Table 3.2
0.0
0.2
0.4
B10
0.6
0.8
1.0
52 Handbook of Statistical Systems Biology
1e−04
1e−02
1e+00
τ Figure 3.4 Range of the Bayes factor B10 when goes from 10−4 to 10. (Note: The x-axis is in logarithmic scale.) Source: Marin and Robert (2007)
are arbitrary, because they rely on the choice of an arbitrary pair of normalising constants, c0 = c1 = 1. The call to improper priors in settings where the same improper prior cannot be used under both hypotheses is therefore prohibited. (Note that the case of the test of μ > 0 against μ < 0 above escapes this prohibition.) Since improper priors are an important part of the Bayesian approach, there have been many proposals to overcome this ban. Most use a device that transforms the prior into a proper probability distribution by using a portion of the data Dn and then use the other part of the data to run the test as in a standard situation. The variety of available solutions is due to the many possibilities of removing the dependence on the choice of the portion of the data used in the first step. The resulting procedures are called pseudo-Bayes factors. See Robert (2007, chapter 5) for more details. 3.3.5
The case of nuisance parameters
In some settings, some parameters are shared by both hypotheses (or by both models) that are under comparison. Since they have the same meaning in each model, the above ban can be partly lifted and a common improper prior can be used on these parameters, in both models. For instance, consider a regression model, represented as y|X, β, σ ∼ N(Xβ, σ 2 In ),
(3.7)
where X denotes the (n, p) matrix of regressors – upon which the whole analysis is conditioned – y the vector of the n observations, and β is the vector of the regression coefficients. [This is a matrix representation of the repeated observation of yi = β1 xi1 + . . . + βp xip + σi
i ∼ N(0, 1),
when i varies from 1 to n.] Variable selection in this set-up means removing covariates, that is, columns of X, that are not significantly contributing to the expectation of y given X. In other words, this is about
Bayesian Inference and Computation
(Intercept) X1 X2 X3 X4 X5 X6 X7 X8 X9 X10
Estimate
BF
log10(BF)
9.2714 -0.0037 -0.0454 0.0573 -1.0905 0.1953 -0.3008 -0.2002 0.1526 -1.0835 -0.3651
26.334 7.0839 3.6850 0.4356 2.8314 2.5157 0.3621 0.3627 0.4589 0.9069 0.4132
1.4205 (***) 0.8502 (**) 0.5664 (**) -0.3609 0.4520 (*) 0.4007 (*) -0.4412 -0.4404 -0.3383 -0.0424 -0.3838
53
evidence against H0: (****) decisive, (***) strong, (**) substantial, (*) poor
Figure 3.5 R output of a Bayesian regression analysis on a processionary caterpillar dataset with 10 covariates analysed in Marin and Robert (2007). The Bayes factor on each row corresponds to the test of the nullity of the corresponding regression coefficient
testing whether or not a null hypothesis like H0 : β1 = 0 holds. From a Bayesian perspective, a possible noninformative prior distribution on the generic regression model (3.7) is the so-called Zellner’s (1986) gprior, where the conditional8 π(β|σ) prior density corresponds to a normal N(0, nσ 2 (XT X)−1 ) distribution on β, AT denoting the transposed matrix associated with A, and where a ‘marginal’ improper prior on σ 2 , π(σ 2 ) = σ −2 , is used to complete the joint distribution. While this construction of the prior may sound too artificial to allow for any meaningful interpretation, this is actually the closest one can get to an exchangeable prior on the components of Xβ due to the noninvertibility of X. The choice of the factor n in the scale amounts to weighting the prior informational input as much as the one from a single observation of the regression model. Obviously a further incentive for using this prior is that it allows for closed-form expressions (Marin and Robert 2007). With this default (or reference) prior modelling, and when considering the submodel corresponding to the null hypothesis H0 : β1 = 0, with parameters β−1 and σ, we can use a similar g-prior distribution T β−1 |σ, X ∼ N(0, nσ 2 (X−1 X−1 )−1 ),
where X−1 denotes the regression matrix missing the column corresponding to the first regressor, and σ 2 ∼ π(σ 2 ) = σ −2 . Since σ is a nuisance parameter in this case, we may use the improper prior on σ 2 as common to all submodels and thus avoid the indeterminacy in the normalising factor of the prior when computing the Bayes factor f (y|β−1 , σ, X)π(β−1 |σ, X−1 ) dβ−1 σ −2 dσ 2 B01 = f (y|β, σ, X)π(β|σ, X)dβ σ −2 dσ 2 Figure 3.5 reproduces a computer output from Marin and Robert (2007) that illustrates how this default prior and the corresponding Bayes factors can be used in the same spirit as significance levels in a standard 8 The fact that the prior distribution on β depends on the matrix of regressors X is not contradictory with the Bayesian paradigm of defining the prior distribution before observing the data, in that the whole model is defined conditional on X. The potential randomness of the regressors is not accounted for in this analysis.
54 Handbook of Statistical Systems Biology
regression model, each Bayes factor being associated with the test of the nullity of the corresponding regression coefficient. For instance, only the intercept and the coefficients of X1 , X2 , X4 , X5 are significant. This output mimics the standard lm R function outcome in order to show that the level of information provided by the Bayesian analysis covers at least the classical output. (We stress that all items in Figure 3.5 are obtained via closed-form formulae.) Obviously, this reproduction of a frequentist output is not the whole purpose of a Bayesian data analysis, quite the opposite: it simply reflects on the ability of a Bayesian analysis to produce automated summaries, just as in the classical case, but the inferential abilities of the Bayesian approach are considerably wider. [For instance, testing simultaneously the nullity of β3 , β6 , . . . , β10 is of identical difficulty, as detailed in Marin and Robert (2007, chapter 3). An example of inference simplified by the Bayesian approach is prediction, where the distribution of a future yi can be computed in closed form by integrating the parameters on the posterior.] 3.3.6
Bayesian multiple testing
Recently, massive multiple testings or comparisons has received attention, in frameworks such as gene expression data where it is of interest to detect genes that are differentially expressed among a (very) large number genes, or other types of applications, see for instance M¨uller et al. (2008) for an excellent review on the subject. Consider thus a large number, say m, of tests or comparisons to perform, which we write as γi = 0 if H0 is true and γi = 1 if H1 is true for i = 1, . . . , m. Typically i indexes the gene in gene expression data. As explained in Chapter 2, if all tests are performed independently with a fixed type one error, the number of false positive tests will increase with m which is often an undesirable feature. A natural way to take into account this multiplicity in a Bayesian framework is to build a global hierarchical model in the following way. Let zi denote some summary statistic for the ith test (gene), and assume that zi ∼ f0i and zi ∼ f1i under H1 , where both f0i and f1i possibly depend on parameters. For instance, zi ∼ N(θi , σ 2 ), where θi = 0 under H0 and θi = / 0 under H1 . In this example, the corresponding hierarchical model can be written as : (i = 1, . . . , m) iid
γi ∼ B(1, 1 − p0 ) zi |γi = 1 ∼ N(θi , σ ), zi |γi = 0 ∼ N(0, σ 2 ) σ 2 ∼ πσ . 2
i = 1, . . . , m iid
θi ∼ πθ (.)
In most cases the probability p0 that a hypothesis is null is unknown, so that in a fully Bayesian approach it is assumed to be distributed from a prior probability πp . An alternative is to use an empirical Bayesian approach by computing a frequentist estimate of p0 , see for instance Efron et al. (2001). As shown by Scott and Berger (2006), the individual posterior probabilities of H0 , pi = Pr[γi = 0|z], where z = (z1 , . . . , zm ), decrease, for a given zi , when the number of observations under the null (and m) increases, illustrating the fact that in the computation of the posterior probabilities pi , multiplicity is implicitly taken into account. However the pi depend heavily on the prior distribution πp , see Scott and Berger (2006) for numerical illustration of this dependence. Obviously other models can also be considered for f0 and f1 with possibly nonparametric models for f1 , and it is also possible to extend this model to cases where the zi are not assumed to be conditionally independent, see for instance Berry and Berry (2004) and Gopalan and Berry (1998). It is often of interest to decide which are the tests (genes) to accept (not differentially expressed) among the m different tests, it is then not enough to compute the pi and thresholds ti must be chosen so that a test is considered as significant if pi ≤ ti . We then set δi = 1 if pi ≤ ti and 0 otherwise. The choice of such threshold can be obtained by defining a loss function. In M¨uller et al. (2004), loss functions in the form: ¯ + FN, ¯ ¯ + FNR ¯ L(γ, z) = cFD L(γ, z) = cFDR
Bayesian Inference and Computation
55
¯ (respectively FNR) ¯ subject to FD ¯ ≤ α (respectively FDR) ¯ ¯ is the or minimising FN where FDR are considered, m m ¯ = m ¯ posterior expectation of the False Discovery Rate (FDR), i.e. FDR δ p / δ , FD = i=1 i i i=1 i i=1 δi pi , m −1 m ¯ = FN ¯ ¯ = i=1 (1 − δi )(1 − pi ) and FNR is the posterior expectation of the ratio of FN i=1 (1 − δi ) false negatives over the ratios of negatives, see also Chapter 2 for comments on these quantities. They all lead to decision rules in the form δi = 1 if and only if pi ≤ t, where the threshold t depends on the loss function. Alternative loss functions can and have been considered, see Scott and Berger (2006) and M¨uller et al. (2008) and the choice of the loss function is typically based on specific features and aims of the analysis under study.
3.4
Extensions
The above description of inference is only an introduction and is thus not representative of the wealth of possible applications resulting from a Bayesian modelling. We consider below three extensions inspired from Marin and Robert (2007). 3.4.1
Prediction
When considering a sample Dn = (x1 , . . . , xn ) from a given distribution, there can be a sequential or dynamic structure in the model that implies that future observations are expected. While more realistic modelling may involve probabilistic dependence between the xi , we consider here the simpler set-up of predictive distributions in i.i.d. settings. If xn+1 is a future observation from the same distribution fθ (·) as the sample Dn , its predictive distribution given the current sample is defined as f π (xn+1 |Dn ) =
f (xn+1 |θ, Dn )π(θ|Dn ) dθ =
fθ (xn+1 )π(θ|Dn ) dθ.
The motivation for defining this distribution is that the information available on the pair (xn+1 , θ) given the data Dn is summarised in the joint posterior distribution fθ (xn+1 )π(θ|Dn ) and the predictive distribution above is simply the corresponding marginal on xn+1 . This is nonetheless coherent with the Bayesian approach, which then considers xn+1 as an extra unknown. For the normal N (μ, σ 2 ) set-up, using a conjugate prior on (μ, σ 2 ) of the form
(σ 2 )−λσ −3/2 exp − λμ (μ − ξ)2 + α /2σ 2 , the corresponding posterior distribution on (μ, σ 2 ) given Dn is N
σ2 λμ ξ + nxn , λμ + n λμ + n
× I G λσ + n/2,
α + sx2
nλμ 2 (x − ξ) /2 , + λμ + n
denoted by ξ(Dn ), σ 2 /λμ (Dn ) × I G (λσ (Dn ), α(Dn )/2) ,
N
56 Handbook of Statistical Systems Biology
and the predictive on xn+1 is derived as f π (xn+1 |Dn ) ∝ (σ 2 )−λσ −2−n/2 exp −(xn+1 − μ)2 /2σ 2
× exp − λμ (Dn )(μ − ξ(Dn ))2 + α(Dn ) /2σ 2 d(μ, σ 2 )
∝ (σ 2 )−λσ −n/2−3/2 exp − (λμ (Dn ) + 1)(xn+1 − ξ(Dn ))2 # /λμ (Dn ) + α(Dn ) /2σ 2 dσ 2 −(2λσ +n+1)/2 λμ (Dn ) + 1 2 (xn+1 − ξ(Dn )) ∝ α(Dn ) + . λμ (Dn ) Therefore, the predictive of xn+1 given the sample Dn is a Student’s t distribution with mean ξ(Dn ) and 2λσ + n degrees of freedom. In the special case of the noninformative prior, λμ = λσ = α = 0 and the predictive is −(n+1)/2 n π . (xn+1 − xn )2 f (xn+1 |Dn ) ∝ sx2 + n+1 $ This is again a Student’s t distribution with mean xn , scale sx (n + 1)/n2 , and n degrees of freedom. 3.4.2
Outliers
Since normal modelling is often an approximation to the ‘real thing’, there may be doubts about its adequacy. As already mentioned above, we will deal later with the problem of checking that the normal distribution is appropriate for the whole dataset. Here, we consider the somehow simpler problem of assessing whether or not each point in the dataset is compatible with normality. There are many different ways of dealing with this problem. We choose here to take advantage of the derivation of the predictive distribution above: If an observation xi is unlikely under the predictive distribution based on the other observations, then we can argue against its distribution being equal to the distribution of the other observations. For each xi ∈ Dn , we consider fiπ (x|Dni ) as being the predictive distribution based on Dni = (x1 , . . . , xi−1 , xi+1 , . . . , xn ). Considering fiπ (xi |Dni ) or the corresponding cumulative distribution function (c.d.f.) Fiπ (xi |Dni ) (in dimension one) gives an indication of the level of compatibility of the observation with the sample. To quantify this level, we can, for instance, approximate the distribution of Fiπ (xi |Dni ) as uniform over [0, 1] since Fiπ (·|Dni ) converges to the true c.d.f. of the model. Simultaneously checking all Fiπ (xi |Dni ) over i may signal outliers. The detection of outliers must pay attention to the Bonferroni fallacy, which is that extreme values do occur in large enough samples. This means that, as n increases, we will see smaller and smaller values of Fiπ (xi |Dni ) even if the whole sample is from the same distribution. The significance level must therefore be chosen in accordance with this observation, for instance using a bound a on Fiπ (xi |Dni ) such that 1 − (1 − a)n = 1 − α, where α is the nominal level chosen for outlier detection. 3.4.3
Model choice
For model choice, i.e. when several models are under comparison for the same observation Mi : x ∼ fi (x|θi ),
i ∈ I,
Bayesian Inference and Computation
57
where I can be finite or infinite, the usual Bayesian answer is similar to the Bayesian tests as described above. The most coherent perspective (from our viewpoint) is actually to envision the tests of hypotheses as particular cases of model choices, rather than trying to justify the modification of the prior distribution criticised by Gelman (2008). This also incorporates within model choice the alternative solution of model averaging, proposed by Madigan and Raftery (1994), which strives to keep all possible models when drawing inference. The idea behind Bayesian model choice is to construct an overall probability on the collection of models ∪i∈I Mi in the following way: the parameter is θ = (i, θi ), i.e. the model index and given the model index equal to i, the parameter θi in model Mi , then the prior measure on the parameter θ is expressed as % % dπ(θ) = pi = 1. pi dπi (θi ), i∈Ii i∈I As a consequence, the Bayesian model selection associated with the 0–1 loss function and the above prior is the model that maximises the posterior probability pi fi (x|θi )πi (θi )dθi π(Mi |x) = % i pj fj (x|θj )πj (θj )dθj j
j
across all models. Contrary to classical plug-in likelihoods, the marginal likelihoods involved in the above ratio do compare on the same scale and do not require the models to be nested. As mentioned in Section 3.3.5 integrating out the parameters θi in each of the models takes into account their uncertainty thus the marginal likelihoods i fi (x|θi )πi (θi )dθi are naturally penalised likelihoods. In most parametric set-ups, when the number of parameters does not grow to infinity with the number of observations and when those parameters are identifiable. the Bayesian model selector as defined above is consistent, i.e. with increasing numbers of observations, the probability of choosing the right model goes to 1.
3.5
Computational issues
The computational challenge offered by Bayesian inference has led to a specific branch of Bayesian statistics addressing these issues. In particular, the past twenty years have witnessed a tremendous and healthy surge in computational Bayesian statistics, due to the development of powerful approximation methods like Markov chain Monte Carlo (MCMC), sequential Monte Carlo (SMC), and approximate Bayesian computation (ABC) techniques. To some extent, this branch of Bayesian statistics is now so intricately connected with Bayesian inference that some notions like Bayesian model choice (Section 3.4.3) and Bayesian model comparison hardly make sense without it. In this final section, we briefly present simulation-based computational methods. For comprehensive entries on those methods, we refer the reader to Chen et al. (2000), Liu (2001) and Robert and Casella (2004, 2009), pointing out that books like Albert (2009) and Marin and Robert (2007) encompass both Bayesian inference and computational methodologies in a single unifying perspective. 3.5.1
Computational challenges
While the previous sections illustrated the Bayesian paradigm through simple closed-form examples, this is not feasible for the majority of problems handled by Bayesian methodology. Complex models essentially
58 Handbook of Statistical Systems Biology
do not allow for closed-form expressions and they require alternative ways of exploration of the posterior distributions, most of which are based upon (computer generated) simulation. A first and most obvious level of difficulty corresponds to the case when the quantity of interest does not allow for an analytic expression. This situation even occurs with standard conjugate priors, as shown in Section 3.2.4 with the issue of the derivation of a credible region where we were ‘forced’ to mention simulation before this dedicated section. (The proposed numerical solution usually is quite easy to construct once a simulation method is implemented.) More generally, any mildly complex transform of the parameters will not enjoy a closed-form posterior expectation (Section 3.2.2). For instance, the computation of Bayes factors requires the use of specific computational techniques like path sampling and bridge sampling [see Marin and Robert (2010) for details]. A second common level of difficulty corresponds to the case when the posterior distribution is not a standard distribution. This is essentially the case for all nonconjugate situations (Section 3.2.3). In such settings, the derivation of almost any summary related with the posterior distribution involves a numerical step, which can be stochastic or deterministic. For instance, the analysis of the regression model (3.7) under Zellner’s (1986) g-prior led to closed-form expressions in Section 3.3.5, in particular for the Bayes factors. If, instead, we consider the case of the generalised linear models, this facility disappears. We recall that those models (McCullagh and Nelder 1989) assume a dependence of y on x that is partly linear y|x, β ∼ f (y|xT β, φ), where φ > 0 is a dispersion parameter that does not depend on x. The posterior distribution of (β, φ) given (X, y): π(β, φ|X, y) ∝
n
f yi |xiT β, φ π(β, φ|X)
(3.8)
i=1
is never available as a standard distribution outside the normal linear model, even when using Marin and Robert (2007) generalised g-prior, −1 . β|X ∼ N 0, n XT X For instance, a standard statistical model corresponding to this case is the probit model P(Y = 1|x) = 1 − P(Y = 0|x) = (xT β), where denotes the standard normal cumulative distribution function. The corresponding posterior distribution π(β|X)
n
(xiT β)yi (−xiT β)1−yi ,
(3.9)
i=1
is available in closed form, up to the normalising constant, but it is not a standard distribution and thus it cannot be easily handled. A third level of difficulty could be called ‘engorging’ in that we are faced with many cases, each of which is easily handled, but in such a number that the exhaustive examination of all cases is impossible. The most common illustration of this type of difficulty is model choice, described in Section 3.4.3, and in particular variable selection. Indeed, when considering a regression model like (3.7), if we try to compare all possible subsets of covariates as in Section 3.3.5, handling p regressors implies that 2p models are under comparison. Even with closed-form expressions for the evidence, the exploration of the model space is clearly impossible when contemplating 30 or more covariates.
Bayesian Inference and Computation
59
A fourth and final level of difficulty occurs when the likelihood function is itself unavailable. The reason for the difficulty may be that the computation time of one single value of the likelihood function requires several seconds, as in the cosmology analysis of Wraith et al. (2009) where the likelihood is represented by a computer program. It may also be that the only possible representation of the likelihood function is as an integral or a sum over a possibly large number of latent variables corresponding to a joint (unobserved) likelihood, as for instance in stochastic volatility models (Jacquier et al. 1994; Chib et al. 2002) which include as many latent variables as observations. Another illustration is provided by phylogenetic trees (Beaumont et al. 2002; Cornuet et al. 2008), where the likelihood is obtained as a sum over all possible ancestral trees. A different setting occurs when the likelihood function is missing a normalising term that cannot be reconstituted by completion and thus requires a custom-built solution. This is the case of Gaussian random fields, found in spatial statistics and image analysis, where distributions of the form & n ' %% Z(β) Iyi =y k f (y|X, β) = exp β i=1 ∼i
over a finite space of labels yi ∈ {1, . . . , G} involve a normalising constant Z(β) that cannot be computed, due to the Gn terms in the summation. (The symbol ∼ i means that the individuals i and are neighbours for a predefined neighbourhood relation denoted by ∼.) 3.5.2
Monte Carlo methods
The generic approach for solving computational problems related with Bayesian analysis is to use simulation, i.e. to produce via a computer program a sample from the posterior distribution and to use the simulated sample to approximate the procedures of interest. This approach goes under the generic name of Monte Carlo methods. Recall that a standard Bayesian estimate of a transform h(θ) of the parameter is the posterior expectation of this function I= h(θ)π(θ|y) dθ.
There is therefore a general requirement for computing integrals in an efficient manner. The standard Monte Carlo approximation of I is given by N 1 % (i) MC = h θ , I N i=1
where the θ (i) are generated from the posterior distribution π(θ|y). For instance, the approximation of a credible region alluded to in Section 3.2.4 used this approach. When given a sample from π(θ|y), the θi corresponding to the α% highest values of π(θ|y) provide an approximation both to the α level of the posterior density and to the localisation of the HPD region. Figure 3.3 shows how such an approximate HPD region can be constructed. [More details can be found in, e.g., Marin and Robert (2010).] MC converges to I and the speed of When the computing effort N grows to infinity, the approximation I √ convergence is 1/ N if h is square-integrable against π(θ|y) (Robert and Casella 2004). The assessment of this convergence relies on the Central Limit Theorem, as described in Robert and Casella (2009, chapter 4). When the posterior distribution π(θ|y) is not a standard distribution, producing simulations from this distribution may prove challenging. There however exists a simple generalisation to the basic Monte Carlo method that avoids this difficuly. This generalisation stems from an alternative representation of the above integral I, changing both the integrating density and the integrand: h(θ)π(θ|y) g(θ) dθ, (3.10) I= g(θ)
60 Handbook of Statistical Systems Biology
where the support of the posterior distribution π(·|y) is included in the support of g(·). The corresponding importance sampling approximation of I is given by N 1 % (i) (i) IS , Ig = ω h θ N
(3.11)
i=1
( where the ωi are the importance weights, ω(i) = π θ (i) |y g θ (i) , While the representation (3.10) holds in wide generality (the only requirement is the constraint on the support of g(·)), the choice of g(·) is fundamental to provide good approximations of I. Poor choices of g(·) lead to unreliable approximations: for instance, if h2 (θ)ω2 (θ)g(θ)dθ
is infinite, the variance of the estimator (3.11) is also infinite (Robert and Casella 2009, chapters 3 and 4) and then (3.11) cannot be used for approximation purposes. As noted in the above, a common feature in Bayesian integration is that the normalising constant of the IS Ig cannot be used and they posterior distribution cannot be computed in closed form. In that case, ω(i) and are replaced by the unnormalised version ω(i) = m(y)π(θ (i) |y)/g(θ (i) ) and by the self-normalised version SNIS Ig =
N %
N % ω(i) h θ (i) ω(i) ,
i=1
i=1
respectively. The self-normalised estimator also converges to I since constant m(y). The weights (i = 1, . . . , T ) ω(i) = ω(i)
N (%
N
i=1 ω
(i)
converges to the normalising
ω(j)
j=1
are then called normalised weights. In general, importance sampling techniques require a rather careful tuning to be of any use, especially in large dimensions. For instance, using a normal distribution centred at the ML estimator of β and scaled by the asymptotic variance of the ML estimator does provide a (very) good approximation in the probit case (Marin and Robert 2010) but this is rarely the case. While MCMC methods (Section 3.5.3) are a ready-made solution to this problem, given that they can break the global distribution into distributions with smaller dimensions, the recent literature has witnessed a fundamental extension of importance sampling techniques that adaptively calibrates some importance functions towards more similarity with the target density (Capp´e et al. 2004, 2008; Del Moral et al. 2006; Douc et al. 2007). This extension is called sequential Monte Carlo (SMC) because it evolves along a time axis either through the target distributions – as in regular sequential statistical problems where the sample size increases – or through the importance functions. Another common name is population Monte Carlo (PMC), following Iba (2000), because this technique produces populations rather than points.9 Although the idea has connections 9 This simulated population is then used to devise new and, it is hoped, improved importance (or proposal) functions at the next time step.
Bayesian Inference and Computation
61
with the earlier particle filter literature (Gordon et al. 1993; Doucet et al. 2001), the main principle of this method is to build a sequence of increasingly better proposal distributions through a sequence of simulated samples (which thus behave like populations). The performance criterion may be the entropy divergence from the target distribution or the variance of the corresponding estimator of a fixed integral. Given that the validation of the technique is still based on sampling importance resampling principles, the resulting dependence on past samples can be arbitrarily complex, while the approximation to the target remains valid (unbiased) at each iteration. A quick description of the SMC algorithm is as follows. Starting from an initial sample, (θi,0 ) 1 ≤ i ≤ N, generated from q0 , importance weights ωi,0 = π(θi,0 |y)/q0 (θi,0 ) are computed to resample the θi,0 . A new importance function qi,1 is constructed for each resampled θ˜ i,0 and a new importance sample is then generated, with weights ωi,t = π(θi,t |y)/qi,t (θi,t ), the processes being iterated until some stability is achieved. [The weights can be modified towards more stability, as in Del Moral et al. (2006).] While the SMC algorithm does appear as a repeated (or sequential) sampling importance resampling algorithm (Rubin 1988), the major modification is the open choice of the new proposals qit , since qit can depend on all past simulated samples as well as on the index of the currently simulated value. For instance, in Capp´e et al. (2008), mixtures of standard kernels are used with an update of the weights and of the parameters of those kernels at each iteration in such a way that the entropy distance of the corresponding importance sampling estimator to the target are decreasing from one iteration to the other. [Adopting a different goal, Andrieu et al. (2010) integrate the particle updating within an MCMC setting.]
3.5.3
MCMC methods
Given the difficulties involved in constructing an efficient importance function in complex settings, and in particular in large dimensions, an alternative of considerable interest is offered by the MCMC methods (Gelfand and Smith 1990; Robert and Casella 2004, 2009; Marin and Robert 2007). Those methods try to overcome some of the limitations of regular Monte Carlo strategies by simulating a Markov chain with stationary (and limiting) distribution the target distribution.10 There exist fairly generic ways of producing such chains, including the Metropolis–Hastings and Gibbs algorithms defined below. Besides the theoretical fact that stationarity of the target distribution is enough to justify a simulation method by Markov chain generation, the idea at the core of MCMC algorithms is that local exploration, when properly weighted, can lead to a valid (global) representation of the distribution of interest. This includes for instance using only component-wise (and hence small-dimensional) simulations – that escape (to some extent) the curse of dimensionality – as in the Gibbs sampler. The Metropolis–Hastings algorithm truly is the generic MCMC method in that it offers a straightforward and universal solution to the problem of simulating from an arbitrary11 posterior distribution π(θ|x) ∝ f (y|θ) π(θ): starting from an arbitrary point θ0 , the corresponding Markov chain explores the surface of this posterior distribution using an instrumental Markov proposal θ ∼ q(θ|θ (t−1) ) and, in principle, it progressively visits the whole range of the possible values of θ. This internal Markov kernel should be irreducible with respect to the target distribution [that is, the Markov chain associated with the proposal q(·|·) should be able to visit the whole support of the target distribution in a finite number of steps]. The reason why the resulting chain does converge to the target distribution despite the arbitrary choice of q(θ|θ (t−1) ) is that the proposed values θ are 10 The theoretical foundations of MCMC algorithms are both sound and simple: as stressed by Tierney (1994) and Mengersen and Tweedie (1996), the existence of a stationary distribution almost immediately validates the principle of a simulation algorithm based on a Markov chain, i.e. does not create a fundamental difference with the i.i.d. case. 11 The only restriction is that this function is known up to a normalising constant.
62 Handbook of Statistical Systems Biology
sometimes rejected by an accept-reject step associated with the probability π(θ )f (y|θ )q(θ (t−1) |θ ) . π(θ (t−1) f (y|θ (t−1) )q(θ |θ (t−1) ) When the proposed value θ is rejected, the chain is extended as θ (t) = θ(t−1) . A rather common choice for q(θ|θ (t−1) ) is the random walk proposal: q(θ|θ (t−1) ) = g(θ − θ (t−1) ) with a symmetric function g, which provides a simplified acceptance probability ( π(θ )f (y|θ ) π(θ (t−1) )f (y|θ (t−1) ). This particular choice ensures that values θ that are more likely than the current θ (t−1) for the posterior distribution are always accepted while values that are less likely are sometimes accepted. Finding the proper scale for the random walk is not always straightforward and asymptotic normal approximations to the posterior distribution may be very inefficient proposals. While the Metropolis–Hastings algorithm recovers better from facing large-dimensional problems than standard importance sampling techniques, this still is a strong limitation to its use in large-dimensional set-ups. Considering again the probit ˆ of the ML model of Section 3.5.1, the random walk proposal using the asymptotic covariance matrix estimator as the scale, ˆ β ∼ N2 (β(t−1) , ), produces very decent performances, as described in Marin and Robert (2007). In contrast, the alternative Gibbs sampler is an attractive algorithm that caters to large-dimensional problems because it naturally fits the hierarchical structures often present in Bayesian models and more generally in graphical and latent variable models. The fundamental strength (and appeal) of the Gibbs sampler is its ability to break a joint target distribution like π(θ1 , . . . , θp |y) in the corresponding conditional distributions πi (θi |y, θ−i ) (i = 1, . . . , n) and to simulate successively from these low-dimensional targets: (t) (t−1) θ1 ∼ π1 θ1 |y, θ−1 (t) (t) (t−1) θ2 ∼ π2 θ2 |y, θ1 , θ−(1:2) .. .
(t) θp(t) ∼ πp θp |y, θ(1:(p−1)) While this algorithm may seem restricted to hierarchical multidimensional models, the special case of the slice sampler (Robert and Casella 2004, chapter 8) shows that the Gibbs sampler applies in a wide variety of models. See Robert and Casella (2004, chapters 9 and 10) for a detailed coverage of the implementation and tuning of the Gibbs sampler. The difficulty with the model explosion in variable selection (Section 3.5.1) can be handled naturally via a Gibbs sampler that considers each variable indicator (variable in the model or not) conditional on the others, as illustrated in Marin and Robert (2007, chapter 4). Mixing Metropolis–Hastings and Gibbs algorithms often results in better performances like faster convergence of the resulting Markov chain, the former algorithm being often used for global exploration of the target and the latter for local improvement. A classic hybrid algorithm replaces a nonavailable Gibbs update by a Metropolis–Hastings step. Another hybrid solution alternates Gibbs and Metropolis–Hastings proposals. The corresponding algorithms are valid: they produce ergodic Markov chains with the posterior target as stationary distribution.
Bayesian Inference and Computation
63
Learning about the specificities of the target distribution while running an MCMC algorithm and thus tuning the proposal accordingly, i.e. constructing an adaptive MCMC procedure, is difficult because this cancels the Markov property of the original method and thus jeopardizes convergence. Similarly, using an on-line scaling of the algorithm against the empirical acceptance rate in order to reach a golden number like 0.234 (Roberts and Rosenthal 2009) is inherently flawed in that the attraction of a modal region may give a false sense of convergence and may thus lead to a choice of too small a scale, simply because other modes will fail to be visited during the scaling experiment. However, there are algorithms that preserve ergodicity (convergence to the target) while implementing adaptivity. For instance, Roberts and Rosenthal (2007) consider basic ergodicity properties of adaptive MCMC algorithms under minimal assumptions, using coupling constructions. They prove convergence in distribution and a weak law of large numbers. Moreover, Roberts and Rosenthal (2009) investigate the use of adaptive MCMC algorithms to automatically tune the Markov chain parameters during a run. Examples include the adaptive Metropolis multivariate algorithm of Haario et al. (2001), Metropolis-within-Gibbs algorithms for nonconjugate hierarchical models, regionally adjusted Metropolis algorithms, and logarithmic scalings. Roberts and Rosenthal (2009) present some computer simulation results that indicate that the algorithms perform very well compared with nonadaptive algorithms, even in high dimensions. 3.5.4
Approximate Bayesian computation techniques
As mentioned above, there exist situations where the likelihood function f (y|θ) is too expensive or impossible to calculate, but where simulations from the density f (y|θ) can be produced in a reasonable time. An illustration is given by inverse problems where computing the function f (y|θ) for a given pair (y, θ) involves solving a complex numerical equation. In such cases, it is almost impossible to use the computational tools presented in the previous sections to sample from the posterior distribution π(θ|y). Approximate Bayesian computation (ABC) is an alternative to such techniques that only requires being able to sample from the likelihood f (·|θ). It was first proposed for population genetic models (Beaumont et al. 2002) but applies in much wider generality (see e.g. Chapter 18). The algorithm produces samples from the joint distribution π(θ)f (z|θ) and only accepts the simulations such that z is close enough to the observation y, ρ(η(z), η(y)) ≤ , where η is a summary statistic, ρ is a distance and is a tolerance level – all of three being arbitrarily chosen by the statistician. This ‘likelihood-free algorithm’, also called ABC, thus samples from the marginal in z of the following joint distribution: π (θ, z|y) ∝ π(θ)f (z|θ)Iρ(η(z),η(y))≤ The idea behind ABC (Beaumont et al. 2002) is that the summary statistics coupled with a small tolerance should provide a good approximation of the posterior distribution: π (θ|y) = π (θ, z|y)dz ≈ π(θ|y) if is small enough (but not too small to keep some simulations within the sample). In many examples, including phylogenetic, this is the only solution that can be implemented (Cornuet et al. 2008), at the expense of shying away from exact simulation. Both Grelaud et al. (2009) and Ratmann et al. (2009) consider the use of this approximation step to run model comparison in otherwise untractable models. Various sequential Monte Carlo algorithms have been constructed as extensions to the original ABC method. For instance, Beaumont et al. (2009) proposed an ABC version of the PMC algorithm presented above. The key idea is to decompose the difficult issue of sampling from π (θ, z|y) into a series of simpler subproblems. The algorithm begins at time 0 sampling from π0 (θ, z|y) with a large value 0 which means simulating almost from the prior, then simulating from an increasing difficult sequence of target distribution πt (θ, z|y), that is when t < t−1 . Illustrations of this technique are provided in Beaumont et al. (2009) both at the methodological and at the application level.
64 Handbook of Statistical Systems Biology
Acknowledgements The authors are most grateful to David Balding for his advice during the preparation of this chapter. This work had been partly supported by the Agence Nationale de la Recherche (ANR, 212 rue de Bercy, 75012 Paris, France) through the 2009–12 projects Big’MC and EMILE.
References Albert J 2009 Bayesian Computation with R, 2nd edn. Springer-Verlag, New York. Andrieu C, Doucet A and Holenstein R 2010 Particle Markov chain Monte Carlo (with discussion). J. R. Statist. Soc. B 72(3), 269–342 Beaumont M, Zhang W and Balding D 2002 Approximate Bayesian computation in population genetics. Genetics 162, 2025–2035. Beaumont M, Cornuet JM, Marin JM and Robert C 2009 Adaptive approximate Bayesian computation. Biometrika 96(4), 983–990. Berger J, Ghosh J and Mukhopadhyay N 2003 Approximations to the Bayes factor in model selection problems and consistency issues. J. Statist. Plan. Inference 112, 241–258. Berry S and Berry D 2004 Accounting for multiplicities in assessing drug safety: A three-level hierarchical mixture model. Biometrics 60, 418–426. Bishop YMM, Fienberg SE and Holland PW 1975 Discrete Multivariate Analysis: Theory and Practice. MIT Press, Cambridge, MA. Capp´e O, Guillin A, Marin JM and Robert C 2004 Population Monte Carlo. J. Comput. Graph. Statist. 13(4), 907–929. Capp´e O, Douc R, Guillin A, Marin JM and Robert C 2008 Adaptive importance sampling in general mixture classes. Statist. Comput. 18, 447–459. Casella G and Berger R 2001 Statistical Inference, 2nd edn. Wadsworth, Belmont, CA. Chambaz A and Rousseau J 2008 Bounds for Bayesian order identification with application to mixtures. Ann. Statist. 36, 938–962. Chen M, Shao Q and Ibrahim J 2000 Monte Carlo Methods in Bayesian Computation. Springer-Verlag, New York. Chib S, Nadari F and Shephard N 2002 Markov chain Monte Carlo methods for stochastic volatility models. J. Econometrics 108, 281–316. Cornuet JM, Santos F, Beaumont MA, Robert CP, Marin JM, Balding DJ, Guillemaud T and Estoup A 2008 Inferring population history with DIYABC: a user-friendly approach to Approximate Bayesian Computation. Bioinformatics 24(23), 2713–2719. Del Moral P, Doucet A and Jasra A 2006 Sequential Monte Carlo samplers. J. R. Statist. Soc. B 68(3), 411–436. Douc R, Guillin A, Marin JM and Robert C 2007 Convergence of adaptive mixtures of importance sampling schemes. Ann. Statist. 35(1), 420–448. Doucet A, de Freitas N and Gordon N 2001 Sequential Monte Carlo Methods in Practice. Springer-Verlag, New York. Efron B, Tibshirani R, Storey J and Tusher V 2001 Empirical bayes analysis of a microarray experiment. J. Am. Statist. Assoc. 96, 185–198. Gelfand A and Smith A 1990 Sampling based approaches to calculating marginal densities. J. Am. Statist. Assoc. 85, 398–409. Gelman A 2008 Objections to Bayesian statistics. Bayesian Anal. 3(3), 445–450. Gopalan R and Berry D 1998 Bayesian multiple comparisons using dirichlet process priors. J. Am. Statist. Assoc. 93, 1130–1139. Gordon N, Salmond J and Smith A 1993 A novel approach to non-linear/non-Gaussian Bayesian state estimation. IEEE Proc. Radar Signal Process. 140, 107–113. Grelaud A, Marin JM, Robert C, Rodolphe F and Tally F 2009 Likelihood-free methods for model choice in Gibbs random fields. Bayesian Anal. 3(2), 427–442. Haario H, Saksman E and Tamminen J 2001 An adaptive Metropolis algorithm. Bernoulli 7(2), 223–242.
Bayesian Inference and Computation
65
Iba Y 2000 Population-based Monte Carlo algorithms. Trans. Jpn Soc. Artif. Intell. 16(2), 279–286. Jacquier E, Polson N and Rossi P 1994 Bayesian analysis of stochastic volatility models (with discussion). J. Bus. Econ. Stat. 12, 371–417. Jaynes E 2003 Probability Theory. Cambridge University Press, Cambridge. Jeffreys H 1939 Theory of Probability, 1st edn. The Clarendon Press, Oxford. Lehmann E and Casella G 1998 Theory of Point Estimation, revised edn Springer-Verlag, New York. Liu J 2001 Monte Carlo Strategies in Scientific Computing. Springer-Verlag, New York. MacKay DJC 2002 Information Theory, Inference & Learning Algorithms. Cambridge University Press, Cambridge. Madigan D and Raftery A 1994 Model selection and accounting for model uncertainty in graphical models using Occam’s window. J. Am. Statist. Assoc. 89, 1535–1546. Marin J and Robert C 2007 Bayesian Core. Springer-Verlag, New York. Marin J and Robert C 2010 Importance sampling methods for Bayesian discrimination between embedded models. In Frontiers of Statistical Decision Making and Bayesian Analysis (eds Chen MH, Dey D, M¨uller P, Sun D and Ye K), pp. 513–553. Springer-Verlag, New York. McCullagh P and Nelder J 1989 Generalized Linear Models. Chapman and Hall, New York. Mengersen K and Tweedie R 1996 Rates of convergence of the Hastings and Metropolis algorithms. Ann. Statist. 24, 101–121. M¨uller P, Parmigiani G, Robert C and Rousseau J 2004 Optimal sample size for multiple testing: the case of gene expression microarrays. J. Am. Statist. Assoc. 99, 990–1001. M¨uller P, Parmigiani G and Rice K 2008 FDR and Bayesian multiple comparisons rules. In Bayesian Statistics 8: Proceedings of the Eighth International Meeting (eds Bernardo JM, Berger JO, Dawid AP and Smith AFM). Oxford University Press, Oxford. Ratmann O, Andrieu C, Wiuf C and Richardson S 2009 Model criticism based on likelihood-free inference, with an application to protein network evolution. PNAS 106, 1–6. Robert C 2007 The Bayesian Choice, paperback edn. Springer-Verlag, New York. Robert C and Casella G 2004 Monte Carlo Statistical Methods, 2nd edn. Springer-Verlag, New York. Robert C and Casella G 2009 Introducing Monte Carlo Methods with R. Springer-Verlag, New York. Robert C and Wraith D 2009 Computational methods for Bayesian model choice. In The 29th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering (ed. Goggans PM), pp. 251–262. American Institute of Physics, Melville, NY. Robert C, Chopin N and Rousseau J 2009 Theory of probability revisited (with discussion). Statist. Sci. 24(4), 574–576. Roberts G and Rosenthal J 2007 Coupling and ergodicity of adaptive Markov Chain Monte Carlo algorithms. J. Appl. Prob. 44(2), 458–475. Roberts G and Rosenthal J 2009 Examples of adaptive MCMC. J. Comp. Graph. Stat. 18, 349–367. Rubin D 1988 Using the SIR algorithm to simulate posterior distributions. In Bayesian Statistics 3: Proceedings of the Third Valencia International Meeting, June 1–5, 1987 (eds Bernardo J, Degroot M, Lindley D and Smith A). Clarendon Press, Oxford. Schervish M 1995 Theory of Statistics. Springer-Verlag, New York. Scott J and Berger J 2006 An exploration of aspects of Bayesian multiple testing. J. Statist. Plan. Inference 136, 2144–62. Sørensen D and Gianola D 2002 Likelihood, Bayesian, and MCMC Methods in Qualitative Genetics. Springer-Verlag, New York. Templeton A 2008 Statistical hypothesis testing in intraspecific phylogeography: nested clade phylogeographical analysis vs. approximate Bayesian computation. Mol. Ecol. 18(2), 319–331. Tierney L 1994 Markov chains for exploring posterior distributions (with discussion). Ann. Statist. 22, 1701–1786. Wraith D, Kilbinger M, Benabed K, O. C, Cardoso JF, G. F, Prunet S and Robert C 2009 Estimation of cosmological parameters using adaptive importance sampling. Phys. Rev. D 80(2), 023507. Zellner A 1986 On assessing prior distributions and Bayesian regression analysis with g-prior distribution regression using Bayesian variable selection. In Bayesian Inference and Decision Techniques: Essays in Honor of Bruno de Finetti, pp. 233–243. North-Holland/Elsevier, Amsterdam.
4 Data Integration: Towards Understanding Biological Complexity David Gomez-Cabrero and Jesper Tegner Unit of Computational Medicine, Department of Medicine, Karolinska Institutet, Stockholm, Sweden
Systems biology will fully develop its potential when researchers are able to make use of all the available data. To fulfill this goal it is needed to overcome two major challenges: (i) how to store and make data and knowledge accessible; and (ii) how to integrate and analyze data from different sources and of different types. Hence, this chapter is divided into two sections. The first section describes public storage resources such as experimental data repositories, ontologies and knowledge databases; however we will not discuss the (relevant topic of) requirements for a data-warehouse capable of managing several databases in an interoperable manner (Kimball and Ross 2002). The second section reviews available tools and algorithms that are useful for integrating different types of data sets. However, since a comprehensive enumeration is beyond the scope of this chapter, we present some representative examples. In this chapter we list integrative tools using open source codes and public repositories and databases (see Table 4.1). The relevant R packages (Ihaka and Gentleman 1996) are highlighted in bold (see Table 4.2).
4.1
Storing knowledge: Experimental data, knowledge databases, ontologies and annotation
Quantitative measurements of biological entities are data; organized data (e.g. by relational connections) becomes Information, and we gain Knowledge by the appropriate collection and analysis of Information. Biological research needs to find ways to store efficiently Data, Information and Knowledge. The term efficient denotes ‘ways to allow integration among the different data types’. Handbook of Statistical Systems Biology, First Edition. Edited by Michael P. H. Stumpf, David J. Balding and Mark Girolami. © 2011 John Wiley & Sons, Ltd. Published 2011 by John Wiley & Sons, Ltd.
Data Integration
67
Experimental data are stored in data repositories. Information is stored in Information Resources such as Knowledge Databases and Ontologies. This section will describe each one of those terms, key examples of each one and the process of annotation (that acts as the bridge between experimental data and Information). In this section we use protein p53 to provide relevant examples. p53 is a tumor repressor and a nuclear transcription factor that accumulates in response to cellular stress, including DNA damage and oncogene activation; therefore it guards the genome stability and normal cell growth. It was discovered in 1979 and it was then considered an oncogene (DeLeo et al. 1979; Lane and Crawford 1979; Linzer and Levine 1979), but it did not get the real attention of the research community until several years later when it was classified as a tumor suppressor that is mutated in most cancer cells (Jay et al. 1981; Mowat et al. 1985; Baker et al. 1989). The importance of this protein is highlighted by the 54 530 entries in PubMed (http://www.ncbi.nlm. nih.gov/pubmed, searching for ‘p53’, August 2010) where 6857 entries are reviews. 4.1.1
Data repositories
Over the years, the necessity for efficiently storing data has become clear. Sequence analysis provides us with a clarifying example: initially all new sequences obtained were submitted to journals; therefore it complicated its (efficient) use by researchers. To deal with this problem a database of sequences (EMBL Nucleotide Sequence Data Library), where all researchers would be able to submit their own sequences, was established at the European Molecular Biology Laboratory (EMBL); it was the first sequence database and its importance and utility became rapidly clear. Other initiatives, such as GenBank founded in 1982 and later absorbed into the National Center for Biotechnology Information (NCBI), followed and extended this pioneer experience. These first initiatives have been growing more rapidly in requirements over recent years: from microarrays to RNA-Seq, the amount of data generated daily is overwhelming and it clearly points out the necessity of storage and analytical tools in order to use the data efficiently. Several efforts have been made over the years to provide ordered access to all public available data so that comparative studies can be performed. A relevant example is found in microarrays; two of the most relevant microarray repositories are: (i) ArrayExpress (Parkinson et al. 2007; http://www.ebi.ac.uk/arrayexpress) developed by European Bioinformatics Institute (EBI); and (ii) Gene Expression Omnibus (GEO) developed by National Center for Biotechnology Information (NCBI) (Edgar et al. 2002; Barrett et al. 2007; http://www.ncbi.nlm.nih.gov/geo). At GEO the basic repository unit is a sample record which describes condition, manipulation and abundance measurement of each element derived from it; samples can be grouped in Series by submitters and/or Data Sets by GEO curators. Both repositories are regularly updated. A query of ‘p53’ within ArrayExpress (August 2010) returns 142 different experiments and 5948 microarray assays. For each experiment listed, data are available in a Raw format (usually CEL files) and/or in Processed format; however it is recommended to upload data in Raw format, as new (and hopefully better) methods to pre-process the data are continuously being developed. Each experiment has a unique identifier. For instance, E-GEOD-10795 is an identifier for an experiment that aims to elucidate the impact of TAF6d on cell death and gene expression; we also observe related information such as links to publications (see Lesne and Benecke 2008; Wilhelm et al. 2008), files (e.g. data archives, experiment design and array design), a description of the experiment and links to other databases. Among the links there is a reference to the same data set available at GEO where its identifier is GSE10795; following this link we observe similar information to the information found in ArrayExpress. A p53 query in GEO search returns 31 data sets and 257 series. Repositories can store different types of data in different formats for the same defined measure, or different types of quantitative data for the same system. For example microarrays can be used to measure as many different things as (i) mRNA expression, (ii) exon differential expression (to compare isoforms) (Clark et al. 2007), (iii) as part of the ChIP-chip assay (Horak and Snyder 2002) and (iv) SNPs (Hacia et al. 1999). The need to integrate these different data sets highlights the need for standards; as an example, the Microarray
68 Handbook of Statistical Systems Biology
Gene Expression Data (MGED) Society defined the Minimum Information About a Microarray Experiment (MIAME) (Brazma et al. 2001) that corresponds to the minimum information that must be reported about a microarray experiment to enable its unambiguous interpretation and reproduction. There are also repositories specific for certain diseases or biological systems: RefDIC (Hijikata et al. 2007) is a public compendium of quantitative mRNA/protein profile data obtained from microarray and two-dimensional gel electrophoresis based proteome experiments specifically for immune cells; Oncomine initiative collects and standardizes all published (and publicly available) cancer microarray data (http://www.oncomine.org), as described in Rhodes et al. (2007). There are also repositories for most biological data types. For instance Protein Data Bank (http://www.rcsb.org/pdb/home/home.do) includes mass spectrometry experiments. Data repositories are dealing continuously with new challenges. For instance, as High Throughput Sequencing (HTS) techniques provide tools that will replace microarrays (e.g. RNA-Seq provides a more precise assessment of differential mRNA expression), it highlights the necessity of new data types and new storage structures. Another necessary characteristic of repositories is ‘updatability’: repositories should be able to accommodate new types of data, and link them to the previous ones if possible as it will allow the integration of old and new data types. 4.1.2
Knowledge Databases
Experimental data need to be transformed into information. This information needs to be stored in an ordered way in (public) databases, named Knowledge Databases (KDs). Researchers use KDs to test their experimental results or to validate their hypotheses. Because KDs present the processed data extracted from experiments and are specific for different types of entities (e.g. genes, proteins or diseases) or even variations of the same topic (e.g. DNA sequence: transcripts or SNPs) they need specific structures for each case. However, relevant characteristics (and challenges) that all KDs share are: 1. Interconnection: every KD is providing a narrow view of a certain topic; to provide a better integrative view interconnection between KDs is needed. 2. Public access: all information in major KDs must be publicly available. this policy is enforced by entities such as International Nucleotide Sequence Database Collaboration (INSD, http://www.insdc.org/policy. html): ‘...no use restrictions or licensing requirements will be included in any sequence data records, and no restrictions or licensing fees will be placed on the redistribution or use of the database by any party...’; ‘All database records submitted to the INSD will remain permanently accessible as part of the scientific record’. 3. Updatability: KDs must remain flexible enough in order to be able to include new data types. 4. Standardization: in order to fulfill Interconnection and Updatability challenges it is necessary to define information storage standards. KDs represent the state-of-knowledge in biology. However KDs are based on current knowledge, with different degrees of certainty. 4.1.2.1
p53 KD tour
As there is not space to enumerate all KDs we present the most important ones in Table 4.1. However, we find it useful to provide an example: we describe several p53 queries among different KDs. We begin by searching p53 at the NCBI, which allows the user to search over different databases. A search of ‘p53 Homo sapiens’ in the Gene Database redirects the query to Entrez Gene Database (Maglott et al. 2007) and returns ‘TP53’
Data Integration
69
Table 4.1 Repositories (R), Knowledge Databases (KDs) and Ontologies (O)
ArrayExpress CCDS ChEBI dbSNP DIP Entrez Gene FlyBase GEO GO HUGO JASPAR KEGG MGI Negatome OBO Oncomine PDB PubMed RefDIC RefSeq TRANSFAC UniProt
Type
Field
Reference/URL
R KD O R KD KD KD KD R O KD R KD R+KD KD O R KD R R KD R KD
Microarray Gene and Proteins Chemical Entities SNPs Protein Interaction Gene Fly Genome High-throughput Gene Gene PWM Pathways Mouse Genome Protein Interaction Ontologies Cancer, microarray Protein & Metabolomic Journals Immune system Genes and Proteins PWM Protein
Parkinson et al. (2007) Pruitt et al. (2009) Matos et al. (2009) Wheeler et al. (2007) Salwinski et al. (2004) Maglott et al. (2007) http://flybase.org Barrett et al. (2007) The Gene Ontology Consortium (2000) http://www.genenames.org Portales-Casamar et al. (2009) Kanehisa et al. (2006) http://www.informatics.jax.org Smialowski et al. (2010) Smith et al. (2007) Rhodes et al. (2007) http://www.rcsb.org/pdb/home/home.do http://www.ncbi.nlm.nih.gov/pubmed Hijikata et al. (2007) http://www.ncbi.nlm.nih.gov/RefSeq/ Windenger (2008) The Uniprot Consortium (2010)
that links to http://www.ncbi.nlm.nih.gov/gene/7157 as the first result. Entrez Gene is a NCBI database for gene-specific information that focuses on genomes ‘that have been completely sequenced, that have an active research community to contribute gene-specific information or that are scheduled for intense sequence analysis’ and provides unique integer identifiers (GeneID) for genes and other loci. In H. sapiens the p53 GeneID is 7157; this identifier will help if any query is redirected to any other NCBI database. The official symbol, official name provided by a nomenclature authority, is TP53 and it was provided by the HUGO Gene Nomenclature Committee (HGNC; http://www.genenames.org/aboutHGNC.html). Other information available is: (1) TP53 has other aliases (P53, LFS1, TRP53, FLJ92943) that can be used to identify the gene in older references, (2) TP53 is a protein coding gene and (3) its HGNC identifier is HGNC:11998. Entrez Gene Database integrates information from RefSeq database (Pruitt et al. 2007; http://www.ncbi.nlm.nih.gov/RefSeq/), where RefSeq is ‘a curated non-redundant collection of sequences representing genomes, transcripts and proteins’ that integrates information from multiple sources therefore adding descriptions as: coding regions, conserved domains, gene and protein product names and (again) database cross-references. From a TP53 Entrez Gene database query the following RefSeq information can be obtained: (1) RefSeqGene identifier (for well-characterized genes to be used as reference standards) and (2) different transcripts and proteins, whose identifier names begin by NM and NP , respectively. Among the transcripts and proteins the query returns the cellular tumor antigen p53 isoform a, that has two transcripts+protein related: (i) NM 000546.4 + NP 000537.3 and (ii) NM 001126112.1 + NP 001119584.1; in both cases there is a common reference, CCDS11118.1, to a consensus coding sequence (CCDS; Pruitt et al. 2009). The CCDS database annotates identical proteins on the reference mouse and human genomes with a stable identifier (CCDS ID) ensuring consistency between NCBI, Ensembl (Flicek et al. 2010), and UCSC Genome Browsers.
70 Handbook of Statistical Systems Biology
Following the links to Ensembl we arrive at Ensembl.org, a project that generates databases for chordates. The identifier for ‘TP53 H. sapiens’ is ENSG00000141510, and again at this page the original source, HGCN, and the access number on it, 11998, are shown. The web page provides the location of the gene (Chromosome 17: 7,565,257-7,590,856 reverse strand, GRCh37 human assembly) and different transcripts related to the gene, the length of each one of them and the protein products related. There are also the references to the CCDS if they are available. The CCDS database is only one of the examples of how different entities collaborate in standardizing annotations. Another major example is INSD (http://www.insdc.org/index.html) that combines the effort of the DNA Data Bank of Japan, GenBank (Benson et al. 2009) and the European Nucleotide Archive (European Molecular Biology Laboratory) to collect and disseminate DNA and RNA sequence data. Other types of knowledge databases are not focused on individual terms but instead target physical interactions. Reactome (Matthews et al. 2009) is a curated knowledge database of biological pathways that includes cross-references to other biological databases such as Ensembl and Gene Entrez. A search for ‘p53’ within Reactome returns 123 terms (e.g. ‘Transcriptional activation of p53 responsive genes’ pathway, uniquely identified as REACT 202.2). The link to this pathway includes information about the preceding (e.g. ‘Stabilization of p53’, REACT 309.2) and following (e.g. ‘Translocation of p27 to the nucleoplasm’, REACT 9043.1) events. KEGG (Kanehisa et al. 2006), is a collection of manually drawn pathway maps from metabolism and cellular processes. A p53 query in KEGG PATHWAYS returns the KEGG ‘p53 signaling pathway’, identified as map04115; it includes (i) information about evidence used to develop the pathway, (ii) related pathways and (iii) links to other databases. 4.1.3
Ontologies
KDs present the processed data extracted from experiments. As we have observed in p53 we can obtain the sequence of the gene, the different exons and introns and other relevant data but we are missing answers to relevant questions such as ‘Does p53 work alone or is it included in a gene module?’ and ‘Is p53 involved in any metabolomic pathway?’. These questions needed to be addressed from a different perspective than a KD. Therefore it was necessary to develop ways of storing relational information; Biological Ontologies (BOs) are one response to this need. BOs represent the entities of biomedical interest and their relations and categories. Ontologies can be domain-specific (e.g. Chemical Entities of Biological Interest, ChEBI) (Matos et al. 2009) or level-specific [e.g. Gene Ontology (GO) has biological processes, cellular component and molecular function levels, see The Gene Ontology Consortium (2000)]. Ontologies can overlap, and can reuse elements from other ontologies. Ontologies are tools used to (i) integrate different meta-data, answering questions such as the existence of groups of entities and the possible hierarchical orders and relationships between them; and (ii) provide resource interoperability. In order to fulfill these tasks there are some prerequisites: high-quality, free availability, and re-distributiveness. Open Biomedical Ontologies (OBOs) are a collection of controlled vocabularies (ontologies) freely available to the biomedical community. Within OBOs, OBO Foundry (Smith et al. 2007) regulates the development of new ontologies by defining principles. Many new ontologies are defined to communicate with already available ones, e.g. PRotein Ontology (Natale et al. 2007) includes connections to GO, OBO Disease Ontology and several others. Until the mature development of federated biomedical ontologies different bridges are being created between ontologies. Two relevant examples are: (1) the Unified Medical Language System developed by the US National Library of Medicine whose Metathesaurus integrates more than 1.4 million concepts from over one hundred terminologies (http://www.bioontology.org/); and (2) the ‘Minimal Information Requested In the An