Unsupervised Learning

Unsupervised Learning!

Principle components analysis


K-means Clustering


  1. Assign data points to a group
  2. Iterate through until no change:
    1. Find centroid
    2. Find the point that is closest to the centroids. Assign that data point to the corresponding group of the centroids.

How Many Groups

The art of chosing K.

Hierarchical Clustering

Bottom-up hierarchical groups can be read out from the dendrogram.

Planted: by ;

No backlinks identified. Reference this note using the Note ID wiki/machine-learning/unsupervised/overview.md in other notes to connect them.

L Ma (2018). 'Unsupervised Learning', Datumorphism, 05 April. Available at: https://datumorphism.leima.is/wiki/machine-learning/unsupervised/overview/.