Skip to main content

ThesoTM thesaurus

Search from vocabulary

Concept information

Preferred term

k-nearest neighbor classification  

Definition

  • The k-nearest neighbors algorithm is a non-parametric classification method which consists in taking into account (in an identical way) the k training samples whose input is closest to the new input x, according to a distance to be defined. (Wikipedia, retrieved 07/07/2021).

Broader concept

Entry terms

  • k-nearest neighbour classification
  • k-NN
  • KNN

In other languages

URI

http://data.loterre.fr/ark:/67375/LTK-P43MX7SW-N

Download this concept: