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. What's the difference between agglomerative and divisive approaches?
  2. Given two clusters a: [(-1, -1), (0, 0)] and b: [(1, 1), (1, 0)], what are the single and complete linkages considering the Euclidean distance?
  3. A dendrogram represents the different linkage results for a given dataset. Is this correct?
  4. In agglomerative clustering, the bottom (initial part) of a dendrogram contains a single cluster. Is this correct?
  5. What's the meaning of the y axis of a dendrogram in agglomerative clustering?
  6. The dissimilarity decreases while merging smaller clusters. Is this correct?
  7. An element, C(i, j), of the cophenetic matrix reports the dissimilarity level at which two corresponding elements, xi and xj, appear in the same cluster for the first time. Is this correct?
  8. What's the main purpose of connectivity constraints?
...