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
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
The Regularization Cookbook

You're reading from   The Regularization Cookbook Explore practical recipes to improve the functionality of your ML models

Arrow left icon
Product type Paperback
Published in Jul 2023
Publisher Packt
ISBN-13 9781837634088
Length 424 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Vincent Vandenbussche Vincent Vandenbussche
Author Profile Icon Vincent Vandenbussche
Vincent Vandenbussche
Arrow right icon
View More author details
Toc

Table of Contents (14) Chapters Close

Preface 1. Chapter 1: An Overview of Regularization 2. Chapter 2: Machine Learning Refresher FREE CHAPTER 3. Chapter 3: Regularization with Linear Models 4. Chapter 4: Regularization with Tree-Based Models 5. Chapter 5: Regularization with Data 6. Chapter 6: Deep Learning Reminders 7. Chapter 7: Deep Learning Regularization 8. Chapter 8: Regularization with Recurrent Neural Networks 9. Chapter 9: Advanced Regularization in Natural Language Processing 10. Chapter 10: Regularization in Computer Vision 11. Chapter 11: Regularization in Computer Vision – Synthetic Image Generation 12. Index 13. Other Books You May Enjoy

Resampling imbalanced data with SMOTE

Finally, a more complex solution for dealing with imbalanced datasets is a method called SMOTE. After explaining the SMOTE algorithm, we will apply this method to the credit card fraud detection dataset.

Getting ready

SMOTE stands for Synthetic Minority Oversampling TEchnique. As its name suggests, it creates synthetic samples for an underrepresented class. But how exactly does it create synthetic data?

This method uses the k-NN algorithm on the underrepresented class. The SMOTE algorithm can be summarized with the following steps:

  1. Randomly pick a sample, , in the minority class.
  2. Using k-NN, randomly pick one of the k-nearest neighbors of in the minority class. Let’s call this sample .
  3. Compute the new synthetic sample, , with 𝜆 being randomly drawn in the [0, 1] range:
Figure 5.4 – Visual representation of SMOTE

Figure 5.4 – Visual representation of SMOTE

Compared to random oversampling, this method is more...

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