Statistics for Machine Learning

Statistics for Machine Learning

By : Pratap Dangeti

Buy this Book

Statistics for Machine Learning

By: Pratap Dangeti

Buy this Book

Overview of this book

Complex statistics in machine learning worry a lot of developers. Knowing statistics helps you build strong machine learning models that are optimized for a given problem statement. This book will teach you all it takes to perform the complex statistical computations that are required for machine learning. You will gain information on the statistics behind supervised learning, unsupervised learning, reinforcement learning, and more. You will see real-world examples that discuss the statistical side of machine learning and familiarize yourself with it. You will come across programs for performing tasks such as modeling, parameter fitting, regression, classification, density collection, working with vectors, matrices, and more. By the end of the book, you will have mastered the statistics required for machine learning and will be able to apply your new skills to any sort of industry problem.

Title Page

Credits

About the Author

About the Reviewer

www.PacktPub.com

Customer Feedback

Preface

Free Chapter

Journey from Statistics to Machine Learning

Statistical terminology for model building and validation

Machine learning terminology for model building and validation

Machine learning model overview

Summary

Parallelism of Statistics and Machine Learning

Comparison between regression and machine learning models

Compensating factors in machine learning models

Machine learning models - ridge and lasso regression

Summary

Logistic Regression Versus Random Forest

Maximum likelihood estimation

Logistic regression – introduction and advantages

Random forest

Variable importance plot

Comparison of logistic regression with random forest

Summary

Tree-Based Machine Learning Models

Introducing decision tree classifiers

Comparison between logistic regression and decision trees

Comparison of error components across various styles of models

Remedial actions to push the model towards the ideal region

HR attrition data example

Decision tree classifier

Tuning class weights in decision tree classifier

Bagging classifier

Random forest classifier

Random forest classifier - grid search

AdaBoost classifier

Gradient boosting classifier

Comparison between AdaBoosting versus gradient boosting

Extreme gradient boosting - XGBoost classifier

Ensemble of ensembles - model stacking

Ensemble of ensembles with different types of classifiers

Ensemble of ensembles with bootstrap samples using a single type of classifier

Summary

K-Nearest Neighbors and Naive Bayes

K-nearest neighbors

KNN classifier with breast cancer Wisconsin data example

Tuning of k-value in KNN classifier

Naive Bayes

Probability fundamentals

Understanding Bayes theorem with conditional probability

Naive Bayes classification

Laplace estimator

Naive Bayes SMS spam classification example

Summary

Support Vector Machines and Neural Networks

Support vector machines working principles

Kernel functions

SVM multilabel classifier with letter recognition data example

Artificial neural networks - ANN

Activation functions

Forward propagation and backpropagation

Optimization of neural networks

Dropout in neural networks

ANN classifier applied on handwritten digits using scikit-learn

Introduction to deep learning

Summary

Recommendation Engines

Content-based filtering

Collaborative filtering

Evaluation of recommendation engine model

Unsupervised Learning

K-means clustering

Principal component analysis - PCA

Singular value decomposition - SVD

Deep auto encoders

Model building technique using encoder-decoder architecture

Deep auto encoders applied on handwritten digits using Keras

Summary

Reinforcement Learning

Introduction to reinforcement learning

Comparing supervised, unsupervised, and reinforcement learning in detail

Characteristics of reinforcement learning

Reinforcement learning basics

Markov decision processes and Bellman equations

Dynamic programming

Grid world example using value and policy iteration algorithms with basic Python

Monte Carlo methods

Temporal difference learning

SARSA on-policy TD control

Q-learning - off-policy TD control

Cliff walking example of on-policy and off-policy of TD control

Applications of reinforcement learning with integration of machine learning and deep learning

Markov decision processes and Bellman equations

Markov decision process (MDP) formally describes an environment for reinforcement learning. Where:

Environment is fully observable
Current state completely characterizes the process (which means the future state is entirely dependent on the current state rather than historic states or values)
Almost all RL problems can be formalized as MDPs (for example, optimal control primarily deals with continuous MDPs)

Central idea of MDP: MDP works on the simple Markovian property of a state; for example, S_t+1 is entirely dependent on latest state S_t rather than any historic dependencies. In the following equation, the current state captures all the relevant information from the history, which means the current state is a sufficient statistic of the future:

An intuitive sense of this property can be explained with the autonomous helicopter example: the next step is for the helicopter to move either to the right, left, to pitch, or to roll, and so on, entirely...

Statistics for Machine Learning

By : Pratap Dangeti

Statistics for Machine Learning

By: Pratap Dangeti

Overview of this book

Related Content you might be interested in

Current Title:

Statistics for Machine Learning

Mastering Machine Learning with scikit-learn

Ensemble Machine Learning Cookbook

Hands-On Automated Machine Learning

Markov decision processes and Bellman equations