Scribd Logo
Upload

Welcome to Scribd!

  • K-Means Algorithm: A A A B B B C C

    Uploaded by

    Riff Chan
    5 views1 page
    The document describes applying the K-Means clustering algorithm to group 8 data points into 3 clusters based on their (x,y) coordinates. The initial cluster centers are (2,10), (5,8), and (1,2). After the first round, the cluster centers are updated to (3.33, 7.5), (6, 4.67), and (2.5, 5.5). The final clusters are: {A1, A2} centered at (3.33, 7.5); {B1, B2, B3} centered at (6, 4.67); and {C1, C2} centered at (2.5, 5.5

    Original Description:

    hi

    Original Title

    k-means

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes applying the K-Means clustering algorithm to group 8 data points into 3 clusters based on their (x,y) coordinates. The initial cluster centers are (2,10), (5,8), and (1,2). After the first round, the cluster centers are updated to (3.33, 7.5), (6, 4.67), and (2.5, 5.5). The final clusters are: {A1, A2} centered at (3.33, 7.5); {B1, B2, B3} centered at (6, 4.67); and {C1, C2} centered at (2.5, 5.5

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views1 page

    K-Means Algorithm: A A A B B B C C

    Uploaded by

    Riff Chan
    The document describes applying the K-Means clustering algorithm to group 8 data points into 3 clusters based on their (x,y) coordinates. The initial cluster centers are (2,10), (5,8), and (1,2). After the first round, the cluster centers are updated to (3.33, 7.5), (6, 4.67), and (2.5, 5.5). The final clusters are: {A1, A2} centered at (3.33, 7.5); {B1, B2, B3} centered at (6, 4.67); and {C1, C2} centered at (2.5, 5.5

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    K-Means Algorithm

    Suppose that the data mining task is to cluster points (with (x, y) representing location) into three
    clusters, where the points are

    A1 (2,10), A2 (2,5), A3 (8,4), B1 (5,8), B2 (7,5), B3 (6,4), C1 (1,2), C2 (4,9)

    The distance function is Euclidean distance. Suppose initially we assign as the center
    of each cluster, respectively. Use the -means algorithm to show only

    a) The three cluster centers after the first round of execution. (6 marks)

    b) The final three clusters. (3 marks)

    (Data Management, Final Exam, 2012)

    You might also like