Book Image

Hands-On Ensemble Learning with R

By : Prabhanjan Narayanachar Tattar
Book Image

Hands-On Ensemble Learning with R

By: Prabhanjan Narayanachar Tattar

Overview of this book

Ensemble techniques are used for combining two or more similar or dissimilar machine learning algorithms to create a stronger model. Such a model delivers superior prediction power and can give your datasets a boost in accuracy. Hands-On Ensemble Learning with R begins with the important statistical resampling methods. You will then walk through the central trilogy of ensemble techniques – bagging, random forest, and boosting – then you'll learn how they can be used to provide greater accuracy on large datasets using popular R packages. You will learn how to combine model predictions using different machine learning algorithms to build ensemble models. In addition to this, you will explore how to improve the performance of your ensemble models. By the end of this book, you will have learned how machine learning algorithms can be combined to reduce common problems and build simple efficient ensemble models with the help of real-world examples.

Related Content you might be interested in

Current Title:

Small book image
Hands-On Ensemble Learning with R
Prabhanjan Narayanachar Tattar
Jul, 2018 | 376 pages
Small book image
Statistical Application Development with R and Python
Prabhanjan Narayanachar Tattar
Aug, 2017 | 432 pages
Small book image
Machine Learning with R Cookbook
YuWei Chiu David Chiu | AshishSingh Bhatia
Oct, 2017 | 572 pages
Small book image
Practical Data Science Cookbook, Second Edition
Anthony Ojeda | ABHIJIT DASGUPTA | Sean Patrick Murphy | Bhushan Purushottam Joshi | Prabhanjan Narayanachar Tattar
Jun, 2017 | 434 pages
Table of Contents (17 chapters)
Hands-On Ensemble Learning with R
Hands-On Ensemble Learning with R
Contributors
Contributors
Preface
Preface
Free Chapter
1
Introduction to Ensemble Techniques
Introduction to Ensemble Techniques
Datasets
Statistical/machine learning models
The right model dilemma!
An ensemble purview
Complementary statistical tests
Summary
2
Bootstrapping
Bootstrapping
Technical requirements
The jackknife technique
Bootstrap – a statistical method
The boot package
Bootstrap and testing hypotheses
Bootstrapping regression models
Bootstrapping survival models*
Bootstrapping time series models*
Summary
3
Bagging
Bagging
Technical requirements
Classification trees and pruning
Bagging
k-NN classifier
k-NN bagging
Summary
4
Random Forests
Random Forests
Technical requirements
Random Forests
Variable importance
Proximity plots
Random Forest nuances
Comparisons with bagging
Missing data imputation
Clustering with Random Forest
Summary
5
The Bare Bones Boosting Algorithms
The Bare Bones Boosting Algorithms
Technical requirements
The general boosting algorithm
Adaptive boosting
Gradient boosting
Using the adabag and gbm packages
Variable importance
Comparing bagging, random forests, and boosting
Summary
6
Boosting Refinements
Boosting Refinements
Technical requirements
Why does boosting work?
The gbm package
The xgboost package
The h2o package
Summary
7
The General Ensemble Technique
The General Ensemble Technique
Technical requirements
Why does ensembling work?
Ensembling by voting
Ensembling by averaging
Stack ensembling
Summary
8
Ensemble Diagnostics
Ensemble Diagnostics
Technical requirements
What is ensemble diagnostics?
Ensemble diversity
Pairwise measure
Interrating agreement
Summary
9
Ensembling Regression Models
Ensembling Regression Models
Technical requirements
Pre-processing the housing data
Visualization and variable reduction
Regression models
Bagging and Random Forests
Boosting regression models
Stacking methods for regression models
Summary
10
Ensembling Survival Models
Ensembling Survival Models
Core concepts of survival analysis
Nonparametric inference
Regression models – parametric and Cox proportional hazards models
Survival tree
Ensemble survival models
Summary
11
Ensembling Time Series Models
Ensembling Time Series Models
Technical requirements
Time series datasets
Time series visualization
Core concepts and metrics
Essential time series models
Bagging and time series
Ensemble time series models
Summary
12
What's Next?
What's Next?
Bibliography
Bibliography
References
R package references
Index
Index

Ensembling by voting

Ensembling by voting can be used efficiently for classification problems. We now have a set of classifiers, and we need to use them to predict the class of an unknown case. The combining of the predictions of the classifiers can proceed in multiple ways. The two options that we will consider are majority voting, and weighted voting.

Majority voting

Ideas related to voting will be illustrated through an ensemble based on the homogeneous base learners of decision trees, as used in the development of bagging and random forests. First, we will create 500 base learners using the randomForest function and repeat the program in the first block, as seen in Chapter 4, Random Forests. Ensembling has already been performed in that chapter, and we will elaborate on those steps here. First, the code block for setting up the random forest is given here:

> load("../Data/GC2.RData")
> set.seed(12345)
> Train_Test <- sample(c("Train","Test"),nrow(GC2),
+ replace = TRUE,prob...
Previous Section
End of Section 4
Next Section