You're reading from Mastering Machine Learning Algorithms Expert techniques for implementing popular machine learning algorithms, fine-tuning your models, and understanding how they work

Product type Paperback

Published in Jan 2020

Publisher Packt

ISBN-13 9781838820299

Length 798 pages

Edition 2nd Edition

Languages

Python

Tools

Keras

Concepts

Machine Learning

Authors (2):

Giuseppe Bonaccorso

View More author details

Table of Contents (28) Chapters

Preface

1. Machine Learning Model Fundamentals

2. Loss Functions and Regularization FREE CHAPTER

3. Introduction to Semi-Supervised Learning

4. Advanced Semi-Supervised Classification

5. Graph-Based Semi-Supervised Learning

6. Clustering and Unsupervised Models

7. Advanced Clustering and Unsupervised Models

8. Clustering and Unsupervised Models for Marketing

9. Generalized Linear Models and Regression

10. Introduction to Time-Series Analysis

11. Bayesian Networks and Hidden Markov Models

12. The EM Algorithm

13. Component Analysis and Dimensionality Reduction

14. Hebbian Learning

15. Fundamentals of Ensemble Learning

16. Advanced Boosting Algorithms

17. Modeling Neural Networks

18. Optimizing Neural Networks

19. Deep Convolutional Networks

20. Recurrent Neural Networks

21. Autoencoders

22. Introduction to Generative Adversarial Networks

23. Deep Belief Networks

24. Introduction to Reinforcement Learning

25. Advanced Policy Estimation Algorithms

26. Other Books You May Enjoy

27. Index

Independent Component Analysis

We've seen that the factors extracted by a PCA are decorrelated, but not independent. A classic example is a cocktail party: we have a recording of many overlapped voices and we would like to separate them. Every single voice can be modeled as a random process and it's possible to assume that they are statistically independent (this means that the joint probability can be factorized using the marginal probabilities of each source). Using FA or PCA, we can find uncorrelated factors, but there's no way to assess whether they're also independent (normally, they aren't). In this section, we're going to study a model that's able to produce sparse representations (when the dictionary isn't under-complete) with a set of statistically independent components.

Let's assume we have a zero-centered and whitened dataset X sampled from N(0, I) and noiseless linear transformation: