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
Concept
K-nearest neighbors algorithm
Applied sciences
Information engineering
Data science
Dimensionality reduction
Graph Chatbot
Related lectures (31)
Login to filter by course
Login to filter by course
Reset
Previous
Page 2 of 4
Next
Support Vector Machines: Basics and Applications
Covers the basics of support vector machines, logistic regression, decision boundaries, and the k-Nearest Neighbors algorithm.
Machine Learning Basics
Introduces the basics of machine learning, covering supervised classification, decision boundaries, and polynomial curve fitting.
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.
Supervised Learning: Classification Algorithms
Explores supervised learning in financial econometrics, emphasizing classification algorithms like Naive Bayes and Logistic Regression.
Near Neighbors Retrieval: Efficient Techniques
Covers techniques for efficiently retrieving similar items using similarity search queries.
Locality Sensitive Hashing
Explores Locality Sensitive Hashing for nearest neighbor search and submodularity in hash functions.
Logistic Regression: Probabilistic Interpretation
Covers logistic regression's probabilistic interpretation, multinomial regression, KNN, hyperparameters, and curse of dimensionality.
Linear Models: Recap and Extensions
Covers linear models, multi-class classification, k-Nearest Neighbors, and feature expansion techniques.
Nonlinear Machine Learning: k-Nearest Neighbors and Feature Expansion
Covers the transition from linear to nonlinear models, focusing on k-NN and feature expansion techniques.
Gaussian Discriminant Rule: Classification & Boundaries
Explores the Gaussian Discriminant Rule for classification using Gaussian Mixture Models and discusses drawing boundaries and model complexity.