Book Image

Hands-On Unsupervised Learning with Python

By : Giuseppe Bonaccorso
Book Image

Hands-On Unsupervised Learning with Python

By: Giuseppe Bonaccorso

Overview of this book

Unsupervised learning is about making use of raw, untagged data and applying learning algorithms to it to help a machine predict its outcome. With this book, you will explore the concept of unsupervised learning to cluster large sets of data and analyze them repeatedly until the desired outcome is found using Python. This book starts with the key differences between supervised, unsupervised, and semi-supervised learning. You will be introduced to the best-used libraries and frameworks from the Python ecosystem and address unsupervised learning in both the machine learning and deep learning domains. You will explore various algorithms, techniques that are used to implement unsupervised learning in real-world use cases. You will learn a variety of unsupervised learning approaches, including randomized optimization, clustering, feature selection and transformation, and information theory. You will get hands-on experience with how neural networks can be employed in unsupervised scenarios. You will also explore the steps involved in building and training a GAN in order to process images. By the end of this book, you will have learned the art of unsupervised learning for different real-world challenges.
Table of Contents (12 chapters)

Questions

  1. Is a half-moon-shaped dataset a convex cluster?
  2. A bidimensional dataset is made up of two half-moons. The second one is fully contained in the concavity of the first one. Which kind of kernel can easily allow the separation of the two clusters (using spectral clustering)?
  3. After applying the DBSCAN algorithm with ε=1.0, we discover that there are too many noisy points. What should we expect with ε=0.1?
  4. K-medoids is based on the Euclidean metric. Is this correct?
  5. DBSCAN is very sensitive to the geometry of the dataset. Is this correct?
  6. A dataset contains 10,000,000 samples and can be easily clustered using a large machine using K-means. Can we, instead, use a smaller machine and mini-batch K-means?
  7. A cluster has a standard deviation equal to 1.0. After applying a noise N(0, 0.005), 80% of the original assignments are changed. Can we say that such a cluster...