Hierarchical Clustering in Python Part 1 of 2 | Distance Measures | Euclidean | Linkage Algorithms

In this Playlist on Clustering we will discuss the two essential Clustering techniques along with Python & R Codes:
Hierarchical Clustering
K Means Clustering
Learning Objectives:
Why Clustering?
What is Clustering?
How do we find Similar Groups (Homogeneous Groups) in Data
Distance as a measure of Similarity / Dissimilarity
Types of Distance Measures
---- Euclidean
---- Manhattan
---- Minkowski
---- Jaccard
---- Chebyshev
Hierarchical Clustering Algorithm
---- Linkage Concepts
Partitioning Clustering (K Means Algorithm)
Why K Means is a Faster & Superior technique compared to Hierarchical
Why K Means is based on Variance and not Distance Measure
Finding the Optimum Number of Clusters
Scree Plot
Cluster Profiling
========================================================
Blog on Clustering: www.k2analytic....
Resource: www.k2analytic....
========================================================.
Facebook page: / ik2analytics
Instagram: / ik2analytics
Twitter: / ik2analytics
LinkedIn: / k2an .