Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 35 views

    Partitioning Around Medoid: K-Medoids

    Uploaded by

    preetam
    The K-Medoids algorithm clusters data by finding representative points (medoids) from within the data. It initializes k random data points as medoids. It then iteratively calculates the cost of swapping each non-medoid point with a medoid, and only keeps the swap if it decreases cost. This process repeats until cost stops decreasing, leaving k optimized medoids representing the clusters.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Partitioning Around Medoid: K-Medoids

    Uploaded by

    preetam
    35 views5 pages
    The K-Medoids algorithm clusters data by finding representative points (medoids) from within the data. It initializes k random data points as medoids. It then iteratively calculates the cost of swapping each non-medoid point with a medoid, and only keeps the swap if it decreases cost. This process repeats until cost stops decreasing, leaving k optimized medoids representing the clusters.

    Original Title

    K-medoid

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The K-Medoids algorithm clusters data by finding representative points (medoids) from within the data. It initializes k random data points as medoids. It then iteratively calculates the cost of swapping each non-medoid point with a medoid, and only keeps the swap if it decreases cost. This process repeats until cost stops decreasing, leaving k optimized medoids representing the clusters.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    35 views5 pages

    Partitioning Around Medoid: K-Medoids

    Uploaded by

    preetam
    The K-Medoids algorithm clusters data by finding representative points (medoids) from within the data. It initializes k random data points as medoids. It then iteratively calculates the cost of swapping each non-medoid point with a medoid, and only keeps the swap if it decreases cost. This process repeats until cost stops decreasing, leaving k optimized medoids representing the clusters.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 5

    K-Medoids (also called as Partitioning Around Medoid) algorithm was proposed in

    1987 by Kaufman and Rousseeuw. A medoid can be defined as the point in the cluster, whose
    dissimilarities with all the other points in the cluster is minimum.
    The dissimilarity of the medoid (Ci) and object (Pi) is calculated by using E = |Pi - Ci|
    The cost in K-Medoids algorithm is given as

    1. Initialize: select k random points out of the n data points as the medoids.


    2. Associate each data point to the closest medoid by using any common distance metric methods.
    3. While the cost decreases:
            For each medoid m, for each data o point which is not a medoid:
                    1. Swap m and o, associate each data point to the closest medoid, recomputed the cost.
                    2. If the total cost is more than that in the previous step, undo the swap.
    Step 1:
    Let the randomly selected 2 medoids, so select k = 2 and let C1: (4, 5) and C2: (8, 5) are
    the two medoids.
    Step 2: Calculating cost.
    The dissimilarity of each non-medoid point with the medoids is calculated and tabulated:

    K=2 C1: (4, 5) and C2: (8, 5) 

    C1: (4, 5) and C2: (8, 4) 

    C1:03
    C2:05

    Each point is assigned to the cluster of that medoid whose dissimilarity is less.

    The points 1, 2, 5 go to cluster C1 and 0, 3, 6, 7, 8 go to cluster C2.


    The Cost = (3 + 4 + 4) + (3 + 1 + 1 + 2 + 2) = 20

    Step 3: randomly select one non-medoid point and recalculate the cost.
    Let the randomly selected point be (8, 4). The dissimilarity of each non-medoid point with
    the medoids – C1 (4, 5) and C2 (8, 4) is calculated and tabulated.
    C1: (4, 5) and C2: (8, 4) 

    Each point is assigned to that cluster whose dissimilarity is less. So, the points 1, 2, 5 go to
    cluster C1 and 0, 3, 6, 7, 8 go to cluster C2.
    The New cost = (3 + 4 + 4) + (2 + 2 + 1 + 3 + 3) = 22
    Swap Cost = New Cost – Previous Cost = 22 – 20 and 2 >0
    As the swap cost is not less than zero, we undo the swap so C1: (4, 5) and C2 :( 8, 5) will
    remain final medoids
    Advantages:
    1. It is simple to understand and easy to implement.
    2. K-Medoid Algorithm is fast and converges in a fixed number of steps.
    3. PAM is less sensitive to outliers than other partitioning algorithms.

    Disadvantages:
    1. The main disadvantage of K-Medoid algorithms is that it is not suitable for clustering
    non-spherical (arbitrary shaped) groups of objects. This is because it relies on
    minimizing the distances between the non-medoid objects and the medoid (the cluster
    centre) – briefly, it uses compactness as clustering criteria instead of connectivity.
    2. It may obtain different results for different runs on the same dataset because the first
    k medoids are chosen randomly.

    You might also like