Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Clustering: k-means
Graph Chatbot
Related lectures (31)
Previous
Page 1 of 4
Next
Nearest Neighbor Rules: Part 2
Explores the Nearest Neighbor Rules, k-NN algorithm challenges, Bayes classifier, and k-means algorithm for clustering.
Clustering Methods
Covers K-means, hierarchical, and DBSCAN clustering methods with practical examples.
Unsupervised Learning: Clustering & Dimensionality Reduction
Introduces unsupervised learning through clustering with K-means and dimensionality reduction using PCA, along with practical examples.
Clustering & Density Estimation
Covers dimensionality reduction, PCA, clustering techniques, and density estimation methods.
Unsupervised Learning: Dimensionality Reduction and Clustering
Covers unsupervised learning, focusing on dimensionality reduction and clustering, explaining how it helps find patterns in data without labels.
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 & Density Estimation
Covers clustering, PCA, LDA, K-means, GMM, KDE, and Mean Shift algorithms for density estimation and clustering.
Clustering & Density Estimation
Covers dimensionality reduction, clustering, and density estimation techniques, including PCA, K-means, GMM, and Mean Shift.
Clustering: K-means & LDA
Covers clustering using K-means and LDA, PCA, K-means properties, Fisher LDA, and spectral clustering.
Dimensionality Reduction: PCA and LDA
Covers dimensionality reduction techniques like PCA and LDA, clustering methods, density estimation, and data representation.