Q3. Given the two-dimensional points in Table 13.2, assume that k = 2, and that

Question

Q3. Given the two-dimensional points in Table 13.2, assume that k = 2, and that initially the points are assigned to clusters as follows: C1 = {x1,x2 x4} and C2 = {x3 x 5}. Answer the following questions: (a) Apply the K-means algorithm until convergence, that is, the clusters do not change, assuming (1) the usual Euclidean distance or the L2-norm as the distance between points, defined as and (2) the Manhattan distance or the Li-norm defined as (b) Apply the EM algorithm with k = 2 assuming that the dimensions are independent. Show one complete execution of the expectation and the maximization steps. Start with the assumption that P(Ci|Xja) = 0.5 for a = 1,2 and j = 1 ,..., 5.

Explanation / Answer

Standard algorithm

The most common algorithm uses an iterative refinement technique. Due to its ubiquity it is often called the k-means algorithm; it is also referred to as Lloyd's algorithm, particularly in the computer science community.

Given an initial set of k means m1(1),

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.