info@avatto.com
+91-9920808017
96. Which of the following clustering algorithms suffers from the problem of convergence at local optima? 1. K-Means clustering algorithm. 2. Agglomerative clustering algorithm. 3. Expectation-Maximization clustering algorithm 4. Diverse clustering algorithm.
1 and 3
1 and 4
2 and 3
2 and 4
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
97. In the figure below, if you draw a horizontal line on y-axis for y=2. What will be the number of clusters formed?
1
2
3
4
98. Assume, you want to cluster 7 observations into 3 clusters using K-Means clustering algorithm. After first iteration the clusters: C1,C2,C3 has the following observartions: C1: {(1,1), (4,4), (7,7)} C2: {(0,4), (4,0)} C3: {(5,5), (9,9)} What will be the cluster centroids if you want to proceed for second iteration?
C1: (4,4), c2:(2,2), C3:(7,7)
C1: (2,2), c2:(0,0), C3:(5,5)
C1: (6,6), c2:(4,4), C3:(9,9)
None of these
99. Assume, you want to cluster 7 observations into 3 clusters using K-Means clustering algorithm. After first iteration the clusters: C1,C2,C3 has the following observartions: C1: {(1,1), (4,4), (7,7)} C2: {(0,4), (4,0)} C3: {(5,5), (9,9)} What will be the Manhattan distance for observation (9,9) from cluster centroid C1 in the second iteration?
10
5
6
7
100. If two variables V1 and V2 are used for clustering. Which of the following are true for K-means clustering with k = 3? 1. If V1 and V2 has a correlation of 1, the cluster centroids will be in a straight line 2. If V1 and V2 ha a correlation of 0, the cluster centroids will be in straight line Choose the correct answer?
1 only
2 only
Both 1 and 2
None of the above
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login