Lecture
K-means Algorithm: Demo
Related lectures (32)
Statistical Physics of Clusters
Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.
Clustering: k-means
Explains k-means clustering, assigning data points to clusters based on proximity and minimizing squared distances within clusters.
Supervised Learning Overview
Covers CNNs, RNNs, SVMs, and supervised learning methods, emphasizing the importance of tuning regularization and making informed decisions in machine learning.
Unsupervised Learning: Clustering Methods
Covers unsupervised learning focusing on clustering methods and the challenges faced in clustering algorithms like K-means and DBSCAN.
Predicting Rainfall: Miniproject BIO-322
Introduces a miniproject where students predict rainfall in Pully using machine learning, focusing on reproducibility and code quality.
Expectation Maximization and Clustering
Covers the Expectation Maximization algorithm and clustering techniques, focusing on Gibbs Sampling and detailed balance.
Clustering Methods
Covers K-means, hierarchical, and DBSCAN clustering methods with practical examples.
Graph Coloring: Random vs Symmetrical
Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.
Graph Coloring II
Explores advanced graph coloring concepts, including planted coloring, rigidity threshold, and frozen variables in BP fixed points.
Clustering: Theory and Practice
Covers the theory and practice of clustering algorithms, including PCA, K-means, Fisher LDA, spectral clustering, and dimensionality reduction.