Scribd Logo
Upload

Welcome to Scribd!

  • Clustering For Segmentation-6

    Uploaded by

    acharyamalvika
    12 views4 pages
    The document discusses various clustering algorithms including k-means clustering. It provides details on the k-means clustering algorithm, which involves: 1) Fixing the number of clusters k, 2) Providing an initial set of k cluster seeds, 3) Assigning units to the nearest seed based on a threshold, 4) Computing new seeds, and 5) Repeating steps 3-4 until no reclassification is needed. Diagrams demonstrate how the initial clusters are formed and cluster centers are calculated.

    Original Description:

    Original Title

    5. Clustering for Segmentation-6

    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 discusses various clustering algorithms including k-means clustering. It provides details on the k-means clustering algorithm, which involves: 1) Fixing the number of clusters k, 2) Providing an initial set of k cluster seeds, 3) Assigning units to the nearest seed based on a threshold, 4) Computing new seeds, and 5) Repeating steps 3-4 until no reclassification is needed. Diagrams demonstrate how the initial clusters are formed and cluster centers are calculated.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views4 pages

    Clustering For Segmentation-6

    Uploaded by

    acharyamalvika
    The document discusses various clustering algorithms including k-means clustering. It provides details on the k-means clustering algorithm, which involves: 1) Fixing the number of clusters k, 2) Providing an initial set of k cluster seeds, 3) Assigning units to the nearest seed based on a threshold, 4) Computing new seeds, and 5) Repeating steps 3-4 until no reclassification is needed. Diagrams demonstrate how the initial clusters are formed and cluster centers are calculated.

    Copyright:

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

    CLUSTERING ALGORITHMS

    • k-means clustering algorithm


    • Fuzzy c-means clusteringalgorithm
    • Hierarchical clustering algorithm
    • Gaussian(EM) clustering algorithm
    • Quality Threshold (QT) clustering algorithm
    • MST based clusteringalgorithm
    • Density based clustering algorithm
    • kernel k-means clustering algorithm
    INSTITUTE OF MANAGEMENT TECHNOLOGY, HYDERABAD
    K-MEANS CLUSTERING ALGORITHM

    1. The number k of clusters isfixed


    2. An initial set ofk “seeds” (aggregation centres) is provided
    1.First k elements
    2.Other seeds (randomly selected or explicitly defined)
    3. Given a certain fixed threshold, all units are assigned to the
    nearest cluster seed
    4. New seeds are computed
    5. Go back to step 3 until no reclassification isnecessary

    INSTITUTE OF MANAGEMENT TECHNOLOGY, HYDERABAD


    K-MEANS CLUSTERING: STEP 1

    Overall population Fix number of K

    INSTITUTE OF MANAGEMENT TECHNOLOGY, HYDERABAD


    K-MEANS CLUSTERING: STEP 2

    Assign each case to nearest Calculate the cluster


    cluster centers

    INSTITUTE OF MANAGEMENT TECHNOLOGY, HYDERABAD

    You might also like