Book Image

R Statistics Cookbook

By : Francisco Juretig
2 (2)
Book Image

R Statistics Cookbook

2 (2)
By: Francisco Juretig

Overview of this book

R is a popular programming language for developing statistical software. This book will be a useful guide to solving common and not-so-common challenges in statistics. With this book, you'll be equipped to confidently perform essential statistical procedures across your organization with the help of cutting-edge statistical tools. You'll start by implementing data modeling, data analysis, and machine learning to solve real-world problems. You'll then understand how to work with nonparametric methods, mixed effects models, and hidden Markov models. This book contains recipes that will guide you in performing univariate and multivariate hypothesis tests, several regression techniques, and using robust techniques to minimize the impact of outliers in data.You'll also learn how to use the caret package for performing machine learning in R. Furthermore, this book will help you understand how to interpret charts and plots to get insights for better decision making. By the end of this book, you will be able to apply your skills to statistical computations using R 3.5. You will also become well-versed with a wide array of statistical techniques in R that are extensively used in the data science industry.

Related Content you might be interested in

Current Title:

Small book image
R Statistics Cookbook
Francisco Juretig
Mar, 2019 | 448 pages
Small book image
Building Statistical Models in Python
Paul N Adams | Stuart J Miller | Huy Hoang Nguyen
Aug, 2023 | 420 pages
Small book image
Data Analysis with R
Anthony Fischetti
Mar, 2018 | 570 pages
Small book image
Bayesian Analysis with Python
Osvaldo Martin
Dec, 2018 | 356 pages
Table of Contents (12 chapters)
Preface
Preface
Who this book is for
What this book covers
To get the most out of this book
Sections
Get in touch
Free Chapter
1
Getting Started with R and Statistics
Getting Started with R and Statistics
Introduction
Technical requirements
Maximum likelihood estimation
Calculating densities, quantiles, and CDFs
Creating barplots using ggplot
Generating random numbers from multiple distributions
Complex data processing with dplyr
3D visualization with the plot3d package
Formatting tabular data with the formattable package
Simple random sampling
Creating diagrams via the DiagrammeR package
C++ in R via the Rcpp package
Interactive plots with the ggplot GUI package
Animations with the gganimate package
Using R6 classes
Modeling sequences with the TraMineR package
Clustering sequences with the TraMineR package
Displaying geographical data with the leaflet package
2
Univariate and Multivariate Tests for Equality of Means
Univariate and Multivariate Tests for Equality of Means
Introduction
The univariate t-test
The Fisher-Behrens problem
Paired t-test
Calculating ANOVA sum of squares and F tests
Two-way ANOVA
Type I, Type II, and Type III sum of squares
Random effects
Repeated measures
Multivariate t-test
MANOVA
3
Linear Regression
Linear Regression
Introduction
Computing ordinary least squares estimates
Reporting results with the sjPlot package
Finding correlation between the features
Testing hypothesis
Testing homoscedasticity
Implementing sandwich estimators
Variable selection
Ridge regression
Working with LASSO
Leverage, residuals, and influence
4
Bayesian Regression
Bayesian Regression
Introduction
Getting the posterior density in STAN
Formulating a linear regression model
Assigning the priors
Doing MCMC the manual way
Evaluating convergence with CODA
Bayesian variable selection
Using a model for prediction
GLMs in JAGS
5
Nonparametric Methods
Nonparametric Methods
Introduction
The Mann-Whitney test
Estimating nonparametric ANOVA
The Spearman's rank correlation test
LOESS regression
Finding the best transformations via the acepack package
Nonparametric multivariate tests using the npmv package
Semiparametric regression with the SemiPar package
6
Robust Methods
Robust Methods
Introduction
Robust linear regression
Estimating robust covariance matrices
Robust logistic regression
Robust ANOVA using the robust package
Robust principal components
Robust Gaussian mixture models with the qclust package
Robust clustering
7
Time Series Analysis
Time Series Analysis
Introduction
The general ARIMA model
Seasonality and SARIMAX models
Choosing the best model with the forecast package
Vector autoregressions (VARs)
Facebook's automatic Prophet forecasting
Modeling count temporal data
Imputing missing values in time series
Anomaly detection
Spectral decomposition of time series
8
Mixed Effects Models
Mixed Effects Models
Introduction
The standard model and ANOVA
Some useful plots for mixed effects models
Nonlinear mixed effects models
Crossed and nested designs
Robust mixed effects models with robustlmm
Choosing the best linear mixed model
Mixed generalized linear models
9
Predictive Models Using the Caret Package
Predictive Models Using the Caret Package
Introduction
Data splitting and general model fitting
Preprocessing
Variable importance and feature selection
Model tuning
Classification in caret and ROC curves
Gradient boosting and class imbalance
Lasso, ridge, and elasticnet in caret
Logic regression
10
Bayesian Networks and Hidden Markov Models
Bayesian Networks and Hidden Markov Models
Introduction
A discrete Bayesian network via bnlearn
Conditional independence tests
Continuous and hybrid Bayesian networks via bnlearn
Interactive visualization of BNs with the bnviewer package
An introductory hidden Markov model
Regime switching in financial data via HMM
11
Other Books You May Enjoy
Other Books You May Enjoy
Leave a review - let other readers know what you think

Robust clustering

Given certain variables, we usually want to find clusters of observations. These clusters should be as different as possible, and should contain "similar" observations inside. Suppose we had the following pairs of values [height=170,weight=50], [height=180,weight=70],[height=190,weight=90] and [height=200,weight=100] and we wanted to cluster them. A reasonable 2-cluster configuration would have the following centroids: [height=175,weight=60],[height=195,weight=95]. Obviously, the first two observations would fall under the first cluster, and the other two should fall under the second cluster. The simplest and most preferred algorithm for clustering is k-means. It works by picking k centroids at random and assigning each observation to the nearest centroid. The mean/center for each centroid is updated, and the procedure is repeated for the other variables...

Previous Section
End of Chapter 6
Next Chapter