Pith. sign in

REVIEW 2 cited by

k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.04523 v2 pith:BM6R5QSJ submitted 2020-04-09 cs.LG stat.ML

Padraig Cunningham , Sarah Jane Delany This is my paper · ORCID
classification cs.LGstat.ML
keywords nearestclassificationneighbourneighboursclassifiercomputationaleditionidentifying
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier -- classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance because issues of poor run-time performance is not such a problem these days with the computational power that is available. This paper presents an overview of techniques for Nearest Neighbour classification focusing on; mechanisms for assessing similarity (distance), computational issues in identifying nearest neighbours and mechanisms for reducing the dimension of the data. This paper is the second edition of a paper previously published as a technical report. Sections on similarity measures for time-series, retrieval speed-up and intrinsic dimensionality have been added. An Appendix is included providing access to Python code for the key methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. kNNGuard: Turning LLM Hidden Activations into a Training-Free Configurable Guardrail

    cs.LG 2026-07 unverdicted novelty 6.0 of 10

    Multi-layer Fisher-weighted kNN over frozen-LLM activations, fused with embedding kNN, yields competitive F1 guardrails from a 50-example bank with no fine-tuning and sub-10-second domain adaptation.

  2. Cross-Attention Calibrated Deduplication for Retrieval-Augmented Generation System

    cs.CL 2026-07 conditional novelty 5.5 of 10

    CACD deduplicates RAG chunks via cross-encoder scores, attention-entropy NIS, and majority vote, dropping ~9.75% of chunks on SQuAD faster than cosine filtering.

Pith tools