How Bisecting K-Means Clustering Works
Bisecting K-Means recursively splits clusters in half, combining K-Means efficiency with a divisive hierarchical structure.
About the Wine Quality Dataset
178 wine samples with 13 chemical properties. Ideal for discovering natural groupings or predicting wine class.
- Samples
- 178
- Features
- 13
- Type
- Numeric
- Category
- Hierarchical
Key Metrics to Watch
Silhouette Score
Measures how similar a point is to its own cluster vs. other clusters. Ranges from −1 to +1; higher is better.
Calinski-Harabasz Index
Ratio of between-cluster to within-cluster variance. Higher values indicate denser, well-separated clusters.
Davies-Bouldin Index
Average similarity between each cluster and its most similar cluster. Lower is better.
Inertia (Within-Cluster SSE)
Sum of squared distances from each point to its assigned centroid. Lower indicates tighter clusters.
When to Use Bisecting K-Means Clustering
Bisecting K-Means 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
K-Means Clustering on Wine Quality
See K-Means Clustering applied to the Wine Quality dataset (178 samples, 13 features). Interactive visualization, metrics, and analysis.
K-Medoids Clustering on Wine Quality
See K-Medoids Clustering applied to the Wine Quality dataset (178 samples, 13 features). Interactive visualization, metrics, and analysis.
DBSCAN Clustering on Wine Quality
See DBSCAN Clustering applied to the Wine Quality dataset (178 samples, 13 features). Interactive visualization, metrics, and analysis.
HDBSCAN Clustering on Wine Quality
See HDBSCAN Clustering applied to the Wine Quality dataset (178 samples, 13 features). Interactive visualization, metrics, and analysis.