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
Nearest Neighbor Search: Johnson-Lindenstrauss Lemma
Graph Chatbot
Related lectures (30)
Previous
Page 1 of 3
Next
Neural Networks Recap: Activation Functions
Covers the basics of neural networks, activation functions, training, image processing, CNNs, regularization, and dimensionality reduction methods.
Gaussian Naive Bayes & K-NN
Covers Gaussian Naive Bayes, K-nearest neighbors, and hyperparameter tuning in machine learning.
Textual Data Analysis: Classification & Dimensionality Reduction
Explores textual data classification, focusing on methods like Naive Bayes and dimensionality reduction techniques like Principal Component Analysis.
Nonlinear Dimension Reduction Methods
Explores nonlinear dimension reduction methods preserving neighborhoods in lower-dimensional spaces.
Introduction to Machine Learning: Linear Models
Introduces linear models for supervised learning, covering overfitting, regularization, and kernels, with applications in machine learning tasks.
Near Neighbors Retrieval: Efficient Techniques
Covers techniques for efficiently retrieving similar items using similarity search queries.
Dimensionality Reduction: PCA & LDA
Covers PCA and LDA for dimensionality reduction, explaining variance maximization, eigenvector problems, and the benefits of Kernel PCA for nonlinear data.
Clustering & Density Estimation
Covers dimensionality reduction, PCA, clustering techniques, and density estimation methods.
Clustering: Unsupervised Learning
Explores dimensionality reduction, clustering algorithms, and the state of machine learning.
Understanding Autoencoders
Explores autoencoders, from linear mappings in PCA to nonlinear mappings, deep autoencoders, and their applications.