Lecture

Clustering: Hierarchical and K-means Methods

Related lectures (32)

Explores clustering in high-dimensional space, covering methods like hierarchical clustering, K-means, and DBSCAN.

Covers the K-means algorithm for clustering data samples into k classes without labels, aiming to minimize the loss function.

Statistical Physics of Clusters

Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.

Unsupervised Learning: Clustering Methods

Covers unsupervised learning focusing on clustering methods and the challenges faced in clustering algorithms like K-means and DBSCAN.

Supervised Learning Overview

Covers CNNs, RNNs, SVMs, and supervised learning methods, emphasizing the importance of tuning regularization and making informed decisions in machine learning.

Clustering Algorithms: K-Means vs Spectral Clustering

Compares K-Means and Spectral Clustering algorithms, highlighting their differences and practical applications in clustering student behaviors.

Unsupervised Learning: Clustering

Explores unsupervised learning through clustering techniques, algorithms, applications, and challenges in various fields.

Clustering & Density Estimation

Covers dimensionality reduction, PCA, clustering techniques, and density estimation methods.

Unsupervised Behavior Clustering

Explores unsupervised behavior clustering and dimensionality reduction techniques, covering algorithms like K-Means, DBSCAN, and Gaussian Mixture Model.

Clustering & Density Estimation

Covers clustering, PCA, LDA, K-means, GMM, KDE, and Mean Shift algorithms for density estimation and clustering.

Clustering Methods

Covers K-means, hierarchical, and DBSCAN clustering methods with practical examples.

Clustering: Unsupervised Learning

Explores dimensionality reduction, clustering algorithms, and the state of machine learning.

Clustering: Theory and Practice

Covers the theory and practice of clustering algorithms, including PCA, K-means, Fisher LDA, spectral clustering, and dimensionality reduction.

Graph Coloring II

Explores advanced graph coloring concepts, including planted coloring, rigidity threshold, and frozen variables in BP fixed points.

Characterisation of Clusters: Homogeneity, Separability

Explores centroid, medoid, homogeneity, separability in clustering, quality evaluation, stability, expert knowledge, and clustering algorithms.

Unsupervised Learning: Clustering Methods

Explores unsupervised learning through clustering methods like K-means and DBSCAN, addressing challenges and applications.

Dimensionality Reduction: PCA and LDA

Covers dimensionality reduction techniques like PCA and LDA, clustering methods, density estimation, and data representation.

Clustering & Density Estimation

Covers dimensionality reduction, clustering, and density estimation techniques, including PCA, K-means, GMM, and Mean Shift.

Time Series Clustering

Covers clustering time series data using dynamic time warping, string metrics, and Markov models.

Recommender Systems and Structure Discovery

Explores recommender systems, latent factor models, and clustering algorithms for structure discovery.