Unsupervised Learning: Harsha Vardhan Reddy Burri
Unsupervised Learning: Harsha Vardhan Reddy Burri
• Hierarchial clustering
• Principle Component Analysis
K‐means Clustering
• Unsupervised learning algoritm
• Unleabelled data or no target label
• Goal is to find patterns and making clusters
Stpes in K‐means:
• 1: Pick random points as cluster centers (also called as
centroids). cluster centroids – c1, c2, c3….ck
• 2: Assign each data point to nearest cluster by calculating
its distance to each centroid
• 3. find new cluster center by taking the averages of
assigned points
• 4. Repeat step 2 and 3 untill none of the cluster
assignments change
Dataset= [2,3,4,10,11,12,20,25,30] #monthly expenditure (in 1000) of customers
10,11,12,20,25,30
2,3,4
Mean =3
Mean =18
11,12,20,25,30
2,3,4,10
Mean =5
Mean =20
12,20,25,30
2,3,4,10,11
Mean =6
Mean =22
2,3,4,10,11,12 20,25,30
Mean =7
Mean =25
Applications:
1. Image segmentation
2. Clustering genome data – gene segments
3. Data mining segmentation
4. Anomly detection
5. Instance classification
6. Customer classification