Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Mastering Machine Learning Algorithms

You're reading from   Mastering Machine Learning Algorithms Expert techniques to implement popular machine learning algorithms and fine-tune your models

Arrow left icon
Product type Paperback
Published in May 2018
Publisher Packt
ISBN-13 9781788621113
Length 576 pages
Edition 1st Edition
Arrow right icon
Author (1):
Arrow left icon
Giuseppe Bonaccorso Giuseppe Bonaccorso
Author Profile Icon Giuseppe Bonaccorso
Giuseppe Bonaccorso
Arrow right icon
View More author details
Toc

Table of Contents (17) Chapters Close

Preface 1. Machine Learning Model Fundamentals 2. Introduction to Semi-Supervised Learning FREE CHAPTER 3. Graph-Based Semi-Supervised Learning 4. Bayesian Networks and Hidden Markov Models 5. EM Algorithm and Applications 6. Hebbian Learning and Self-Organizing Maps 7. Clustering Algorithms 8. Ensemble Learning 9. Neural Networks for Machine Learning 10. Advanced Neural Models 11. Autoencoders 12. Generative Adversarial Networks 13. Deep Belief Networks 14. Introduction to Reinforcement Learning 15. Advanced Policy Estimation Algorithms 16. Other Books You May Enjoy

Random forests


A random forest is the bagging ensemble model based on decision trees. If the reader is not familiar with this kind of model, I suggest reading the Introduction to Machine Learning, Alpaydin E., The MIT Press, where a complete explanation can be found. However, for our purposes, it's useful to provide a brief explanation of the most important concepts. A decision tree is a model that resembles a standard hierarchical decision process. In the majority of cases, a special family is employed, called binary decision trees, as each decision yields only two outcomes. This kind of tree is often the simplest and most reasonable choice and the training process (which consists in building the tree itself) is very intuitive. The root contains the whole dataset:

Each level is obtained by applying a selection tuple, defined as follows:

The first index of the tuple corresponds to an input feature, while the threshold ti is a value chosen in the specific range of each feature. The application...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime