Use the k-means algorithm and Euclidean distance to cluster the following eight examples into three clusters:...

Use the k-means algorithm and Euclidean distance to cluster the following eight examples into three
clusters:
A1 = (26, 18), A2 = (20, 26), A3(14, 20), A4(24, 20), A5(14, 30), A6(22, 18), A7(8, 18), A8(12, 14)
a. Suppose that the initial seeds (centres of each cluster) are A2, A3, and A8. Run the k-means
algorithm for one epoch only. At the end of this epoch,
o show the new clusters (i.e., the examples belonging to each cluster);
o show the centres of the new clusters;
o draw a graph space with all eight points, and show the clusters after the first epoch and
the new centroids.
b. Complete the process for other iterations. How many more iterations are needed for the
algorithm to converge? Draw the final result of the remaining epochs.
Note: if an object is at the same minimum distance from two clusters, consider it as belonging to
both.

Solutions

Expert Solution

orchestra answered 1 year ago

Next > < Previous

Related Solutions

Use the data below and find the clusters using a single link technique. Use Euclidean distance...

Use the data below and find the clusters using a single link technique. Use Euclidean distance and draw the dendrogram. X Y P1 0.35 0.48 P2 0.17 0.33 P3 0.3 0.28 P4 0.21 0.18 P5 0.08 0.29

One way to cluster objects is called k-means clustering. The goal is to find k different...

One way to cluster objects is called k-means clustering. The goal is to find k different clusters, each represented by a "prototype", defined as the centroid of cluster. The centroid is computed as follows: the jth value in the centroid is the mean (average) of the jth values of all the members of the cluster. Our goal is for every member a cluster to be closer to that cluster's prototype than to any of the other prototypes. Thus a prototype...

Use the Euclidean algorithm to find the GCD of 3 + 9i and 7-i

COMPLETE A LOGISTIC REGRESSION, AS WELL AS A K-MEANS CLUSTER ANALYSIS IN EXCEL? Using the data...

COMPLETE A LOGISTIC REGRESSION, AS WELL AS A K-MEANS CLUSTER ANALYSIS IN EXCEL? Using the data to find four clusters of cities. Write a short report about the clusters you find. Does the clustering make sense? Can you provide descriptive, meaningful names for the clusters? SHOW GRAPHS PLEASE (Scatter plot/cluster) Metropolitan_Area Cost_Living Transportation Jobs Education Abilene, TX 96.32 36.54 17.28 49.29 Akron, OH 47.31 69.68 86.11 71.95 Albany, GA 86.12 28.02 32.01 26.62 Albany-Schenectady-Troy, NY 25.22 82.71 52.97 99.43 Albuquerque,...

use euclidean algorithm to find integers m,n such that 1693m+2019n=1

4. (a) Use the Euclidean algorithm to find the greatest common divisor of 21 and 13,...

4. (a) Use the Euclidean algorithm to find the greatest common divisor of 21 and 13, and the greatest common divisor of 34 and 21. (b) It turns out that 21 and 13 is the smallest pair of numbers for which the Euclidean algorithm requires 6 steps (for every other pair a and b requiring 6 or more steps a > 21 and b > 13). Given this, what can you say about 34 and 21? (c) Can you guess...

Using the ruspini dataset provided with the cluster package in R, perform a k-means analysis. Document...

Using the ruspini dataset provided with the cluster package in R, perform a k-means analysis. Document the findings and justify the choice of K. Hint: use data(ruspini) to load the dataset into the R workspace.

find a linear combination for gcd(259,313). use extended euclidean algorithm. what is inverse of 259 in...

find a linear combination for gcd(259,313). use extended euclidean algorithm. what is inverse of 259 in z subscript 313? what is inverse of 313 in z subscript 259?

All necessary steps much show for these problems, please. Use the Euclidean algorithm to find gcd(12345,...

All necessary steps much show for these problems, please. Use the Euclidean algorithm to find gcd(12345, 54321). Write gcd(2420, 70) as a linear combination of 2420 and 70. The work to obtain the gcd is provided. 2420 = 34(70) + 40 70 = 1(40) + 30 40 = 1(30) + 10 30 = 3(10) + 0 Determine if 1177 is prime or not. If it is not, then write 1177 as a product of primes Find gcd(8370, 465) by unique...

In MATLAB, Implement a hybrid clustering algorithm which combines hierarchical clustering and k-means clustering.

Subjects