Two points from the line of best fit can be used to find the slope of the line, which can be used to find the equation of the li
2 answers:
You might be interested in
Answer:
1) With initial centroids 10-40, final clusters are
first cluster (6,12,18,24,30)
second cluster (42,48)
And the Sum of Squared Errors (SSE) for the clustering result is 378
2) With initial centroids 10-20, final clusters are
first cluster (6,12,18,24)
second cluster (30,42,48)
And the Sum of Squared Errors (SSE) for the clustering result is 348
Step-by-step explanation:
K-means works as follows
- the points will be clustered according to their distance to the centroids.
- Then centroids are updated as the cluster means.
- This process continues until clusters doesn't change anymore
1) <u><em>initial centroids</em></u> 10-40
first cluster (6,12,18,24) mean:15
second cluster (30,42,48) mean:40
<u><em>new centroids</em></u> 15-40
first cluster (6,12,18,24,30) mean:18
second cluster (42,48) mean:45
<u><em>final centroids</em></u> 18-45
first cluster (6,12,18,24,30) mean:18
second cluster (42,48) mean:45
Sum of Squared errors = +
+
+
+
+
+
=378
2)<u><em>initial centroids</em></u> 10-20
first cluster (6,12) mean:9
second cluster (18,24,30,42,48) mean:32.4
<u><em>new centroids</em></u> 9-32.4
first cluster (6,12,18) mean:12
second cluster (24,30,42,48) mean:36
<u><em>new centroids</em></u> 12-36
first cluster (6,12,18,24) mean:15
second cluster (30,42,48) mean:40
<u><em>final centroids</em></u> 15-40
first cluster (6,12,18,24) mean:15
second cluster (30,42,48) mean:40
Sum of Squared errors = +
+
+
+
+
+
=348
A thumb-wrestling match requires two thumbs, so we can either suppose that we need at least two people 
, or allow one to thumb-wrestle one's self. In either case, we'd have 
, so let's just say we need a minimum of two players.
If we add one more person to the set of players, then the first two people would need to play 1 additional match each. So
.
If we add one more person, then the first three people would again each have to play 1 more match with the new person. So
.
And so on, so that in general, the number of games needed for everyone to play exactly one match with everyone else is given recursively by
If we add one more person to the set of players, then the first two people would need to play 1 additional match each. So
If we add one more person, then the first three people would again each have to play 1 more match with the new person. So
And so on, so that in general, the number of games needed for everyone to play exactly one match with everyone else is given recursively by