Lecture

Nearest Neighbor Search: Johnson-Lindenstrauss Lemma

Related lectures (30)

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.

Clustering & Density Estimation

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

Nearest Neighbor Classifier: Curse of Dimensionality

Explores the nearest neighbor classifier method, discussing its limitations in high-dimensional spaces and the importance of spatial correlation for effective predictions.

Clustering & Density Estimation

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

Locality Sensitive Hashing

Explores Locality Sensitive Hashing for nearest neighbor search and submodularity in hash functions.

Unsupervised Behavior Clustering

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

Multiclass Classification

Covers the concept of multiclass classification and the challenges of linearly separating data with multiple classes.

Dimensionality Reduction: PCA & Autoencoders

Explores PCA, Autoencoders, and their applications in dimensionality reduction and data generation.

Dimensionality Reduction: PCA & t-SNE

Explores PCA and t-SNE for reducing dimensions and visualizing high-dimensional data effectively.

K-Nearest Neighbors & Feature Expansion

Introduces k-Nearest Neighbors method and feature expansion for nonlinear machine learning through polynomial transformations.

Document Analysis: Topic Modeling

Explores document analysis, topic modeling, and generative models for data generation in machine learning.