Preporato

Clustering and PCA

Finding structure without labels: k-means and principal components.

Start 4 problems

Problems

  1. 1Assign points to the nearest centroidEasy · 8 min · 11 hidden testsSolution free
  2. 2One k-means updateMedium · 14 min · 10 hidden tests
  3. 3Project data onto its top principal componentsMedium · 16 min · 13 hidden tests
  4. 4How many components keep the varianceMedium · 12 min · 12 hidden tests

Practice it at full scale

Hands-on labs on real tooling, in your browser.

Customer Segmentation with k-means and PCA