Difference between revisions of "K-Nearest Neighbors (KNN)"
m |
m |
||
| Line 17: | Line 17: | ||
[https://www.google.com/search?q=k-nearest+neighbors+deep+machine+learning+ML ...Google search] | [https://www.google.com/search?q=k-nearest+neighbors+deep+machine+learning+ML ...Google search] | ||
| + | * [[Approximate Nearest Neighbor (ANN)]] | ||
* [[Hierarchical Navigable Small World (HNSW)]] | * [[Hierarchical Navigable Small World (HNSW)]] | ||
* [[Inverted File Indexes (IVF)]] | * [[Inverted File Indexes (IVF)]] | ||
Revision as of 13:07, 17 August 2023
YouTube search... ...Google search
- Approximate Nearest Neighbor (ANN)
- Hierarchical Navigable Small World (HNSW)
- Inverted File Indexes (IVF)
- AI Solver ... Algorithms ... Administration ... Model Search ... Discriminative vs. Generative ... Optimizer ... Train, Validate, and Test
- Excel ... Documents ... Database; Vector & Relational ... Graph ... LlamaIndex
- What Is K-Nearest Neighbors? | Daniel Nelson - Unite.ai
Can be used for regression or classification by choosing 'K'; where 'K' = # of closest neighboring data points that the model uses in prediction.
This is a simple algorithm which predicts unknown data point with its k nearest neighbors. The value of k is a critical factor here regarding the accuracy of prediction. It determines the nearest by calculating the distance using basic distance functions like Euclidean. However, this algorithm needs high computation power and we need to normalize data initially to bring every data point to same range. 10 Machine Learning Algorithms You need to Know | Sidath Asir @ Medium
