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

Welcome to Scribd!

  • 48 views

    Week 15 - Clustering

    Uploaded by

    Royer Rojano
    This document discusses clustering and k-means clustering. It begins with an overview of clustering and how it differs from classification by identifying similarities between objects rather than assigning them to predefined classes. It then focuses on k-means clustering, explaining that it is an unsupervised machine learning algorithm that groups objects into k clusters based on their characteristics. The document walks through the steps of how k-means clustering works, including randomly selecting initial clusters, assigning data points to the nearest cluster, recalculating cluster means, and repeating the process until cluster assignments no longer change. It also discusses how to determine the optimal number of clusters k.

    Copyright:

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

    Week 15 - Clustering

    Uploaded by

    Royer Rojano
    48 views25 pages
    This document discusses clustering and k-means clustering. It begins with an overview of clustering and how it differs from classification by identifying similarities between objects rather than assigning them to predefined classes. It then focuses on k-means clustering, explaining that it is an unsupervised machine learning algorithm that groups objects into k clusters based on their characteristics. The document walks through the steps of how k-means clustering works, including randomly selecting initial clusters, assigning data points to the nearest cluster, recalculating cluster means, and repeating the process until cluster assignments no longer change. It also discusses how to determine the optimal number of clusters k.

    Original Description:

    INFORME

    Original Title

    Week 15 - Clustering (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses clustering and k-means clustering. It begins with an overview of clustering and how it differs from classification by identifying similarities between objects rather than assigning them to predefined classes. It then focuses on k-means clustering, explaining that it is an unsupervised machine learning algorithm that groups objects into k clusters based on their characteristics. The document walks through the steps of how k-means clustering works, including randomly selecting initial clusters, assigning data points to the nearest cluster, recalculating cluster means, and repeating the process until cluster assignments no longer change. It also discusses how to determine the optimal number of clusters k.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    48 views25 pages

    Week 15 - Clustering

    Uploaded by

    Royer Rojano
    This document discusses clustering and k-means clustering. It begins with an overview of clustering and how it differs from classification by identifying similarities between objects rather than assigning them to predefined classes. It then focuses on k-means clustering, explaining that it is an unsupervised machine learning algorithm that groups objects into k clusters based on their characteristics. The document walks through the steps of how k-means clustering works, including randomly selecting initial clusters, assigning data points to the nearest cluster, recalculating cluster means, and repeating the process until cluster assignments no longer change. It also discusses how to determine the optimal number of clusters k.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 25

    Clustering

    Nallig Leal Narváez


    PhD en Ingeniería de Sistemas y
    Computación

    Universidad Autónoma del Caribe


    CONTENT

    Fundamentals

    • Learning
    • Classification and Clustering

    Clustering
    • K-Means Clustering
    Fundamentals – Learning

    Supervised Unsupervised
    Classification and Clustering
    Classification and clustering are two methods
    of pattern identification used in machine learning.
    Although both techniques have certain similarities,
    the difference lies in the fact that classification
    uses predefined classes in which objects are
    assigned, while clustering identifies similarities
    between objects, which it groups according to those
    characteristics in common and which differentiate
    them from other groups of objects. These groups are
    known as "clusters". [1]

    [1] https://blog.bismart.com/en/classification-vs.-clustering-a-practical-explanation
    K-Means Clustering – What is it?

    The K-Means algorithm is an unsupervised machine learning classification


    algorithm, which groups objects into K groups based on their characteristics

    Graphics were taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    Suppose you have data that you need to put in three clusters

    Graphics were taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    In this case the data make three, relatively obvious, clusters

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    Step 1

    Select the number K of clusters you want to identify in your data. For example K = 3

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    Step 2

    Randomly select 3 distinct data points. These are the initial clusters

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    Step 3

    Measure the distance between the 1st point and the three initial clusters

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    Step 4

    Assign the 1st point to the nearest cluster. In this case the nearest cluster is the blue
    one.

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    Step 4

    Then, do the same for the other points.

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?
    Calculate the mean of each cluster
    Step 5

    The repeat the process using the mean values. Since the clustering do not change in
    this iteration, the process ends.

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How it works?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How many clusters?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How many clusters?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How many clusters?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How many clusters?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How many clusters?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How many clusters?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How many clusters?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering – How many clusters?

    Taken from StatQuest of Josh Starmer


    K-Means Clustering in two dimensions

    Taken from StatQuest of Josh Starmer

    You might also like