Consider k-means with Euclidean distance function.{(-6, –2), (-5, 2), (-4, –2)} U {(4, 2), (5, –2), (6, 2)}1. Given the two-dimensional dataset S =and k = 2 give the optimal cluster centers that minimize the SSE. Next, choose initializationvalues for the two cluster centers such that k-means never converges to the optimal clustering.2. Proof that there always exists an initialization for which k-means converges to the global op-timum. Use the fact that an iteration of k-means can never increase the SSE (sum of squarederrors, i.e. distances between the cluster center and associated elements).

Answer: I have given answer in handwritten format.

Consider k-means with Euclidean distance function. = {(-6,-2), (-5,2), (-4, –2)} U {(4,2), (5, –2), (6, 2)} and k = 2 give the optimal cluster centers that minimize the SSE. Next, choose initialization values for the two cluster centers such that k-means never converges to the optimal clustering. 1. Given the two-dimensional dataset S =

Consider k-means with Euclidean distance function. = {(-6,-2), (-5,2), (-4, –2)} U {(4,2), (5, –2), (6, 2)} and k = 2 give the optimal cluster centers that minimize the SSE. Next, choose initialization values for the two cluster centers such that k-means never converges to the optimal clustering. 1. Given the two-dimensional dataset S =

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Apply the Fuzzy C Mean Clustering on the given data points. Consider the number of clusters is 2. Determine the number of data points in each cluster separately whose membership value is greater than 0.5. Given Data points A(3, 3) B( 4, 3) C (2, 2 ) D( 4 ,2 ) E(3, 2)
Given an unlabeled dataset {x(1), ... , x(m)}. The K-mean algorithm has been run with 40 different random initializations, and 40 different clusterings of the data have been obtained. Describe how we should use Ex(1) – µ01² to choose the best m clustering.
Apply the k- means algorithm for the dataset A U B = {-5, -3, 2, 4} with initial cluster centers {2, 3}. Find the resulting clusters and cluster centers after the algorithm converges
We are going to use K-means algorithm to cluster 6 data points from dataset D = {0, 1, 2, 3, 4, 2022} in R1 into 2 clusters. Before the first iteration, the cluster centers are randomly initialized at c1 = 0.235 and c2 = 1.984. Next, we simulate the first iteration (for part (a) and (b)) of K-means with manual computation. (a) Compute the cluster assignment for each of the 6 data points given, using the Euclidean distance. [5 pts] (b) Compute the updated cluster center c1 and c2. [5 pts] (c) How many iterations are needed to finish the K-means algorithm for this problem? [10 pts]
Consider Self Organization Feature Map SOFM with two cluster units and five input Units. The weight vectors for the cluster units are:- W1 = (0.2, 0.6, 0.8, 0.2, 1.0) and W2 = (0.1, 0.2, 0.4, 0.7, 1.0) Use the square of the Euclidean distance to find the winning cluster unit for the input Pattern x = (0.1, 1.0, 0.5, 0.0, 0.0). Using a learning rate of 0.5, find the new weights for the winning unit.
Assume we have a 2D dataset consisting of (0, –6), (4, 4) , (0, 0) ,(-5, 2). We wish to do k-means and k-medoids clustering with k = 2. We initialize the cluster centers with (-5, 2) , (0, –6). For this small dataset, in choosing between two equally valid exemplars for a cluster in k-medoids, choose them with priority in the order given above (i.e. all other things being equal, you would choose (0, –6) as a center over (-5, 2)). Clustering 3 K-means algorithm with l1 norm Note: For K-means algorithm with l1 norm, you need to use median instead of mean when calculating the centroid. For details, you can check out this Wiki page. Cluster 1 Center: Cluster 1 Members: Cluster 2 Center: Cluster 2 Members:
Apply the k-means algorithm for the dataset A ∪ B = {−5, −3, 2, 4} with initial cluster centers {2, 3}. Find the resulting clusters and cluster centers after the algorithm converges
Suppose we cluster a set of N data points using two different using the k-means clusteringalgorithm runs but with different number of initial clusters centres.Run 1: 4 initial cluster centres - (a,b), (c,d), (e,f) and (g,h).Run 2: 2 initial cluster centres - (a,b), (c,d)Run 3: 3 initial cluster centres - ((a,b), (c,d), (e,f).Would the clusters created using Run 3 be similar to the 2 or 4 initial cluster runs? Explainyour answer briefly
Given a set of three points, -2, 0, and 9, we want to use k- Means Clustering with k = 2 to cluster them into two clusters. If the initial cluster centers are C1 = -4.0 and C2 = 2.0, What will be the center of C1 after completing first iteration of k means clustering algorithm? Answer:
Apply k-means to cluster 6 data points (1, 3), (2, 2), (2, 5), (3, 2), (4, 2), and (4, 3) to 2 clusters. Use the initial centroids (2, 2) and (2, 5). Show your work of computing the distances (Euclidean distance) and centroid updates in each iteration of k-means.
The procedure of evaluating the results of a clustering algorithm is known under the termcluster validity. In general terms, there are two approaches to investigate cluster validity Internal and External criteria. Both DB (Davies-Bouldin) and Silhouette Coefficient are internal criteria. Which one is NOT correct about these two criteria? Group of answer choices The minimum DB score is zero, with lower values indicating better clustering. DB is a measure of how similar an object is to its own cluster (cohesion) compared to other clusters (separation). The best value of Silhouette is 1 and the worst value is -1 No answer text provided.
3.. Based on Euclidean distance in R, we obtained following three clusters: A =(0,5,6),B =(3,9),C =(12). In the next iteration of the clustering, which two clusters will be merged by complete linkage and single linkage approaches, respectively ?