4
$\begingroup$

I am asked to give a lecture on clustering algorithms for an audience that is not very technical. With that in mind, I wanted to do a simple exercise where I will ask the audience to identify groups from a dataset. However, I cannot find good datasets that could be usable for this purpose.

Is there a dataset of customers and some products they have bought that I can use for this purpose? Or any other dataset that might look suitable!

$\endgroup$
1
  • 2
    $\begingroup$ This doesn't appear to be asking for a specific dataset, so this isn't the kind of question that belongs on Open Data. Instead it is asking for examples of data sets that can be used to demonstrate clustering for a non-technical audience - that should be on-topic here. $\endgroup$ – Silverfish Jun 29 '16 at 20:26
1
$\begingroup$

The data below encodes an acquaintance network. The challenge is to divide it into three groups of similar sizes (not necessarily identical) aiming to maximise familiarity among groups. The idea is that it is very hard to do it from just being presented with a list of edges such as below; it becomes easier when visualising it, especially with a force directed layout. This can be tied to a much larger network, for which visualisation becomes less helpful again. The list of edges is also intended to impress on the audience that that is what computer algorithms deal with; the input is raw unstructured data. Especially with clustering, it can be deceptive to explain the difficulty, as any visualisation of cluster structure suggests the problem is easy. So my approach is to use visualisation as an aid, but stress that such perception is not available to algorithms in the first place and that it does not generally scale in the second place. This data is basically a toy example I have used in many places to explain mcl clustering (e.g. Figure 2 page 9 of http://micans.org/mcl/lit/INS-R0010.ps.Z). The best grouping is (using the first letter of each name) {a, b, f, g, j}, {b, c, e}, {d, h, i, k, l}, leading to only four 'cut' acquaintance pairs. Data:

ann bob
ann fred
ann gillian
ann john
bob ann
bob charlie
bob esme
charlie bob
charlie daniel
charlie esme
daniel  charlie
daniel  harriet
daniel  indy
daniel  kim
esme    bob
esme    charlie
esme    gillian
esme    harriet
fred    ann
fred    john
gillian ann
gillian esme
gillian john
harriet daniel
harriet esme
harriet indy
harriet kim
indy    daniel
indy    harriet
indy    kim
indy    lucy
john    ann
john    fred
john    gillian
kim daniel
kim harriet
kim indy
kim lucy
lucy    indy
lucy    kim
$\endgroup$
1
$\begingroup$

Scroll down to the single sets section of this page -- there are several there that might fit what you're looking for.

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.