Methods › General › Non-Parametric Regression › k-NN

k-Nearest Neighbors

k-NN

192 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

k-Nearest Neighbors is a clustering-based algorithm for classification and regression. It is a a type of instance-based learning as it does not attempt to construct a general internal model, but simply stores instances of the training data. Prediction is computed from a simple majority vote of the nearest neighbors of each point: a query point is assigned the data class which has the most representatives within the nearest neighbors of the point.

Source of Description and Image: scikit-learn

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 192 · with a code link: 76 · where Syntology ran a sample: 16 (12 with a run with no instrument failure, 4 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (16 of 192 tagged: 12 with a run with no instrument failure, 4 where every run was a failure of Syntology's instrument)

Page 1 of 2: papers 1 to 100 of 192, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 206 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Clustering27
Retrieval24
General Classification20
Classification17
Self-Supervised Learning11
BIG-bench Machine Learning9
Dimensionality Reduction9
Image Retrieval9
graph partitioning9
regression9
Contrastive Learning8
Graph Embedding8
Image Classification8
Quantization7
Representation Learning7
Sentiment Analysis7
image-classification7
Graph Clustering6
Metric Learning6
Object Detection6

Usage over time archive 2025-07-28

Papers per year tagged with k-NN: 2012 to 2025, peak 33 33 0 2012: 3 papers 2012 2013: 3 papers 2013 2014: 4 papers 2014 2015: 3 papers 2015 2016: 9 papers 2016 2017: 8 papers 2017 2018: 16 papers 2018 2019: 19 papers 2019 2020: 17 papers 2020 2021: 33 papers 2021 2022: 20 papers 2022 2023: 30 papers 2023 2024: 21 papers 2024 2025: 6 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (192 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Non-Parametric RegressionNon-Parametric Classification

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections