Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
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
Hands-On Ensemble Learning with R

You're reading from   Hands-On Ensemble Learning with R A beginner's guide to combining the power of machine learning algorithms using ensemble techniques

Arrow left icon
Product type Paperback
Published in Jul 2018
Publisher Packt
ISBN-13 9781788624145
Length 376 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Prabhanjan Narayanachar Tattar Prabhanjan Narayanachar Tattar
Author Profile Icon Prabhanjan Narayanachar Tattar
Prabhanjan Narayanachar Tattar
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Preface 1. Introduction to Ensemble Techniques FREE CHAPTER 2. Bootstrapping 3. Bagging 4. Random Forests 5. The Bare Bones Boosting Algorithms 6. Boosting Refinements 7. The General Ensemble Technique 8. Ensemble Diagnostics 9. Ensembling Regression Models 10. Ensembling Survival Models 11. Ensembling Time Series Models 12. What's Next?
A. Bibliography Index

k-NN classifier

In Chapter 1, Introduction to Ensemble Techniques, we became familiar with a variety of classification models. Some readers might already be familiar with the k-NN model. The k-NN classifier is one of the most simple, intuitive, and non-assumptive models. The name of the model itself suggests how it might be working - nearest neighborhoods! And that's preceded by k! Thus, if we have N points in a study, we find the k-nearest points in neighborhood, and then make a note of the class of the k-neighbors. The majority class of the k-neighbors is then assigned to the unit. In case of regression, the average of the neighbors is assigned to the unit. The following is a visual depiction of k-NN:

k-NN classifier

Figure 4: Visual depiction of k-NN

The top left part of the visual depiction of k-NN shows the scatterplot of 27 observations, 16 of which are circles and the remaining 11 are squares. The circles are marked in orange k-NN classifier while the squares are marked in blue k-NN classifier. Suppose we choose to set...

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
Banner background image