About Elbow Method Calculator
This elbow method calculator runs k-means for every k from 1 to 10 on your points and plots the inertia, so you can see the bend that marks a sensible number of clusters. It is free, needs no sign-up and runs in your browser, so nothing you enter is uploaded.
Inertia, the sum of squared distances to the nearest centroid, always falls as k grows; with one cluster per point it would be zero. The question is where the improvement slows. On the sample data, going from one cluster to two cuts inertia sharply, and from two to three again, but beyond three each extra cluster barely helps. The bend is at k = 3, which matches the three groups.
Each point on the elbow plot is the best of four k-means runs with different starts, so one unlucky start does not distort the curve. The page opens with k = 2 so you can see the elbow suggest a better value.
How to use Elbow Method Calculator
- Pick a sample dataset, tap the plot to add points of your own, or paste x,y lines in the CSV box and press "Use these points".
- Set the number of clusters k, and choose k-means++ or random initialisation.
- Press Step. The first press assigns each point to its nearest centroid; the next moves each centroid to the mean of its points.
- Keep stepping, or press "Run to convergence", until the assignment stops changing.
- Read the inertia and the silhouette score, and look at the elbow plot to judge whether k is a good choice.
- Press "New start" to try a different random starting position, and see whether the clusters change.
Features
- Step-through mode that separates the assign step from the update step.
- Run to convergence with a clear converged message.
- k-means++ and random initialisation, with a repeatable seed and a New start button.
- Tap or click to add points, five sample datasets and CSV input for up to 3,000 points.
- Inertia, step count and mean silhouette score, updated as you go.
- An elbow plot of inertia for k from 1 to 10, with a marker at your k and the sharpest bend named.
- Touch-friendly canvas that scales to your screen and keeps vertical page scrolling working.
Worked examples
Three blobs, k = 1 to 6 gives 116309, 57235, 13462, 11001, 9218, 7938
The drop from k = 2 to k = 3 is far larger than from k = 3 to k = 4.
Privacy: how it works
- The points and the clustering stay in your browser tab. Nothing is sent to Ulkaa or anyone else.
Tips
- Scale your features first when they have very different units. K-means uses raw distance, so a column with a large range dominates.
- If the elbow is not clear, check the silhouette score for several values of k.
- An empty cluster keeps its previous centroid in this tool, so a bad start can leave a cluster unused. Use New start or k-means++.
- Adding a few outliers can drag a centroid away, because the mean is not robust. Tap far from the others to try it.
Frequently asked questions
Is it really free?
Yes. There is no price, no trial and no credit card. Ulkaa Tool does the work with your own device, so there is no server bill to pass on to you.
Do I need an account?
No. There is no sign-up and no login. Open the page and use it. An Ulkaa account is not needed for anything on this tool.
Does it run in my browser?
Yes. Your points are processed by code running in your browser tab, on your own device.
Is my data uploaded?
No. Your points are never sent to Ulkaa or to anyone else. You can check this yourself by watching the Network tab in your browser developer tools while you use the tool.
How does the elbow method work?
Run k-means for a range of k, plot the inertia, and pick the k where the curve bends and stops falling steeply.
What if there is no clear elbow?
Then the data may not have well separated groups. Check the silhouette score and try different features.
More K-Means Clustering Visualizer pages
- K-Means Clustering VisualizerWatch k-means assign points and move centroids, one step at a time, on your own data.
- Silhouette Score CalculatorCluster your points and read the mean silhouette score.
- K-Means++ VisualizerWatch k-means++ pick starting centroids, then step to convergence.
- K-Means With Random InitialisationStart k-means from random data points and see how the outcome depends on the start.
- K-Means on the Two Moons DatasetCluster two interlocking half circles and see where k-means cuts them.
- K-Means on Concentric CirclesCluster a ring around a core and see why straight boundaries cannot separate them.
- K-Means Clustering From CSVPaste x,y data, choose k and cluster it in your browser.