Anonymous

### Question Description

Suppose we have a 1-dimensional data set with 7 data points, {0,1,3,25,31,44,56}. Answer the following question. You can use a calculator. There is a web-based one made by Google. Just Google “calculator”.

1. Consider using a bottom-up agglomerative hierarchical clustering method on this data set. What will be the top two clusters (K=2) if we use the single linkage function? How about the top three clusters (K=3)? Hint: you may merge the clusters manually from bottom up. The last 2 or last 3 clusters that remain will be the answer. Hint #2: you may define a 7x7 distance matrix on your answer sheet as a starting point. Then you would need a 6x6 distance matrix as you merge clusters. Then a 5x5 matrix, a 4x4 matrix, ...
2. Consider using a K-means clustering algorithm on this data set with K=2. What will be the resulting 2 clusters after one iteration if the initial values for the cluster centroids are 0 and 50? What will be the updated cluster centroids after one iteration? What will be resulting clusters and the cluster centroids after two iterations?

Student has agreed that all tutoring, explanations, and answers provided by the tutor will be used to help in the learning process and in accordance with Studypool's honor code & terms of service.
Tags: NYU

This question has not been answered.

Create a free account to get help with this and any other question!

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors