Finding Structure Without Labels
Working Without an Answer Key
Three useful questions can be asked of data nobody has labelled, none of them has a score to check against, and every method answers whether or not there is anything there.
What is missing
Everything in the previous two courses rested on one arrangement. Each row
came with an answer, some rows were hidden, the model was asked about them,
and the comparison was the score.
Now the answers are gone. A table of forty thousand customers, each with
sixty columns and no column saying what they are. A pile of documents. A month
of sensor readings. Nobody has labelled any of it, and labelling it would cost
more than the project is worth.
This is the ordinary situation. Most data that exists has never been
labelled, and the methods for it are the easiest in the field to fool yourself
with, for a reason that this lesson is entirely about.
Three questions
Almost everything anybody wants from unlabelled data is one of three things.
| what goes in | what comes out | typical use | |
|---|---|---|---|
| which rows belong togeth | 40000 | 40000 | 1 |
| how few numbers describe | 60 | 2 | 2 |
| which rows are unlike th | 40000 | 40 | 3 |
Naming which of the three a task is settles a great deal before any method is
chosen. A request to understand the customers is not a task; a request to
divide them into a handful of groups that marketing will treat differently is
one, and it carries its own standard of success, which is whether marketing
can act on the groups.
There is no score
In the previous courses a model was judged by hiding some answers and checking
against them. That procedure needs answers. Here there are none, so there is
nothing to hide and nothing to check.
This is not a gap that cleverness closes. It is the definition of the
situation. Several numbers get reported as though they were scores, and every
one of them is computed from the same data the method was fitted on, using the
same notion of distance the method was trying to optimise. A method that
groups points tightly around centres will score well on a measure of how
tightly points sit around centres, whatever the data looks like.
- how many groups were asked for
- the centre of group g
- a row assigned to that group
- whatever distance was chosen, which is the subject of the next lesson
The method always answers
Here is the fact that makes this subject dangerous.
Ask a grouping method for four groups and it returns four groups. It returns
them on data with four real groups in it, and it returns them on data drawn
uniformly from a square, with no structure of any kind. The output looks the
same: four centres, four coloured regions, a chart anybody would accept.
| step | what the data actually is | groups asked for | what came back | within group spread |
|---|---|---|---|---|
| 1 | four well separated blobs | 4 | four groups matching the blobs | 0.41 |
| 2 | points spread evenly over a square | 4 | four groups, four tidy regions | 0.58 |
| 3 | one long thin band of points | 4 | four groups, the band cut in four | 0.33 |
| 4 | four well separated blobs | 7 | the four blobs, three of them cut in two | 0.22 |
The procedure has no way to report that the question was wrong, because it was
never given a way to represent that answer. It was asked for four groups and
four groups is what it knows how to produce.
What can stand in for a score
Two things cannot be manufactured by the method itself, and between them they
carry most of the honest evidence available in this course.
The first is stability. Refit the method on a different sample of the same
data, or on nine tenths of it, and see whether roughly the same structure
comes back. A real division of the data survives this. A division the method
imposed on an empty square does not, because there was nothing determining
where the boundaries fell.
The second is prediction of something held out. Find a column that was not
used in the grouping, something known about each row but kept out of the
method, and ask whether the groups differ on it. Groups built from purchase
history that turn out to differ sharply in cancellation rate have told you
something, and the cancellation rate was never available to the method.
| can be computed by the m | survives on structureles | worth reporting | |
|---|---|---|---|
| the within group spread | 1 | 1 | 0 |
| a chart of the groups in | 1 | 1 | 0 |
| stability under resampli | 0 | 0 | 1 |
| difference on a held out | 0 | 0 | 1 |
The rest of the course teaches the methods and this scepticism together,
because teaching them apart produces people who can run a grouping and cannot
tell whether it means anything. The next lesson starts underneath all of them,
with the notion of distance that every one of these methods is built on and
that quietly decides most of the answer.
Recap
- The three questions worth asking of unlabelled data are which rows belong together, how few numbers describe a row, and which rows do not look like the rest.
- There is no held back score here, because there is nothing to hold back, so the whole apparatus of the previous courses for telling a good model from a bad one is unavailable.
- Every method returns an answer on every data set, including data with no structure in it at all, which is why the result must be argued for rather than displayed.
This is the reading half
Starting the course gives you your own copy of it. Every idea on every page has problems standing under it, marked with a reason rather than a tick, and any sentence you do not believe can be opened and argued with. None of that can happen on a page nobody owns.
The contents