Last chance! 50% off unlimited learning
Sale ends in
k-nearest neighbour cross-validatory classification from training set.
knn.cv(train, cl, k = 1, l = 0, prob = FALSE, use.all = TRUE)Factor of classifications of training set. doubt will be returned as NA.
matrix or data frame of training set cases.
factor of true classifications of training set
number of neighbours considered.
minimum vote for definite decision, otherwise doubt. (More
precisely, less than k-l dissenting votes are allowed, even
if k is increased by ties.)
If this is true, the proportion of the votes for the winning class
are returned as attribute prob.
controls handling of ties. If true, all distances equal to the kth
largest are included. If false, a random selection of distances
equal to the kth is chosen to use exactly k neighbours.
This uses leave-one-out cross validation.
For each row of the training set train, the k nearest
(in Euclidean distance) other
training set vectors are found, and the classification is decided by
majority vote, with ties broken at random. If there are ties for the
kth nearest vector, all candidates are included in the vote.
Ripley, B. D. (1996) Pattern Recognition and Neural Networks. Cambridge.
Venables, W. N. and Ripley, B. D. (2002) Modern Applied Statistics with S. Fourth edition. Springer.
knn
train <- rbind(iris3[,,1], iris3[,,2], iris3[,,3])
cl <- factor(c(rep("s",50), rep("c",50), rep("v",50)))
knn.cv(train, cl, k = 3, prob = TRUE)
attributes(.Last.value)
Run the code above in your browser using DataLab