filler
^up^ [01] >>

Unsupervised Classification

L. Allison, Computer Science & Software Engineering, Monash University, Australia 3800

Problem:   Given multivariate data, i.e. S things, each having D attributes, place the things in T classes (groups, kinds, species, ...) in a way that best reflects the similarities and differences between the things.

  12...D
1 x1,1 x1,2 ... x1,D
2 x2,1 x2,2 ... x2,D
... ... ... ... ...
... ... ... ... ...
S xS,1 xS,2 ... xS,D

This document is online at   http://www.csse.monash.edu.au/~lloyd/Archive/2005-04-un-class/index.shtml   and contains hyper-links to other resources.


filler
<< [02] >>

Must infer

NB. Class memberships are nuisance parameters if we are interested in the optimal class structure!

filler
<< [03] >>

Variations and related problems


filler
<< [04] >>

Back to basic Unsupervised Classification: Must infer

Simplest model: One class.

Most complex model: One class per thing.

Almost always, neither is sensible.

filler


<< [05] >>

The required tools: The abilities to state


filler
<< [06] >>

Now see "mixture modelling".


© L. Allison, School of Computer Science and Software Engineering, Monash University, Australia 3800.
Created with "vi (IRIX)",   charset=iso-8859-1