Elements of Computational StatisticsIn recent years developments in statistics have to a great extent gone hand in hand with developments in computing. Indeed, many of the recent advances in statistics have been dependent on advances in computer science and techn- ogy. Many of the currently interesting statistical methods are computationally intensive, eitherbecausetheyrequireverylargenumbersofnumericalcompu- tions or because they depend on visualization of many projections of the data. The class of statistical methods characterized by computational intensity and the supporting theory for such methods constitute a discipline called “com- tational statistics”. (Here, I am following Wegman, 1988, and distinguishing “computationalstatistics”from“statisticalcomputing”, whichwetaketomean “computational methods, including numerical analysis, for statisticians”.) The computationally-intensive methods of modern statistics rely heavily on the developments in statistical computing and numerical analysis generally. Computational statistics shares two hallmarks with other “computational” sciences, such as computational physics, computational biology, and so on. One is a characteristic of the methodology: it is computationally intensive. The other is the nature of the tools of discovery. Tools of the scienti?c method have generally been logical deduction (theory) and observation (experimentation). The computer, used to explore large numbers of scenarios, constitutes a new type of tool. Use of the computer to simulate alternatives and to present the research worker with information about these alternatives is a characteristic of thecomputationalsciences. Insomewaysthisusageisakintoexperimentation. The observations, however, are generated from an assumed model, and those simulated data are used toevaluate and study the model. |
Contents
5 | 29 |
Monte Carlo Methods for Inference | 37 |
Randomization and Data Partitioning | 67 |
Bootstrap Methods | 83 |
Tools for Identification of Structure in Data | 97 |
6 | 104 |
Estimation of Functions | 125 |
Graphical Methods in Computational Statistics | 149 |
Appendices 328 | 329 |
B Software for Random Number Generation | 347 |
Notation and Definitions | 359 |
Bibliography | 375 |
37 | 382 |
51 | 391 |
68 | 397 |
74 | 404 |
Estimation of Probability Density Functions Using Parametric | 193 |
Nonparametric Estimation of Probability Density Functions | 201 |
Structure in Data | 225 |
11 | 291 |
| 409 | |
| 415 | |
Other editions - View all
Common terms and phrases
algorithm American Statistical Association approach approximation bias bins bivariate bootstrap called classification components analysis Computational Statistics Computer Science confidence intervals convergence correlations corresponding covariance curves data analysis dataset defined density estimation depends determine discussion distance distribution function ECDF equation example factors given histogram inference integrated iterative jackknife Journal kernel L2 norm least squares Markov chain maximum likelihood mean measure methods minimal spanning tree Monte Carlo study multivariate data norm normal distribution number of observations objective optimal orthogonal orthogonal polynomials outliers parallel coordinates parameter plot points polynomials principal components principal components analysis probability density function problem projection pursuit properties quantiles random number random sample random variable regression represent resampling residuals rotation S-Plus scale Science and Statistics shown in Figure similar simulation smoothing space splines standard structure tessellation test statistic tion transformations univariate values variance variance-covariance matrix variation vector


