00:01
So in this question, we want to cluster the four items.
00:04
First, consider the single linkage hierarchical procedure.
00:10
And that is the one that we consider that we should put two values together as the one that had the minimum distance.
00:21
Okay, so that means that we should use the minimum between two points as like the measure of distance.
00:29
So in this case, considering the first matrix of distances, the points that are closer together are the number 2 and 3.
00:41
So they should be cluster first into one group.
00:46
And then what we do is we compute the distances using the single linkage procedures to cluster the other values, like to know the order that we should consider.
00:58
So in this case, here, for the ones, if it is the same, the distance is zero, or what we want to find is this tree, considering the single linkage that is the minimum between the distance.
01:17
So for example, here we have two values, but we are going to find that this distance here will be the same as the minimum of the distance between 1 and 3, and using the original table of distances, that would be the same as nine.
01:41
And the one with two, we have the number three, so the minimum is three.
01:50
Then we do the same thing for the case with four.
01:55
So with four, we need to know what is the distance between four and three and four and two and take the minimum.
02:01
So in this case, that will be, the same as the minimum between 5 and 7, but 8 and 5, and that is 5.
02:15
And between 4 and 1, because they are still not closer together, we get the distance from the original table, and that is 7.
02:23
So now we always put the one that is the small, in this case the one with the smallest distance, so we should close the first 3 and 2.
02:34
3, 2 with 1.
02:35
So we create this order, and the distance using the same idea will be, in this case, the minimum, not this one, this is zero, the minimum between 5 and 7, and that is 5.
02:57
And this will be 0, oh, sorry, no, 0, the same number, because the same metric, and this is 0.
03:02
So now we then, we close the 5 with 4.
03:06
The four is the last one to close with the other vendors.
03:10
Then for b, we use the complete.
03:12
The complete use the maximum instead of the minimum to create the distances.
03:17
So for the first one here, we are going to still close the three and two because they are the closest.
03:26
But then when we are computing the distances now, if you're considering three, two, one, and four, what we're going to do is use the maximum of the distances.
03:35
So here is zero.
03:36
Then we have the maximum of the distance 9 and 3, and this is 9.
03:42
Then we have the maximum of 8 and 5, and this is 8, and this one stays as 7...