# Unsupervised learning

- Link: https://arqiv.si/ai/unsupervised-learning/
- Published: 2026-10-10T14:16:25-04:00
- Author: Steven Ryan

[Skip to content](https://arqiv.si/ai/unsupervised-learning/#main-content)

[arqiv](https://arqiv.si/)

[For educators](https://arqiv.si/teachers/)

Teach

 * [Start here](https://arqiv.si/teachers/)
 * [Lessons & printable kits](https://arqiv.si/teachers/resources/)
 * [Classroom labs](https://arqiv.si/teachers/labs/)
 * [Free 20-minute lesson](https://arqiv.si/teachers/free-ai-lesson/)

Plan

 * [Curriculum guide](https://arqiv.si/teachers/curriculum/)
 * [AI Learning Center](https://arqiv.si/teachers/ai-literacy/)
 * [Future of work unit](https://arqiv.si/future-of-work/)
 * [What the research says](https://arqiv.si/teachers/what-works/)
 * [AI education worldwide](https://arqiv.si/teachers/around-the-world/)

Understand

 * [Think First method](https://arqiv.si/teachers/think-first/)
 * [Our approach](https://arqiv.si/research/#our-method)
 * [AI vocabulary](https://arqiv.si/teachers/ai-vocabulary/)

By role

 * [Counselors](https://arqiv.si/counselors/)
 * [School leaders & PD](https://arqiv.si/schools/)
 * [Speaking & workshops](https://arqiv.si/speaking/)
 * [Products](https://arqiv.si/products/)

[Learn AI](https://arqiv.si/ai/topics/)

Start

 * [All AI topics](https://arqiv.si/ai/topics/)
 * [The AI journey, from zero](https://arqiv.si/ai/)
 * [Using AI well](https://arqiv.si/ai/talking-to-ai/)
 * [AI builds](https://arqiv.si/ai-builds/)

AI in the world

 * [Space](https://arqiv.si/space/)
 * [Weather](https://arqiv.si/weather/)
 * [Health](https://arqiv.si/health/)
 * [Engineering](https://arqiv.si/engineering/)
 * [Farming](https://arqiv.si/farming/)
 * [Quantum](https://arqiv.si/quantum/)

What it means

 * [Future of work](https://arqiv.si/future-of-work/)
 * [Your AI path](https://arqiv.si/ai/your-path/)
 * [Research, explained](https://arqiv.si/research/)

[Games & labs](https://arqiv.si/games/)[Research](https://arqiv.si/research/)[Blog](https://arqiv.si/blog/)
[About](https://arqiv.si/about/)

[Search or ask](https://arqiv.si/ai/topics/)[Newsletter](https://arqiv.si/newsletter/)
[ARQIV.FM ↗](https://arqiv.fm/)

Menu

For educators

[For educators: start page →](https://arqiv.si/teachers/)

Teach

 * [Start here](https://arqiv.si/teachers/)
 * [Lessons & printable kits](https://arqiv.si/teachers/resources/)
 * [Classroom labs](https://arqiv.si/teachers/labs/)
 * [Free 20-minute lesson](https://arqiv.si/teachers/free-ai-lesson/)

Plan

 * [Curriculum guide](https://arqiv.si/teachers/curriculum/)
 * [AI Learning Center](https://arqiv.si/teachers/ai-literacy/)
 * [Future of work unit](https://arqiv.si/future-of-work/)
 * [What the research says](https://arqiv.si/teachers/what-works/)
 * [AI education worldwide](https://arqiv.si/teachers/around-the-world/)

Understand

 * [Think First method](https://arqiv.si/teachers/think-first/)
 * [Our approach](https://arqiv.si/research/#our-method)
 * [AI vocabulary](https://arqiv.si/teachers/ai-vocabulary/)

By role

 * [Counselors](https://arqiv.si/counselors/)
 * [School leaders & PD](https://arqiv.si/schools/)
 * [Speaking & workshops](https://arqiv.si/speaking/)
 * [Products](https://arqiv.si/products/)

Learn AI

[Learn AI: start page →](https://arqiv.si/ai/topics/)

Start

 * [All AI topics](https://arqiv.si/ai/topics/)
 * [The AI journey, from zero](https://arqiv.si/ai/)
 * [Using AI well](https://arqiv.si/ai/talking-to-ai/)
 * [AI builds](https://arqiv.si/ai-builds/)

AI in the world

 * [Space](https://arqiv.si/space/)
 * [Weather](https://arqiv.si/weather/)
 * [Health](https://arqiv.si/health/)
 * [Engineering](https://arqiv.si/engineering/)
 * [Farming](https://arqiv.si/farming/)
 * [Quantum](https://arqiv.si/quantum/)

What it means

 * [Future of work](https://arqiv.si/future-of-work/)
 * [Your AI path](https://arqiv.si/ai/your-path/)
 * [Research, explained](https://arqiv.si/research/)

 * [Games & labs](https://arqiv.si/games/)
 * [Research](https://arqiv.si/research/)
 * [Blog](https://arqiv.si/blog/)
 * [About](https://arqiv.si/about/)

[Get the newsletter](https://arqiv.si/newsletter/)

 1.  [ARQIV / FOUNDATIONS](https://arqiv.si/ai/topics/)
 2.  [**01**Map of AI](https://arqiv.si/ai/map-of-ai/)
 3.  [**02**Machine learning](https://arqiv.si/ai/machine-learning/)
 4.  [**03**Data](https://arqiv.si/ai/data-and-datasets/)
 5.  [**04**Numbers & tensors](https://arqiv.si/ai/tensors/)
 6.  [**05**Training vs using](https://arqiv.si/ai/training-and-inference/)
 7.  [**06**Evaluating AI](https://arqiv.si/ai/evaluating-ai/)
 8.  [**07**Classical models](https://arqiv.si/ai/classical-machine-learning/)
 9.  [**08**Finding groups](https://arqiv.si/ai/unsupervised-learning/)
 10. [**09**Retrieval & RAG](https://arqiv.si/ai/retrieval-and-rag/)

AI foundations · 08

# Can a computer find _groups nobody labeled?_

Yes. A **clustering** method sorts examples into groups by how close their measurements
are, with no answers given in advance. But the computer only finds groups of numbers.
What a group _means_, and whether it matters, is for people to check, and different
measurements or a different number of groups give different groups.

Grades 6+15 minutesLight math: averages and squaresSimpler version for grades 3–
5

What you will be able to do

Run the k-means method by hand on a few points, explain why its result depends on
the number of groups, the starting centers and the chosen measurements, and explain
why a person has to check what a discovered group means.

Before you start

Read [How can examples become a rule?](https://arqiv.si/ai/machine-learning/) first,
for the words feature and label. You need to know how to average a few numbers.

1 · You have already seen this

## Groups that nobody _named in advance_

Some apps sort your things into groups without being told what the groups are.

A photo app can put similar-looking pictures together so you can sort them faster,
though nobody told it what is in them. A music service can group songs with similar
patterns, and then a person decides what each group is for, such as a playlist theme.
If you have ever sorted a pile of picture cards with no categories given, you know
there is more than one way to do it, by color or by size.

This is **unsupervised learning**: the computer gets measurements but no answers,
and looks for structure in them. The most common job is **clustering**, which puts
similar examples into groups. This page uses made-up songs measured by tempo and
energy. It shows how that works, lets you try it, and shows where it goes wrong.

2 · What happens, step by step

## From measurements to _groups_

Clustering with k-means in five steps. The next section goes deeper into step 1,
the one after it into steps 2 to 4, and the lab lets you run steps 3 and 4 yourself.

How k-means clustering works

### Five steps

 1. 1 · Measure every exampleEach example gets the same measurements, its **features**,
    such as tempo and energy for each song. Nobody supplies labels.
 2. 2 · Choose the number of groupsYou pick **k**, the number of groups you want. The
    computer places k **centers** as starting points.
 3. 3 · AssignEvery example joins the center nearest to it.
 4. 4 · Move and repeatEvery center moves to the average position of the examples that
    joined it. Assign and move repeat until no example changes group.
 5. 5 · Look at the groupsThe computer only gives you “group 1, group 2.” A person 
    looks at what each group has in common and decides whether it means anything.

Going deeper · step 1

## No labels, _only measurements_

In supervised learning every example comes with the answer. In unsupervised learning
nobody supplies answers.

Most of the models on this route learn from **labeled** examples: photos marked “
cat” or “dog,” emails marked “spam” or “not spam.” That is supervised learning. 
Often, though, you only have the measurements (the **features**) and no labels at
all: thousands of songs with their tempo and energy, or shop visits with what was
bought. Labeling them by hand would take too long, or nobody knows the right categories
yet.

**Unsupervised learning** looks for structure in data like that. Two jobs are common.**
Clustering** puts similar examples into groups. **Dimensionality reduction** squashes
many measurements into a few, for example to draw a map. Both are useful for exploring,
and both need a person to ask, “What did it actually find?”

Made-up illustration. Without labels the computer can still draw the two groups,
but it cannot tell you that one is “calm songs.” That name is a guess a person makes
and then checks.

Going deeper · steps 2 to 4

## k-means: _assign, move, repeat_

The most famous clustering method needs only distances and averages.

In **k-means**, you choose **k**, the number of groups you want. The computer places
k **centers** (starting points), then repeats two steps:

**1. Assign.** Every example joins the center nearest to it. **2. Move.** Every 
center moves to the average position of the examples that joined it. Then assign
again, and so on, until no example changes group.

To score the groups, k-means uses the **spread**: for every example, take the distance
to its center, square it, and add up all the squares. (scikit-learn calls this number
_inertia_, or the within-cluster sum of squares.) Smaller spread means tighter groups.
Each assign step and each move step can only lower the spread or leave it the same,
so k-means always finishes. But it can finish in a **worse** place than the best
possible one, depending on where the centers started. Real tools therefore run k-
means several times from different starts and keep the run with the lowest spread.

Predict first

Song R sits at (3, 3). The centers are at C1 = (2, 4) and C2 = (6, 4). Which center
does R join, and what is its squared distance?

Show the answer

R joins **C1**. To C1: (3 − 2)² + (3 − 4)² = 1 + 1 = 2. To C2: (3 − 6)² + (3 − 4)
² = 9 + 1 = 10. You do not need the square root to compare distances: the nearer
center always has the smaller sum of squares.

Worked example

### One round of k-means with six made-up songs

 1. DataSix songs, each measured as (tempo, energy) on a 0–10 scale: P (1, 2), Q (2,
    1), R (3, 3), S (7, 8), T (8, 6), U (9, 7). We pick **k = 2** and start the centers
    at C1 = (2, 4) and C2 = (6, 4).
 2. DistanceFor each song, square the difference in tempo, square the difference in
    energy, and add. P to C1: (1 − 2)² + (2 − 4)² = 1 + 4 = **5**. P to C2: (1 − 6)
    ² + (2 − 4)² = 25 + 4 = **29**. P is nearer C1.
 3. 1 · AssignQ: 9 to C1, 25 to C2. R: 2 to C1, 10 to C2. S: 41 to C1, 17 to C2. T:
    40 to C1, 8 to C2. U: 58 to C1, 18 to C2. So P, Q, R join C1 and S, T, U join C2.
    Spread = 5 + 9 + 2 + 17 + 8 + 18 = **59**.
 4. 2 · MoveC1 moves to the average of P, Q, R: tempo (1 + 2 + 3) ÷ 3 = 2, energy (
    2 + 1 + 3) ÷ 3 = 2, so **(2, 2)**. C2 moves to the average of S, T, U: (7 + 8 +
    9) ÷ 3 = 8 and (8 + 6 + 7) ÷ 3 = 7, so **(8, 7)**.
 5. New spreadP 1, Q 1, R 2, S 2, T 1, U 1. Spread = **8**, down from 59.
 6. Stop?Assign again: every song is still nearest its own center (R is 2 from C1 but
    25 + 16 = 41 from C2). No song changed group, so k-means stops.

All six songs are made up. A person still has to look at the result and decide whether“
group C1” means anything, such as “slow, calm songs.”

3 · Try it

## Cluster _fourteen songs_

Each song has two made-up measurements: tempo (slow to fast) and energy (calm to
intense).

Predict first

With k = 3, will every starting position for the centers end with the same three
groups?

Show the answer

No. “Along the diagonal” and “Down the left side” both finish with a spread of **
43**. “Along the bottom” gets stuck at **77.71**: two groups of songs end up sharing
one center, because no single step could improve things. k-means always stops, but
not always at the best answer. Try it in the lab.

Lab

### Step through k-means

Pick k and a set of starting centers. Press Step to do one move at a time: first
every song joins its nearest center, then every center moves to the average of its
songs. Watch the spread, then compare starts.

 Simulated in your browser with 14 made-up songs. Fixed starting centers, no randomness.

Number of groups (k)

Spread now**–**

Steps taken**0**

Groups

What happened, step by step

Move a song (changes the data)

Song

Moving a song changes the measurements, so the spread can jump up. Then press Step
and watch k-means react.

Finished runs (to compare starts and values of k)

 * None yet.

The interactive version needs JavaScript. Here is the same lab as tables. Each run
repeats two steps: every song joins its nearest center, then every center moves 
to the average of its songs. It stops when no song changes group. Look at the three
runs for k = 3: two starts finish with a spread of 43, but “Along the bottom” gets
stuck at 77.71.

Fourteen made-up songs| Song | Tempo (0 slow, 10 fast) | Energy (0 calm, 10 intense) | 
| Song 1 | 2 | 1 | 
| Song 2 | 8 | 8 | 
| Song 3 | 5 | 5 | 
| Song 4 | 1 | 8 | 
| Song 5 | 3 | 2 | 
| Song 6 | 9 | 8 | 
| Song 7 | 4 | 6 | 
| Song 8 | 2 | 9 | 
| Song 9 | 1 | 2 | 
| Song 10 | 7 | 9 | 
| Song 11 | 6 | 4 | 
| Song 12 | 3 | 7 | 
| Song 13 | 2 | 3 | 
| Song 14 | 8 | 7 |

Every run in the lab, worked out in advance| Run | Starting centers | Spread after each step | Final groups (song numbers) | Final spread | 
| k = 2, Left and right | (1, 5), (9, 5) | 158 → 101.78 → 101.45 → 97 | 1, 3, 4, 5, 7, 8, 9, 11, 12, 13 | 2, 6, 10, 14 | 97 | 
| k = 2, Bottom-left and top-right | (1, 1), (9, 9) | 262 → 105.16 | 1, 3, 4, 5, 7, 9, 11, 12, 13 | 2, 6, 8, 10, 14 | 105.16 | 
| k = 2, Top-left and bottom-right | (1, 9), (9, 1) | 422 → 178.4 → 172.73 → 165.14 → 155.71 → 130.29 → 110.98 → 104.67 → 104.24 → 101.78 → 101.45 → 97 | 1, 3, 4, 5, 7, 8, 9, 11, 12, 13 | 2, 6, 10, 14 | 97 | 
| k = 3, Along the diagonal | (1, 1), (5, 5), (9, 9) | 86 → 43 | 1, 5, 9, 13 | 3, 4, 7, 8, 11, 12 | 2, 6, 10, 14 | 43 | 
| k = 3, Down the left side | (1, 1), (1, 5), (1, 9) | 278 → 80 → 79.44 → 75.67 → 70.78 → 62.4 → 50.96 → 43 | 1, 5, 9, 13 | 3, 4, 7, 8, 11, 12 | 2, 6, 10, 14 | 43 | 
| k = 3, Along the bottom | (1, 1), (5, 1), (9, 1) | 422 → 90.05 → 82.35 → 77.71 | 1, 4, 5, 8, 9, 12, 13 | 3, 7, 11 | 2, 6, 10, 14 | 77.71 | 
| k = 4, Along the diagonal | (0, 0), (3, 3), (6, 6), (9, 9) | 98 → 65 → 51.28 → 44.47 → 39.74 → 32.8 → 22.96 → 19 → 19 → 16 | 1, 5, 9, 13 | 4, 8, 12 | 3, 7, 11 | 2, 6, 10, 14 | 16 | 
| k = 4, Four corners | (1, 1), (1, 9), (9, 1), (9, 9) | 102 → 32.4 → 22.88 → 19 | 1, 5, 9, 13 | 4, 7, 8, 12 | 3, 11 | 2, 6, 10, 14 | 19 | 
| k = 4, Along the bottom | (1, 1), (4, 1), (7, 1), (10, 1) | 413 → 87.9 → 81.54 → 61.4 → 49.96 → 41.67 | 1, 5, 9, 13 | 3, 4, 7, 8, 11, 12 | 2, 10, 14 | 6 | 41.67 |

The human part

## A cluster is _not yet a category_

k-means gives you “group 1, group 2, group 3.” Turning that into knowledge is a 
separate job.

After a run you might look at the songs in one group and see that they are all fast
and intense. You could call it “workout songs.” That name is **your interpretation**,
not something the computer found. Maybe those songs are fast because they all came
from one playlist a friend made. To trust a name, you check: listen to the songs,
look at what else they have in common, and see whether new songs fit.

The groups also depend on choices people made before the computer ran. **Which measurements?**
Cluster the same songs by length and release year and you get completely different
groups. **How are they scaled?** If tempo were in beats per minute (60 to 180) and
energy on a 0–10 scale, tempo would swamp the distances, so tools usually rescale
features first. **Which k?** In the best k = 3 run, songs 3, 7 and 11, which sit
in the middle of the chart, join the slow, intense songs; with k = 4 they get a 
group of their own. Neither answer is “the truth.” Which one is useful depends on
what you want to do.

Predict first

In the lab, the best spread for k = 2 is 97, for k = 3 it is 43, and for k = 4 it
is 16. Should you always pick the k with the smallest spread?

Show the answer

No. More groups always allow a smaller spread. With 14 groups, one per song, the
spread would be 0, and the “groups” would tell you nothing. People look for the 
point where adding a group stops helping much (here the drop is 54 from k = 2 to
3, then 27 from 3 to 4), and above all they ask whether the groups make sense and
are useful.

Dimensionality reduction

## Squash many measurements _into a map_

Our songs had two measurements, so they fit on a flat chart. Real data rarely does.

A music service might describe each song with a dozen numbers: tempo, energy, loudness,
how acoustic it sounds, how much talking it has, its length, and more. Nobody can
draw a chart with twelve directions. **Dimensionality reduction** squashes many 
measurements into a few, often two, so you can draw a map where similar songs land
near each other. It can also make clustering faster and less confused by measurements
that hardly matter.

Think of a shadow. A shadow of your hand keeps its outline but loses its depth, 
and two different objects can cast the same shadow. Squashing data works the same
way: **something is always lost**. Two points that are far apart in twelve directions
can land close together on the map.

**For older students:** one classic method, principal component analysis (PCA), 
finds the direction in which the data is most spread out and makes it the map’s 
first axis. The second axis is the next most spread-out direction at a right angle
to the first. Whatever spread lies in the other directions is dropped.

You have seen a map like this already. Language models store every word piece as
a long list of numbers called an **embedding**, and the meaning map in [“Turn words into places on a map”](https://arqiv.si/ai/transformers/#step2)
shows words in just two directions. That map is a simplified illustration. Maps 
made from real embeddings use dimensionality reduction, and they carry the same 
warning: closeness on the map is a hint, not proof.

Predict first

On a 2D map made from twelve song measurements, two songs land on exactly the same
spot. Are they the same kind of song?

Show the answer

Not necessarily. They match in the two directions the map kept, but they may differ
a lot in the directions that were squashed away, for example one is acoustic and
one is electronic. To be sure, you go back to the original measurements.

4 · Common mix-ups

## Groups are easy to _read too much into_

Four ideas that trip people up, and what to think instead.

 * **Mix-up:** The computer discovered the true categories in the data.
 * **Better:** It found groups that are close in the measurements people chose, 
   for the k they chose, from the start it was given. Whether a group is a real 
   category is a separate question that people check.
 * **Mix-up:** Unsupervised means no humans are involved.
 * **Better:** People choose the data, the measurements, the scaling and k, and 
   they interpret and name the groups. Only the labels are missing.
 * **Mix-up:** The smallest spread is always the best clustering.
 * **Better:** More groups always lower the spread. One group per example gives 
   a spread of 0 and no insight.
 * **Mix-up:** A 2D map of data shows the real distances.
 * **Better:** A squashed map loses information. Points that look close may be far
   apart in the original measurements.

5 · Check yourself

## Three _quick questions_

Answer in your head or on paper before you open each one.

 1.  A song is at (5, 5). Two centers are at (2, 2) and (8, 7). Which center does the
     song join? Show the squared distances.
 2.  Check your answer
 3.  To (2, 2): (5 − 2)² + (5 − 2)² = 9 + 9 = 18. To (8, 7): (5 − 8)² + (5 − 7)² = 
     9 + 4 = 13. The song joins **(8, 7)**, because 13 is smaller.
 4.  Two classmates run k-means with k = 3 on the same songs. One ends with a spread
     of 43 and the other with 77.71. Did one of them make a mistake?
 5.  Check your answer
 6.  Not necessarily. They probably started the centers in different places. k-means
     always finishes, but it can get stuck in a worse arrangement. The usual fix is
     to run it from several starts and keep the lowest spread, then still check whether
     the groups make sense.
 7.  A shop clusters its customers into four groups and calls group 3 “bargain hunters.”
     What should you ask before anyone uses that name?
 8.  Check your answer
 9.  Which measurements were used, and do the people in group 3 really share that trait,
     or is the name a guess? Does the group reflect how the data was collected? And
     how will the label be used: could it lead to treating some people unfairly? A 
     cluster is a group of numbers until a person checks what it means.

In the real world

## Where finding groups _helps, and where it misleads_

Application

### Grouping songs or customers

Music and shopping services group items or shoppers with similar patterns, then 
a person decides what each group is for, such as a playlist theme or a newsletter
topic.

Application

### Spotting the odd one out

An example that is far from every group center can be flagged for a person to look
at: a strange sensor reading on a machine, or an unusual payment. Many flags turn
out to be false alarms, so a human checks.

Application

### Organizing photos

Photo apps can put similar-looking pictures together so you can sort them faster.
You still decide which groups to keep and what to call them.

**Limitation: groups can mirror how the data was collected, and can harden stereotypes.**
Photos may cluster by camera or lighting instead of by what is in them. When the
examples are people, a cluster such as “customers from these neighborhoods” can 
turn into a label like “low-value customers” and then into decisions about real 
people, even though the group only reflects the measurements someone chose. Name
groups carefully, check them, and ask who could be treated unfairly. See [What did we teach it by accident?](https://arqiv.si/ai/data-and-datasets/)

**Connection:** once people have checked and named the groups, the names can become
labels for [supervised models](https://arqiv.si/ai/classical-machine-learning/),
which learn to sort new examples. And “far from every center” alarms need the same
care as any alarm: count the false alarms, as on [Good at what, for whom, compared with what?](https://arqiv.si/ai/evaluating-ai/)

For younger learners

## A _grades 3–5_ version

No numbers needed: the idea that the sorting rule makes the groups.

20 minutes · teacher-led

### Sort without labels

 1. Give each table the same 12 picture cards (animals, vehicles, foods) with no category
    names.
 2. Ask each table to make three groups any way they like, and to write down their 
    rule.
 3. Compare tables. One sorted by color, one by size, one by “things that move.” All
    are real groups.

Exit question

### Who was right?

Good answers say that every table found real groups, and that the groups came from
what each table chose to look at. That is exactly why a computer’s groups need a
person to check what they mean.

Honest limits

## What this page _leaves out_

What this page leaves out

Many other clustering methods exist: some build a family tree of groups (hierarchical
clustering), some find groups of any shape by looking for crowded regions (density-
based clustering), and some give each example a probability of belonging to each
group. Better ways to pick starting centers (such as k-means++), other map-making
methods (t-SNE, UMAP) and learning without labels inside neural networks (self-supervised
learning) are also left out. The scikit-learn guide in the sources lists them.

Where to go next

## Keep _going_

Next stop · 09

### How can an AI answer from documents it was given?

Retrieval and RAG: finding the right passages, often with embeddings, and checking
citations.

Maps of meaning

### Turn words into places on a map

Embeddings: the long lists of numbers a language model uses for each word piece.

Step back · 07

### Do you always need a neural network?

Supervised models that learn from labeled examples, compared on one small dataset.

Sources

## Where this comes from

 1. [scikit-learn User Guide, “Unsupervised learning”: clustering, decomposition (dimensionality reduction), density estimation and more.](https://scikit-learn.org/stable/unsupervised_learning.html)
 2. [scikit-learn User Guide, “Clustering,” section on k-means: the assign and move steps, inertia (within-cluster sum of squares) and why results depend on the starting centers.](https://scikit-learn.org/stable/modules/clustering.html)
 3. [scikit-learn User Guide, “Decomposing signals in components,” including principal component analysis (PCA).](https://scikit-learn.org/stable/modules/decomposition.html)
 4. [Google for Developers, Clustering course, “Advantages and disadvantages of k-means”: k is chosen manually, results depend on the starting values, outliers drag centers.](https://developers.google.com/machine-learning/clustering/kmeans/advantages-disadvantages)
 5. [Stuart P. Lloyd, “Least squares quantization in PCM,” _IEEE Transactions on Information Theory_ 28(2), 1982: the assign-and-move procedure now called k-means (Lloyd’s algorithm).](https://doi.org/10.1109/TIT.1982.1056489)

AI words on this page

[Unsupervised learning](https://arqiv.si/teachers/ai-vocabulary/#unsupervised-learning),
[Supervised learning](https://arqiv.si/teachers/ai-vocabulary/#supervised-learning),
[Clustering](https://arqiv.si/teachers/ai-vocabulary/#clustering), [Dimensionality reduction](https://arqiv.si/teachers/ai-vocabulary/#dimensionality-reduction),
[Feature](https://arqiv.si/teachers/ai-vocabulary/#feature), [Label](https://arqiv.si/teachers/ai-vocabulary/#label),
[Embedding](https://arqiv.si/teachers/ai-vocabulary/#embedding), [Vector](https://arqiv.si/teachers/ai-vocabulary/#vector),
[Hyperparameter (k is one)](https://arqiv.si/teachers/ai-vocabulary/#hyperparameter),
[Training data](https://arqiv.si/teachers/ai-vocabulary/#training-data), [Bias](https://arqiv.si/teachers/ai-vocabulary/#bias)

All definitions live in one place: [AI words in plain language →](https://arqiv.si/teachers/ai-vocabulary/)

Review status

Written by ARQIV. Last checked October 2026. Independent subject review and classroom
pilots are still to come, so treat the activities as drafts and [tell us](https://arqiv.si/ai/unsupervised-learning/info@arqiv.fm?subject=AI%20foundations%20correction)
about anything that is wrong or unclear.

[← Previous**Classical models**](https://arqiv.si/ai/classical-machine-learning/)
[Next →**Retrieval & RAG**](https://arqiv.si/ai/retrieval-and-rag/)

[arqiv](https://arqiv.si/)

A little understanding changes everything.

[LISTEN: ARQIV.FM, OUR WEEKLY SHOW ↗](https://arqiv.fm/)

Educators

 * [Start here](https://arqiv.si/teachers/)
 * [Lessons & kits](https://arqiv.si/teachers/resources/)
 * [Curriculum](https://arqiv.si/teachers/curriculum/)
 * [Labs](https://arqiv.si/teachers/labs/)
 * [AI vocabulary](https://arqiv.si/teachers/ai-vocabulary/)

For your role

 * [Counselors](https://arqiv.si/counselors/)
 * [School leaders & PD](https://arqiv.si/schools/)
 * [Speaking & workshops](https://arqiv.si/speaking/)
 * [Products](https://arqiv.si/products/)

Learn

 * [Learn AI](https://arqiv.si/ai/topics/)
 * [Games & labs](https://arqiv.si/games/)
 * [Future of work](https://arqiv.si/future-of-work/)
 * [Research](https://arqiv.si/research/)
 * [Headlines](https://arqiv.si/news/)

ARQIV

 * [About & corrections](https://arqiv.si/about/)
 * [Our approach](https://arqiv.si/research/#our-method)
 * [Newsletter](https://arqiv.si/newsletter/)
 * [Privacy](https://arqiv.si/privacy-policy/)
 * [Get in touch](https://arqiv.si/ai/unsupervised-learning/info@arqiv.fm)

Classroom activities collect no student data.[info@arqiv.fm](https://arqiv.si/ai/unsupervised-learning/info@arqiv.fm)
