Unsupervised Learning
Unsupervised Learning!
Principle components analysis
Clustering
K-means Clustering
Algorithm:
- Assign data points to a group
- Iterate through until no change:
- Find centroid
- Find the point that is closest to the centroids. Assign that data point to the corresponding group of the centroids.
Hierarchical Clustering
Bottom-up hierarchical groups can be read out from the dendrogram.
Planted:
by L Ma;
Similar Articles:
L Ma (2018). 'Unsupervised Learning', Datumorphism, 05 April. Available at: https://datumorphism.leima.is/wiki/machine-learning/unsupervised/overview/.