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.

Preface

Who this book is for

What this book covers

To get the most out of this book

Free Chapter

Getting Started with Unsupervised Learning

Getting Started with Unsupervised Learning

Technical requirements

Why do we need machine learning?

Types of machine learning algorithm

Why Python for data science and machine learning?

Further reading

Clustering Fundamentals

Clustering Fundamentals

Technical requirements

Introduction to clustering

Analysis of the Breast Cancer Wisconsin dataset

Evaluation metrics

K-Nearest Neighbors

Vector Quantization

Further reading

Advanced Clustering

Advanced Clustering

Technical requirements

Spectral clustering

Online clustering

Further reading

Hierarchical Clustering in Action

Hierarchical Clustering in Action

Technical requirements

Cluster hierarchies

Agglomerative clustering

Analyzing a dendrogram

Cophenetic correlation as a performance metric

Agglomerative clustering on the Water Treatment Plant dataset

Connectivity constraints

Further reading

Soft Clustering and Gaussian Mixture Models

Soft Clustering and Gaussian Mixture Models

Technical requirements

Soft clustering

Gaussian mixture

Further reading

Anomaly Detection

Anomaly Detection

Technical requirements

Probability density functions

Kernel density estimation (KDE)

Anomaly detection

One-class support vector machines

Anomaly detection with Isolation Forests

Further reading

Dimensionality Reduction and Component Analysis

Dimensionality Reduction and Component Analysis

Technical requirements

Principal Component Analysis (PCA)

Independent Component Analysis

Topic modeling with Latent Dirichlet Allocation

Further reading

Unsupervised Neural Network Models

Unsupervised Neural Network Models

Technical requirements

Hebbian-based principal component analysis

Unsupervised deep belief networks

Further reading

Generative Adversarial Networks and SOMs

Generative Adversarial Networks and SOMs

Technical requirements

Generative adversarial networks

Self-organizing maps

Further reading

Assessments

Other Books You May Enjoy

Other Books You May Enjoy

Leave a review - let other readers know what you think

Customer Reviews

5 star

0

4 star

0

3 star

0

2 star

0

1 star

0

Connectivity constraints

An important feature of agglomerative hierarchical clustering is the possibility to include connectivity constraints to force the merging of specific samples. This kind of prior knowledge is very common in contexts where there are strong relationships between neighbors or when we know that some samples must belong to the same cluster because of their intrinsic properties. To achieve this goal, we need to use a connectivity matrix, A ∈ {0, 1}^{n × n}:

In general, A is the adjacency matrix induced by a graph of the dataset; however, the only important requirement is the absence of isolated samples (without connections), because they cannot be merged in any way. The connectivity matrix is applied during the initial merging stages and forces the algorithm to aggregate the specified samples. As the following agglomerations don't impact on connectivity...