k-nearest neighbors
Go to external page
http://purl.obolibrary.org/obo/OBI_0000727
A k-nearest neighbors is a data transformation which achieves a class discovery or partitioning objective, in which an input data object with vector y is assigned to a class label based upon the k closest training data set points to y; where k is the largest value that class label is assigned.
Term info
Label
k-nearest neighbors
alternative term
k-NN
definition source
PERSON: James Malone
editor preferred term
k-nearest neighbors
has curation status
http://purl.obolibrary.org/obo/IAO_0000125
term editor
James Malone