AIExplainer
Machine Learning Intermediate 2 min read

What is hierarchical clustering?

A method of grouping similar data points into clusters based on their hierarchy or tree-like structure

Hierarchical clustering is a technique used to group data points into clusters based on their similarity, with the resulting clusters forming a hierarchy or tree-like structure. This allows for the identification of clusters at different levels of granularity, from very general to very specific.

Imagine a family tree, where individuals are grouped into families, families are grouped into larger family groups, and these groups are further divided into even larger categories. Hierarchical clustering works in a similar way, grouping data points into clusters based on their similarity, with each cluster being a subset of a larger cluster.

A company might use hierarchical clustering to group customers based on their buying behavior, with the resulting clusters forming a hierarchy from general demographics to specific purchasing patterns.

Hierarchical clustering is commonly used in data analysis and machine learning to identify patterns and relationships in data, such as customer segmentation, gene expression analysis, and image compression.

One common misconception is that hierarchical clustering is only useful for small datasets, when in fact it can be applied to large datasets as well. Another misconception is that the hierarchy is fixed, when in fact it can be dynamic and dependent on the specific algorithm used.

Hierarchical clustering has its roots in the early days of computer science and statistics, with the first algorithms developed in the 1960s. Since then, it has evolved to become a widely used technique in data analysis and machine learning.

agglomerative clustering divisive clustering tree clustering

Three products for different needs — explore what’s relevant to you.