Scribd Logo
Upload

Welcome to Scribd!

  • EXPERIMENT 8 by Rohan Nayak Cse 20078

    Uploaded by

    january
    8 views5 pages
    This document describes an experiment to cluster a set of points into 3 clusters (K=3) using the K-means clustering algorithm. It will randomly initialize the cluster means as existing data points, run the algorithm for 10 iterations to update the cluster means, and then print the final cluster means. It will also use the ground truth cluster labels to calculate and print the Jaccard distance between the obtained clusters and true clusters to evaluate the clustering results.

    Original Description:

    Original Title

    EXPERIMENT 8 by rohan nayak cse 20078

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes an experiment to cluster a set of points into 3 clusters (K=3) using the K-means clustering algorithm. It will randomly initialize the cluster means as existing data points, run the algorithm for 10 iterations to update the cluster means, and then print the final cluster means. It will also use the ground truth cluster labels to calculate and print the Jaccard distance between the obtained clusters and true clusters to evaluate the clustering results.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views5 pages

    EXPERIMENT 8 by Rohan Nayak Cse 20078

    Uploaded by

    january
    This document describes an experiment to cluster a set of points into 3 clusters (K=3) using the K-means clustering algorithm. It will randomly initialize the cluster means as existing data points, run the algorithm for 10 iterations to update the cluster means, and then print the final cluster means. It will also use the ground truth cluster labels to calculate and print the Jaccard distance between the obtained clusters and true clusters to evaluate the clustering results.

    Copyright:

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

    EXPERIMENT-

    AIM :-
    Q.Write a program to cluster a set of points using K-means. Consider, K-3, clusters. Consider
    Euclidean distance as the distance measure. Randomly initialize a cluster mean as one of the data
    points. Iterate for 10 iterations. After iterations are over, print the final cluster means for each of the
    clusters. Use the ground truth cluster label present in the data set to compute and print the
    Jacquard distance of the obtained clusters with the ground truth clusters for each of the three
    clusters.
    PCA
    Aryan kumar

    CSE20127

    20010120

    You might also like