Upload a CSV, pick your numeric columns and an ID column, and agglomerative clustering builds the full tree — the data shows where it naturally cuts, and every segment comes back sized, profiled, and illustrated with named rows. Free.
Free analyses run on up to 10,000 rows. Larger files are randomly sampled to that size — sign up to analyze your full dataset.
Growing your data's cluster tree...
Sent to — merge-height scree, silhouette-chosen cluster count, z-score segment profiles, a 2-D segment map, named example members, R code, and AI insights.
Analyze another fileThe analysis standardizes your selected columns, computes euclidean distances, and builds the full agglomerative cluster tree under Ward.D2 linkage — merging the two closest groups over and over until one remains. Complete and average linkage trees are also built and all three are scored by cophenetic correlation (how faithfully each tree preserves the original distances); the best is reported, while the reported clusters are cut from the Ward.D2 tree for its compact, interpretable groups. The cut point is chosen by average silhouette width over every candidate k, cross-checked against the tree's own merge-height gaps, and each segment is profiled and illustrated with named example rows.
Use it when you suspect natural groups but don't want to pre-pick how many — the tree shows structure at every scale, including sub-segments nested inside segments — or when you want to see exactly how close any two groups are to each other.
Not for categorical-only data or very large tables (the distance matrix caps the analysis at a 1,500-row sample — use the k-means tool for bulk segmentation), and not when clusters are elongated or density-defined shapes.
Built for: Analysts, marketers, and researchers looking for natural segments and their nested structure in behavioral or performance data
Typical data source: Any spreadsheet or CSV with an ID/name column and several numeric columns describing each row
Any table where each row is a named entity described by numeric columns. For example, customer behavior metrics:
Minimum 30 rows · Best with 100-1,500 rows and 2-12 numeric columns (larger tables run on a reproducible 1,500-row sample)
Standard-library analysis: agglomerative hierarchical clustering on standardized features. Unlike k-means, the full cluster tree is built first — structure at every scale — and only then cut, with the number of segments chosen by average silhouette width and cross-checked against the tree's own merge-height gaps. Ward.D2 linkage for compact interpretable groups, three linkages compared by cophenetic correlation, profiles as a z-score heatmap, a 2-D map, and every segment illustrated with named example rows. Works on any dataset: map 2 or more numeric columns plus a label column.
The dendrogram's scree — where merge heights jump, the tree was forced to weld distant groups together, marking the natural number of segments.
The evidence for the chosen cut of the tree — a clear peak means the segment count is a real property of your data, not a guess.
All segments drawn on one 2-D map — visually distinct islands confirm the segmentation.
What defines each segment: its average on every feature in standard-deviation units, as a heatmap.
Every segment sized and characterized, with real rows from your data named as examples.
Plain-English interpretation — what the numbers mean, what's significant, and what to do next.
How many kinds of customers do I have — without guessing first?
Map your behavioral columns and a customer ID. The full cluster tree is built before any count is chosen, the merge-height scree shows where it naturally cuts, and every segment comes back sized, profiled in standard-deviation units, and illustrated with named example customers.
See our FAQ for details on pricing, data privacy, and how the analysis works. Every report includes a Methodology section showing the statistical test, assumptions checked, and diagnostics run.
Run any analysis on your own data — validated R analyses, interactive reports, AI insights, and PDF export.
Try Free — No Credit CardTell us what went wrong, in your own words. We capture the page you're on automatically, so no need to describe where you are.