Machine Learning Fundamentals · Unsupervised learning

Hierarchical clustering

Building a tree of nested clusters by repeatedly merging (or splitting) groups, instead of picking a fixed number upfront.

Also known as: dendrogram, agglomerative clustering.

Start a lesson on Hierarchical clustering

Learn first

• K-means clustering: Grouping unlabeled points into k clusters by repeatedly assigning them to the nearest center and recomputing centers.

Related topics

• Dimensionality reduction (PCA): Compressing many correlated features into fewer new ones that still capture most of the original variation.