Skip to main content
Graph
Search
fr
|
en
Switch to dark mode
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Clustering: K-means & LDA
Graph Chatbot
Related lectures (31)
Previous
Page 2 of 4
Next
Spectral Clustering: Theory and Applications
Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.
Machine Learning Fundamentals
Introduces fundamental machine learning concepts, covering regression, classification, dimensionality reduction, and deep generative models.
Unsupervised Learning: PCA & K-means
Covers unsupervised learning with PCA and K-means for dimensionality reduction and data clustering.
Neural Networks Recap: Activation Functions
Covers the basics of neural networks, activation functions, training, image processing, CNNs, regularization, and dimensionality reduction methods.
Nearest Neighbor Rules: Part 2
Explores the Nearest Neighbor Rules, k-NN algorithm challenges, Bayes classifier, and k-means algorithm for clustering.
Untitled
Machine Learning Fundamentals
Covers the fundamental principles and methods of machine learning, including supervised and unsupervised learning techniques.
Unsupervised Learning: Dimensionality Reduction
Explores unsupervised learning techniques for reducing dimensions in data, emphasizing PCA, LDA, and Kernel PCA.
Unsupervised Learning: Clustering Methods
Covers unsupervised learning focusing on clustering methods and the challenges faced in clustering algorithms like K-means and DBSCAN.
Principal Component Analysis: Dimensionality Reduction
Covers Principal Component Analysis for dimensionality reduction, exploring its applications, limitations, and importance of choosing the right components.