Method evidence record

K-Nearest Neighbors

K-Nearest Neighbors (KNN), formalized by Cover and Hart in 1967, is a non-parametric, instance-based method that classifies or predicts a new observation by looking at the k closest examples in the training data. For classification it takes a majority vote among those neighbors; for regression it averages their values.

Sources recorded, not reviewed

Source record

Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.

K-Nearest Neighbors (KNN) Classification and Regression

Taxonomic method record · ml-model / machine-learning

Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. · DOI 10.1109/TIT.1967.1053964

Open full method

Curated claims

Claims persisted in the evidence ledger, each with its own assessment.

No curated claims yet

This view does not invent a claim assessment when the ledger has none.

Related methods

Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.

Same method familyDecision Treemachine-suggested · Relational suggestion, not evidence.See alsoLogistic Regressionmachine-suggested · Relational suggestion, not evidence.Same method familyNaive Bayesmachine-suggested · Relational suggestion, not evidence.Same method familyRandom Forestmachine-suggested · Relational suggestion, not evidence.Same method familySupport Vector Machinemachine-suggested · Relational suggestion, not evidence.