Book Image

Learning Predictive Analytics with R

By : Eric Mayor
Book Image

Learning Predictive Analytics with R

By: Eric Mayor

Overview of this book

This book is packed with easy-to-follow guidelines that explain the workings of the many key data mining tools of R, which are used to discover knowledge from your data. You will learn how to perform key predictive analytics tasks using R, such as train and test predictive models for classification and regression tasks, score new data sets and so on. All chapters will guide you in acquiring the skills in a practical way. Most chapters also include a theoretical introduction that will sharpen your understanding of the subject matter and invite you to go further. The book familiarizes you with the most common data mining tools of R, such as k-means, hierarchical regression, linear regression, association rules, principal component analysis, multilevel modeling, k-NN, Naïve Bayes, decision trees, and text mining. It also provides a description of visualization techniques using the basic visualization tools of R as well as lattice for visualizing patterns in data organized in groups. This book is invaluable for anyone fascinated by the data mining opportunities offered by GNU R and its packages.

Related Content you might be interested in

Current Title:

Small book image
Learning Predictive Analytics with R
Eric Mayor
Sep, 2015 | 332 pages
No titles found
Table of Contents (23 chapters)
Learning Predictive Analytics with R
Learning Predictive Analytics with R
Credits
Credits
About the Author
About the Author
About the Reviewers
About the Reviewers
www.PacktPub.com
www.PacktPub.com
Preface
Preface
Free Chapter
1
Setting GNU R for Predictive Analytics
Setting GNU R for Predictive Analytics
Installing GNU R
The R graphic user interface
The menu bar of the R console
Packages
Summary
2
Visualizing and Manipulating Data Using R
Visualizing and Manipulating Data Using R
The roulette case
Histograms and bar plots
Scatterplots
Boxplots
Line plots
Application – Outlier detection
Formatting plots
Summary
3
Data Visualization with Lattice
Data Visualization with Lattice
Loading and discovering the lattice package
Discovering multipanel conditioning with xyplot()
Discovering other lattice plots
Updating graphics
Case study – exploring cancer-related deaths in the US
Summary
4
Cluster Analysis
Cluster Analysis
Distance measures
Learning by doing – partition clustering with kmeans()
Using k-means with public datasets
Summary
5
Agglomerative Clustering Using hclust()
Agglomerative Clustering Using hclust()
The inner working of agglomerative clustering
Agglomerative clustering with hclust()
Summary
6
Dimensionality Reduction with Principal Component Analysis
Dimensionality Reduction with Principal Component Analysis
The inner working of Principal Component Analysis
Learning PCA in R
Summary
7
Exploring Association Rules with Apriori
Exploring Association Rules with Apriori
Apriori – basic concepts
The inner working of apriori
Analyzing data with apriori in R
Summary
8
Probability Distributions, Covariance, and Correlation
Probability Distributions, Covariance, and Correlation
Probability distributions
Covariance and correlation
Summary
9
Linear Regression
Linear Regression
Understanding simple regression
Working with multiple regression
Analyzing data in R: correlation and regression
Robust regression
Bootstrapping
Summary
10
Classification with k-Nearest Neighbors and Naïve Bayes
Classification with k-Nearest Neighbors and Naïve Bayes
Understanding k-NN
Working with k-NN in R
Understanding Naïve Bayes
Working with Naïve Bayes in R
Computing the performance of classification
Summary
11
Classification Trees
Classification Trees
Understanding decision trees
ID3
C4.5
C5.0
Classification and regression trees and random forest
Conditional inference trees and forests
Installing the packages containing the required functions
Performing the analyses in R
Caret – a unified framework for classification
Summary
12
Multilevel Analyses
Multilevel Analyses
Nested data
Multilevel regression
Multilevel modeling in R
Predictions using multilevel models
Summary
13
Text Analytics with R
Text Analytics with R
An introduction to text analytics
Loading the corpus
Data preparation
Creating the training and testing data frames
Classification of the reviews
Mining the news with R
Summary
14
Cross-validation and Bootstrapping Using Caret and Exporting Predictive Models Using PMML
Cross-validation and Bootstrapping Using Caret and Exporting Predictive Models Using PMML
Cross-validation and bootstrapping of predictive models using the caret package
Exporting models using PMML
Summary
Exercises and Solutions
Exercises and Solutions
Exercises
Solutions
Further Reading and References
Further Reading and References
Preface
Chapter 1 – Setting GNU R for Predictive Modeling
Chapter 2 – Visualizing and Manipulating Data Using R
Chapter 3 – Data Visualization with Lattice
Chapter 4 – Cluster Analysis
Chapter 5 – Agglomerative Clustering Using hclust()
Chapter 6 – Dimensionality Reduction with Principal Component Analysis
Chapter 7 – Exploring Association Rules with Apriori
Chapter 8 – Probability Distributions, Covariance, and Correlation
Chapter 9 – Linear Regression
Chapter 10 – Classification with k-Nearest Neighbors and Naïve Bayes
Chapter 11 – Classification Trees
Chapter 12 – Multilevel Analyses
Chapter 13 – Text Analytics with R
Chapter 14 – Cross-validation and Bootstrapping Using Caret and Exporting Predictive Models Using PMML
Index
Index

Learning by doing – partition clustering with kmeans()

Perhaps the most widely used clustering family of algorithms is k-means. In this section, we will examine how it works and ways to assess the quality of a clustering solution.

K-means is a partitioning algorithm that produces k (user-defined number) clusters of cases that are more similar to each other than to cases outside the cluster. K-means starts by randomly initiating the centroid (the value of the considered dimensions) of each cluster. From now, the process, aiming at creating homogenous clusters, is iterative until a final solution is found. For each case, the distance from the centroid of each cluster is computed, and cases are assigned to the closest cluster. After this step, k-means computes the new values of the centroid of each cluster, as the means of all the cases belonging to the cluster. The process stops when the distance between the cases and the centroid is not decreasing anymore. It is noteworthy that the final result...

Previous Section
End of Section 3
Next Section