How Spectral Clustering Works
Spectral clustering uses eigenvalues of a similarity graph to find non-convex cluster structures like rings, spirals, and manifolds.
About the Customer Segments Dataset
200 synthetic customer records with spending, income, and loyalty data. Perfect for market segmentation with clustering.
- Samples
- 200
- Features
- 5
- Type
- Numeric
- Category
- Graph-based
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 Spectral Clustering
Spectral Clustering belongs to the Graph-based family of clustering algorithms. These methods model data as a graph and find clusters using spectral properties of the similarity matrix.
Related Examples
K-Means Clustering on Customer Segments
See K-Means Clustering applied to the Customer Segments dataset (200 samples, 5 features). Interactive visualization, metrics, and analysis.
K-Medoids Clustering on Customer Segments
See K-Medoids Clustering applied to the Customer Segments dataset (200 samples, 5 features). Interactive visualization, metrics, and analysis.
DBSCAN Clustering on Customer Segments
See DBSCAN Clustering applied to the Customer Segments dataset (200 samples, 5 features). Interactive visualization, metrics, and analysis.
HDBSCAN Clustering on Customer Segments
See HDBSCAN Clustering applied to the Customer Segments dataset (200 samples, 5 features). Interactive visualization, metrics, and analysis.