0% found this document useful (0 votes)
13 views23 pages

Unsupervised Learning

K-Means is a clustering algorithm that partitions data into K clusters based on feature similarity, requiring the number of clusters to be predetermined. Hierarchical clustering creates a tree-like structure of clusters, allowing for flexible cluster selection and visual representation through dendrograms. Both methods are utilized in fields like market segmentation and image processing to analyze unlabelled data.

Uploaded by

SRI RAM
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views23 pages

Unsupervised Learning

K-Means is a clustering algorithm that partitions data into K clusters based on feature similarity, requiring the number of clusters to be predetermined. Hierarchical clustering creates a tree-like structure of clusters, allowing for flexible cluster selection and visual representation through dendrograms. Both methods are utilized in fields like market segmentation and image processing to analyze unlabelled data.

Uploaded by

SRI RAM
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

K-Means Overview

Clustering K-Means is a popular clustering


algorithm that partitions data into K
Algorithms: K- distinct clusters based on feature
similarity, minimizing the variance within
Means and each cluster. It is efficient for large
datasets but requires the number of
 Hierarchical Clustering
Hierarchical clusters to be specified
Explained
in advance.

Clustering Hierarchical clustering builds a tree-like


structure of clusters by either merging
smaller clusters (agglomerative) or splitting
larger ones (divisive). This method provides
a visual representation of data relationships
Applications
through dendrograms, allowing for flexible
and Use Cases
cluster selection.
Both K-Means and hierarchical clustering are
widely used in various fields such as market
segmentation, social network analysis, and
image processing, enabling organizations to
uncover patterns and insights from unlabelled
data effectively.

You might also like