Approximate Nearest Neighbors : Data Science Concepts

preview_player
Показать описание
Like KNN but a lot faster.

  1. ritvikmath
Рекомендации по теме
Approximate Nearest Neighbors 0:15:05

Approximate Nearest Neighbors : Data Science Concepts

Approximate Nearest Neighbours 0:06:55

Approximate Nearest Neighbours in FAISS: Cell Probe 101

K Nearest Neighbors 0:02:13

K Nearest Neighbors | Intuitive explained | Machine Learning Basics

Graph-Based Approximate Nearest 0:58:31

Graph-Based Approximate Nearest Neighbors (ANN) and HNSW

ANNOY Vector Index 0:01:14

ANNOY Vector Index | Vector Database Fundamentals

Kacper Łukawski - 0:09:35

Kacper Łukawski - an introduction to approximate nearest neighbors | PyData Global 2022

StatQuest: K-nearest neighbors, 0:05:30

StatQuest: K-nearest neighbors, Clearly Explained

KD-Tree Nearest Neighbor 0:06:39

KD-Tree Nearest Neighbor Data Structure

NYCU Data Science 2:56:20

NYCU Data Science 2024 Week7: Machine Learning with scikit-learn (1)

FANNG: Fast Approximate 0:03:33

FANNG: Fast Approximate Nearest Neighbour Graphs

Approximate Nearest Neighbor 0:11:39

Approximate Nearest Neighbor and Product Quantizer for k-Nearest Neighbor | Embeddings Search

HNSW for Vector 0:34:35

HNSW for Vector Search Explained and Implemented with Faiss (Python)

Approximate Nearest Neighbor 0:20:18

Approximate Nearest Neighbor Benchmarks - Weaviate Podcast Recap

Billion Scale Deduplication 0:36:01

Billion Scale Deduplication using Approximate Nearest Neighbours| Idan Richman Goshen, Sr Ds@Lusha

Research talk: Approximate 0:09:33

Research talk: Approximate nearest neighbor search systems at scale

Approximate Nearest Neighbors: 0:05:32

Approximate Nearest Neighbors: A Tutorial in R

Approximate Nearest Neighbors 0:07:24

Approximate Nearest Neighbors (ANN), one of the efficient solution for large data search.

Approximate Nearest Neighbor 0:24:32

Approximate Nearest Neighbor Oh Yeah (Annoy) Indexing Algorithm Explained | Vector Search | Gen AI

Private Approximate Nearest 0:01:03

Private Approximate Nearest Neighbor Search

Erik Waingarten on 0:50:32

Erik Waingarten on Approximate Nearest Neighbors via Non-Linear Spectral Gaps

Approximate Nearest Neighbors 0:09:58

Approximate Nearest Neighbors in Limited Space

Approximate nearest neighbor 0:52:03

Approximate nearest neighbor search in high dimensions – Piotr Indyk – ICM2018

Approximate Nearest Neighbour 0:13:23

Approximate Nearest Neighbour and a popular Library Annoy for k-Nearest Neighbour Search

KDD 2023 - 0:01:37

KDD 2023 - Efficient Distributed Approximate k-Nearest Neighbor Graph Construction

Комментарии
Автор

Wow you have no idea how much i needed this for my current work project. Thanks as always for a fantastic explanation

ScaredCrows
Автор

I have implemented ANN on my own after watching your video. Thanks for the great explanation ritvik

vineethgudela
Автор

This is perfect!
I'm so sick of all these fancy literatury stuff from professors all over the world who can only communicate through differential equations. THIS is how it should be explained. Thank you good sir!

csbanki
Автор

You have a very clear but not too wordy style. *SUBSCRIBED*

rockapedra
Автор

OMG. I hope all my lecturers will explain that clearly and intuitively. Thankss

zivleibowitz
Автор

Thank you so much sir this explanation shows your exceptional ability to teach. So enlightening!

jiayangcheng
Автор

Clear explanation and very resourceful!

aZnPriDe
Автор

This is brilliant! Thank you so much for showing us this method!

hannahnelson
Автор

The lesson was clear and paper can be easier for you to control and work with. So this is fine. Thank you for the lesson!

ctRonIsaac
Автор

Mate you really know how to explain things. Thanks for your time and dedication.

randall.chamberlain
Автор

Pretty good explanation but you never showed what happens if the number of K you are searching for is bigger than the number of points in the specific area.

For example let's say you have a new point in R4 which has 3 points and you are searching for 4-NN for that point.
Thank you again for this video, really liked it

PhilipMavrepis
Автор

Thank you so much for the simple and clear explanation with examples!

Mci
Автор

Thanks for sharing such a detaild and thorough explanation!

Crimau
Автор

Very clear explanation! I think I got it in one pass! Pace is good. Thanks! (PS. the paper format is fine!)

monalover
Автор

I really like this format for this kind of explanation
Like explainnig how a technique works
very good vid, thanks

marcosricardooliveira
Автор

Thank you so much for a beautiful lesson. Reminded me of my elementary school days and how teachers used to teach back then. <3 I do have a question: could ANN potentially regroup regions if a new point is introduced, and as a result, it is closer to one point which is in a region already containing 3 points? Would the other points then divide into a new region?

mayapankhaj
Автор

Thanks for this excellent video! Is there a poplar library that helps to experiment with ANN on local machine for a small set of data?

qwerty
Автор

What's your qualification? Somehow I cannot find any information about your education etc. Awesome videos by the way, a lot easier to understand than what every professor tries to explain.

borknagarpopinga
Автор

Great video as always Ritvik.

Am I correct that building the tree is an O(N) operation? That is, if I have only one new data point and haven't yet constructed the tree, will this still save any time over the exhaustive method?

If not, then I presume building a forest would imply some break even point.

Thanks.

stevengusenius
Автор

thank you very much, it was so helpful <3

nadiakacem