Scribd Logo
Upload

Welcome to Scribd!

  • Lecture 9

    Uploaded by

    Devleena Banerjee
    6 views6 pages
    This document discusses two clustering techniques: K-means clustering, which partitions observations into K number of clusters where each observation belongs to the cluster with the nearest mean, and hierarchical clustering, which creates a hierarchy of clusters based on distance between observations where merging and splitting of clusters occurs sequentially.

    Original Description:

    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
    This document discusses two clustering techniques: K-means clustering, which partitions observations into K number of clusters where each observation belongs to the cluster with the nearest mean, and hierarchical clustering, which creates a hierarchy of clusters based on distance between observations where merging and splitting of clusters occurs sequentially.

    Copyright:

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

    Lecture 9

    Uploaded by

    Devleena Banerjee
    This document discusses two clustering techniques: K-means clustering, which partitions observations into K number of clusters where each observation belongs to the cluster with the nearest mean, and hierarchical clustering, which creates a hierarchy of clusters based on distance between observations where merging and splitting of clusters occurs sequentially.

    Copyright:

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

    K-means Clustering

    Lecture 10 Page 1
    Lecture 10 Page 2
    Hierarchical Clustering

    Lecture 10 Page 3
    Lecture 10 Page 4
    Lecture 10 Page 5
    Lecture 10 Page 6

    You might also like