Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Hands-On Unsupervised Learning with Python

You're reading from   Hands-On Unsupervised Learning with Python Implement machine learning and deep learning models using Scikit-Learn, TensorFlow, and more

Arrow left icon
Product type Paperback
Published in Feb 2019
Publisher Packt
ISBN-13 9781789348279
Length 386 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
Giuseppe Bonaccorso Giuseppe Bonaccorso
Author Profile Icon Giuseppe Bonaccorso
Giuseppe Bonaccorso
Giuseppe Bonaccorso Giuseppe Bonaccorso
Author Profile Icon Giuseppe Bonaccorso
Giuseppe Bonaccorso
Arrow right icon
View More author details
Toc

Table of Contents (12) Chapters Close

Preface 1. Getting Started with Unsupervised Learning FREE CHAPTER 2. Clustering Fundamentals 3. Advanced Clustering 4. Hierarchical Clustering in Action 5. Soft Clustering and Gaussian Mixture Models 6. Anomaly Detection 7. Dimensionality Reduction and Component Analysis 8. Unsupervised Neural Network Models 9. Generative Adversarial Networks and SOMs 10. Assessments 11. Other Books You May Enjoy

Questions

  1. If two samples have a Minkowski distance (p=5) equal to 10, what can you say about their Manhattan distance?
  2. The main factor that negatively impacts on the convergence speed of K-means is the dimensionality of the dataset. Is this correct?
  3. One of the most important factors that can positively impact on the performance of K-means is the convexity of the clusters. Is this correct?
  4. The homogeneity score of a clustering application is equal to 0.99. What does it mean?
  5. What is the meaning of an adjusted Rand score equal to -0.5?
  6. Considering the previous question, can a different number of clusters yield a better score?
  7. An application based on KNN requires on average 100 5-NN base queries per minute. Every minute, 2 50-NN queries are executed (each of them requires 4 seconds with a leaf size=25) and, immediately after them, a 2-second blocking task is performed. Assuming...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image