Suppose that we apply the k-means algorithm on the dataset (<-2,-2p,42, 2P, (2., -2P, <2, 2P), with K2 and initial seeds at (-1, 0) and (1, 0), and with Euclidean distance. What are the two centroids and two dusters after the 1 teration of the k-means algorithm and how do you get them (6 points)? What are the two centroids and two clusters after the 2 teration of the k-means algorithm and how do you get them (6pts)? (Note: no credit without showing how you get the answes.

Suppose that we apply the k-means algorithm on the dataset (<-2,-2p,42, 2P, (2., -2P, <2, 2P), with K2 and initial seeds at (-1, 0) and (1, 0), and with Euclidean distance. What are the two centroids and two dusters after the 1 teration of the k-means algorithm and how do you get them (6 points)? What are the two centroids and two clusters after the 2 teration of the k-means algorithm and how do you get them (6pts)? (Note: no credit without showing how you get the answes.

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

What is the time complexity of using beam search to generate a sequence of length T, if we use a beam width of K? Treat the vocabulary size and run time for each forward pass of our model as constants. Beam width refers to the number of candidate sequences we maintain. O(K²T) OO(KT) OO(TK) OO(KT)
Write a program in Scilab that samples f (x )=3e^−x sinx at x=0,1,2,3,4,5 and then, on the same graph, plots nearest-neighbor, linear and spline interpolations of these data using the interp1 function. The interpolation plots should have 200 samples uniformly spaced over 0≤x≤5 .
Classify the 1’s, 2’s, 3’s for the zip code data in R. (a) Use the k-nearest neighbor classiﬁcation with k = 1, 3, 5, 7, 15. Report both the training and test errors for each choice. (b) Implement the LDA method and report its training and testing errors. Note: Before carrying out the LDA analysis, consider deleting variable 16 ﬁrst from the data, since it takes constant values and may cause the singularity of the covariance matrix. In general, a constant variable does not have a discriminating power to separate two classes.
Simplify the following k-map and compare it to boolean simplification. Answer both item.
Let T:R3 ->R3 be a linear transformation and suppose that T((1,0,-1))=(1,-1,3) and T((2,-1,0))=(0,2,1). Write the pseudocode to find out if T((a,b,c,d)) where (a,b,c) E R3 is arbitrary can be found from the given data and if the value is unique? Justify your computations first before writing pseudo code.
For the sample space S = {c,d,e,f,g,k,l}, identify the complement of A = {d,f,k,}.
A sample space of five elements E1, E2, E3, E4 and E5. Find P(E4) and P(E5) if: P(E1)=P(E2)=0.15, P(E3)=0.4 and P(E4)=2P(E5)
Consider this visualization of disjoint sets:a. What does find (20) return? b. What does find (18) return? c. In your own words, explain the differences between union by size and union by height in disjoint set implementations. Use the above illustration if it would help you answer this question better d. Now Suppose we call Find(12) and we are using path compression. Which links change, and what do they change to once compression is complete?
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.
Backtrack Search Algorithm Using Shortened Base ImagesInput: a group G with a basis B=[131,132...... 13k] and a strong generating set S; a decidable property P, the members of which form a subgroup;Output: a strong generating set relative to B for the subgroup K = H (P) ; procedure search(G: group; P: property; s: 1..k+l; 1: 1..k+l; varK: group); (* Search G (s) for elements fulfilling P in the subgroup K.The components of G (0 are known to fulfil P. *)
Q4// Simplify and then implement the Boolean function F(A,B,C,D) = N (1,2,3,5,6,7,9,11,13,15) using POS karnough map , draw the implementation. %3D
Machine Learning and Stats) Show the first two iterations (after the initialization) of the k-means clustering algorithm (show centers and assignments of data points to clusters) for the following 2D data set: (4, 2), (0, 1), (1, 4), (2, 8), (3, 5), (8, 8), (3, 3), (10, 10), (20, 18), and (12, 9). Assume the number of centers is equal to 2 and the centers are initialized to (1, 1) and (7, 8).