BIRCH Clustering on Wine (UCI wine recognition)

BIRCH Clustering on Wine (UCI wine recognition) produced 3 clusters and 0 noise rows (silhouette 0.277, adjusted Rand 0.790 against held-out wine_class).

Results of this run

BIRCH CF-tree on Wine (UCI wine recognition) (threshold 0.5, then k=3, threshold=0.5) scores silhouette 0.277, CF-tree Calinski-Harabasz 67.6, CF-tree Davies-Bouldin 1.419. Held-out wine_class versus the leaf clustering: adjusted Rand 0.790. 0 noise rows out of 178 in the tree. CF leaf 0 on Wine (UCI wine recognition) holds 58 rows (proline 501.4 / magnesium 92.55). CF leaf 1 on Wine (UCI wine recognition) holds 56 rows (proline 624.9 / magnesium 99.86). CF leaf 2 on Wine (UCI wine recognition) holds 64 rows (proline 1076.0 / magnesium 106.2). BIRCH k path: k 2 splits to 0.267 with 2 groups on Wine (UCI wine recognition); k 3 splits to 0.277 with 3 groups on Wine (UCI wine recognition); k 4 splits to 0.226 with 4 groups on Wine (UCI wine recognition); k 5 splits to 0.187 with 5 groups on Wine (UCI wine recognition); k 6 splits to 0.180 with 6 groups on Wine (UCI wine recognition); k 7 splits to 0.187 with 7 groups on Wine (UCI wine recognition); k 8 splits to 0.188 with 8 groups on Wine (UCI wine recognition). CF-tree scatter keeps 55.4%.

BIRCH Clustering on Wine (UCI wine recognition): 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.2672
30.2773
40.2264
50.1875
60.1806
70.1877
80.1888
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, wine recognition. License: CC BY 4.0. The wine_class 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 Wine (UCI wine recognition) Dataset

178 samples and 13 chemical measurements from three cultivars. The column held out of clustering is the cultivar, not a quality score. Source: UCI Machine Learning Repository, wine recognition. License: CC BY 4.0.

Samples. 178

Features. 13

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.