Published Feb 14, 2022

k-means clustering

Join Kyle Polich as he demystifies k-means clustering by exploring the optimal selection of 'k,' delving into Gaussian distributions, and demonstrating with engaging analogies how this fundamental algorithm partitions data into clusters, while also addressing its practical applications and limitations.

Episode Highlights

Topics covered

Popular Clips

Episode Highlights

Related Episodes

[MINI] k-means clustering
Answers 383 questions
Explainable K-Means
Answers 383 questions
k-means Image Segmentation
Answers 383 questions
Customer Clustering
Answers 383 questions
K-Means in Practice
Answers 383 questions
Power K-Means
Answers 383 questions
Quantum K-Means
Answers 383 questions
Breathing K-Means
Answers 383 questions
Matrix Factorization For k-Means
Answers 383 questions
Fair Hierarchical Clustering
Answers 383 questions
[MINI] k-Nearest Neighbors
Answers 383 questions
Applying k-Nearest Neighbors to Time Series
Answers 383 questions
Graph Transformations
Answers 383 questions
Drug Discovery with Machine Learning
Answers 383 questions
Machine Learning Done Wrong
Answers 383 questions

Dexa/Kyle Polich

k-means clustering

Topics covered

Popular Clips

Gaussian Distributions Explained

K Means Clustering

Customer Data Strategy

Clustering Pitfalls

K Means Insights

K Means Clustering

Episode Highlights

Choosing Optimal K

Understanding Gaussian Distributions

K Means Algorithm

Related Episodes

[MINI] k-means clustering

Explainable K-Means

k-means Image Segmentation

Customer Clustering

K-Means in Practice

Power K-Means

Quantum K-Means

Breathing K-Means

Matrix Factorization For k-Means

Fair Hierarchical Clustering

[MINI] k-Nearest Neighbors

Applying k-Nearest Neighbors to Time Series

Graph Transformations

Drug Discovery with Machine Learning

Machine Learning Done Wrong

k-means clustering

Topics covered

Popular Clips

Episode Highlights

Choosing Optimal KThe episode explores techniques for optimizing k-means clustering, focusing on the elbow method and silhouette scores. Kyle Polich shares insights into these methods, highlighting their strengths and limitations.

Choosing Optimal K

Understanding Gaussian DistributionsKyle Polich uses creative analogies to explain Gaussian distributions and their role in k-means clustering. Through paintball exercises, he illustrates how data points cluster around centroids, revealing the algorithm's strengths and challenges.

Understanding Gaussian Distributions

K Means AlgorithmKyle Polich introduces k-means clustering, a method for partitioning data into clusters, highlighting its intuitive appeal and practical applications. This episode provides a foundational understanding of the algorithm's steps and potential pitfalls.

K Means Algorithm

Related Episodes