BIRCH Clustering on Iris Flowers

BIRCH Clustering on Iris Flowers produced 3 clusters and 0 noise rows (silhouette 0.454, adjusted Rand 0.661 against held-out species).

Results of this run

BIRCH CF-tree on Iris Flowers (threshold 0.5, then k=3, threshold=0.5) scores silhouette 0.454, CF-tree Calinski-Harabasz 219.8, CF-tree Davies-Bouldin 0.822. Held-out species versus the leaf clustering: adjusted Rand 0.661. 0 noise rows out of 150 in the tree. CF leaf 0 on Iris Flowers holds 71 rows (petal length (cm) 4.47 / sepal length (cm) 5.95). CF leaf 1 on Iris Flowers holds 49 rows (petal length (cm) 1.47 / sepal length (cm) 5.02). CF leaf 2 on Iris Flowers holds 30 rows (petal length (cm) 5.83 / sepal length (cm) 6.95). BIRCH k path: k 2 splits to 0.577 with 2 groups on Iris Flowers; k 3 splits to 0.454 with 3 groups on Iris Flowers; k 4 splits to 0.405 with 4 groups on Iris Flowers; k 5 splits to 0.348 with 5 groups on Iris Flowers; k 6 splits to 0.338 with 6 groups on Iris Flowers; k 7 splits to 0.327 with 7 groups on Iris Flowers; k 8 splits to 0.303 with 8 groups on Iris Flowers. CF-tree scatter keeps 95.8%.

BIRCH Clustering on Iris Flowers: PCA plot of 3 clusters and 0 noise rows
Each point is one row. Gray points are noise. Computed 2026-11-02 with scikit-learn 1.4.2.
kSilhouetteClusters
20.5772
30.4543
40.4054
50.3485
60.3386
70.3277
80.3038
from sklearn.cluster import Birch
from sklearn.preprocessing import StandardScaler
Xs = StandardScaler().fit_transform(X)
labels = Birch(n_clusters=3, threshold=0.5).fit_predict(Xs)

Who, how, and why

Method: StandardScaler, drop constant columns. Code version 3e4afc4b4352 (scripts/seo/build_explore_artifacts.py). scikit-learn 1.4.2. Seed 42. Dataset source: UCI Machine Learning Repository, Iris (Fisher, 1936). License: CC BY 4.0. The species column was held out of the fit and used only for the adjusted Rand score.

Results computed on 2026-11-02.

The results paragraph is filled from these numbers by a fixed template in the site code, so the scores can be checked against the same dataset in the tool.

Maintainer: nikolaou1982.

Contact: nick1982100@gmail.com.

How BIRCH Clustering Works

BIRCH efficiently clusters very large datasets by building a CF-tree summary structure, then applying a secondary clustering step.

About the Iris Flowers Dataset

Classic 150-sample dataset with 4 petal/sepal measurements across 3 species. The gold standard for clustering & classification demos. Source: UCI Machine Learning Repository, Iris (Fisher, 1936). License: CC BY 4.0.

Samples. 150

Features. 4

Type. Numeric

Category. Hierarchical

When to Use BIRCH Clustering

BIRCH Clustering belongs to the Hierarchical family of clustering algorithms. These methods build a tree of clusters, either by merging (agglomerative) or splitting (divisive). They reveal multi-scale structure in data.

Related Examples

Ready to try BIRCH Clustering on your own data?

Upload a CSV and get instant results — free to start.