// ◇ Classical Machine Learning
k-Nearest Neighbors
Predicts by majority vote of the k closest training examples.
K 近邻 1967 Beginner core
IN PLAIN WORDS
There is no training: store the data and at prediction time let the k nearest neighbors vote. It is the ancestor of today's vector similarity search.
Used in: Recommendation, anomaly detection, vector-search baselines
TIMELINE · prerequisites → this → what builds on it
01Original paper
Nearest neighbor pattern classification
Cover et al. · IEEE Transactions on Information Theory · 1967
DOI ↗ ✓ Verified · Crossref API doi:10.1109/TIT.1967.1053964
02Where it sits
Learn the left column first; the right column builds on this one.
Learn first
- No prerequisites — a good starting point
Then you can learn
Related:k-Means Clustering
Left: prerequisites · right: builds on this · dashed: related. Full map →
03Learning resources
Official docs, explainers, courses and reference code. All links checked.
04Where the course teaches it
On learning paths:Zero to Deep Learning
For AI / data
- Verification: verified, checked 2026-10-21.
- JSON: /api/learn/algorithms.json (id:
knn)