You need to read the paper titled “Speeding Up k-Means Algorithm by GPUs” by You Li et. al. Answer the following questions:

1. The algorithm presented in the paper computes Euclidean distance between every pair of points.

We want to compute cosine similarity between every pair of points. Write pseudo-code for versions of each of the two algorithms, UV K-Means and Matrix-multiplication based K-Means,showing how you would modify them to perform K-Means with cosine similarity instead of with the Euclidean distance.

2. For each of your suggested pseudo-code, outline a possible alternative to computing cosine similarity and give reasonsfor preferring your implementation given in (1) above,instead of this second alternative.

Speeding Up k-Means Algorithm by GPUs - Algorithm

Validation error occured. Please enter the fields and submit it again.

Thank You ! Your email has been delivered.