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: Dimensionality Reduction
Graph Chatbot
Related lectures (31)
Previous
Page 2 of 4
Next
Clustering: Theory and Practice
Covers the theory and practice of clustering algorithms, including PCA, K-means, Fisher LDA, spectral clustering, and dimensionality reduction.
Unsupervised Learning: Clustering Methods
Covers unsupervised learning focusing on clustering methods and the challenges faced in clustering algorithms like K-means and DBSCAN.
Unsupervised Learning: PCA & K-means
Covers unsupervised learning with PCA and K-means for dimensionality reduction and data clustering.
Unsupervised Behavior Clustering
Explores unsupervised behavior clustering and dimensionality reduction techniques, covering algorithms like K-Means, DBSCAN, and Gaussian Mixture Model.
Unsupervised Machine Learning: Clustering Basics
Introduces unsupervised machine learning clustering techniques like K-means, Gaussian Mixture Models, and DBSCAN, explaining their algorithms and applications.
Spin Glasses and Bayesian Estimation
Covers the concepts of spin glasses and Bayesian estimation, focusing on observing and inferring information from a system closely.
Clustering: K-means & LDA
Covers clustering using K-means and LDA, PCA, K-means properties, Fisher LDA, and spectral clustering.
Nearest Neighbor Rules: Part 2
Explores the Nearest Neighbor Rules, k-NN algorithm challenges, Bayes classifier, and k-means algorithm for clustering.
Clustering Methods: K-means and DBSCAN
Explores K-means and DBSCAN clustering methods, discussing properties, drawbacks, initialization, and optimal cluster selection.
K-means Algorithm
Covers the K-means algorithm for clustering data samples into k classes without labels, aiming to minimize the loss function.