1. Let , , and be four items for clustering. Consider the following three partitions:
A.
B.
C. .
Determine the partition favored by the sum-of-square-error (SSE) clustering criterion.
2. Consider the following eight records; each record is described by two quantitative attributes:
A = (2, 10)t, B = (2, 5)t, C = (8, 4)t, D = (5, 8)t, E = (7, 5)t, F = (6, 4)t G = (1, 2)t, H = (4, 9)t.
Your task is to apply complete link clustering to this data and produce the dendrogram. This exercise must be done without using any clustering software.
P
P
1
1
4
2
2
3
=
=
{
,
},
{
,
}
x
x
x
x
P
P
1
1
2
3
2
4
=
=
{
,
,
},
{
}
x
x
x
x
x
1
4
5
=
(
)
t
x
2
1
4
=
(
)
t
x
3
0
1
=
(
)
t
x
4
5
0
=
(
)
t
P
P
1
1
2
2
3
4
=
=
{
,
},
{
,
}
x
x
x
x
