Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying The Unsupervised Learning Workshop
  • Table Of Contents Toc
The Unsupervised Learning Workshop

The Unsupervised Learning Workshop

By : Aaron Jones , Richard Brooker, John Wesley Doyle , Priyanjit Ghosh, Sani Kamal, Ashish Pratik Patil , Philip Solomon, Geetank Raipuria, Christopher Kruger , Benjamin Johnston
4.3 (6)
close
close
The Unsupervised Learning Workshop

The Unsupervised Learning Workshop

4.3 (6)
By: Aaron Jones , Richard Brooker, John Wesley Doyle , Priyanjit Ghosh, Sani Kamal, Ashish Pratik Patil , Philip Solomon, Geetank Raipuria, Christopher Kruger , Benjamin Johnston

Overview of this book

Do you find it difficult to understand how popular companies like WhatsApp and Amazon find valuable insights from large amounts of unorganized data? The Unsupervised Learning Workshop will give you the confidence to deal with cluttered and unlabeled datasets, using unsupervised algorithms in an easy and interactive manner. The book starts by introducing the most popular clustering algorithms of unsupervised learning. You'll find out how hierarchical clustering differs from k-means, along with understanding how to apply DBSCAN to highly complex and noisy data. Moving ahead, you'll use autoencoders for efficient data encoding. As you progress, you’ll use t-SNE models to extract high-dimensional information into a lower dimension for better visualization, in addition to working with topic modeling for implementing natural language processing (NLP). In later chapters, you’ll find key relationships between customers and businesses using Market Basket Analysis, before going on to use Hotspot Analysis for estimating the population density of an area. By the end of this book, you’ll be equipped with the skills you need to apply unsupervised algorithms on cluttered datasets to find useful patterns and insights.
Table of Contents (11 chapters)
close
close
Preface

Summary

Kernel density estimation is a classic statistical technique that is in the same family of techniques as the histogram. It allows the user to extrapolate out from sample data to make insights and predictions about the population of particular objects or events. This extrapolation comes in the form of a probability density function, which is nice because the results read as likelihoods or probabilities. The quality of this model is dependent on two parameters: the bandwidth value and the kernel function. As discussed, the most crucial component of leveraging kernel density estimation successfully is the setting of an optimal bandwidth. Optimal bandwidths are most frequently identified using grid search cross-validation with pseudo-log-likelihood as the scoring metric. What makes kernel density estimation great is both its simplicity and its applicability to so many fields.

It is routine to find kernel density estimation models in criminology, epidemiology, meteorology, and...

CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
The Unsupervised Learning Workshop
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon