knn.cv                 package:class                 R Documentation

_k-_N_e_a_r_e_s_t _N_e_i_g_h_b_o_u_r _C_r_o_s_s-_V_a_l_i_d_a_t_o_r_y _C_l_a_s_s_i_f_i_c_a_t_i_o_n

_D_e_s_c_r_i_p_t_i_o_n:

     k-nearest neighbour cross-validatory classification from training
     set.

_U_s_a_g_e:

     knn.cv(train, cl, k = 1, l = 0, prob = FALSE, use.all = TRUE)

_A_r_g_u_m_e_n_t_s:

   train: matrix or data frame of training set cases. 

      cl: factor of true classifications of training set 

       k: number of neighbours considered. 

       l: minimum vote for definite decision, otherwise 'doubt'. (More
          precisely, less than 'k-l' dissenting votes are allowed, even
          if 'k' is increased by ties.) 

    prob: If this is true, the proportion of the votes for the winning
          class are returned as attribute 'prob'. 

 use.all: controls handling of ties. If true, all distances equal to
          the 'k'th largest are included. If false, a random selection
          of distances equal to the 'k'th is chosen to use exactly 'k'
          neighbours. 

_D_e_t_a_i_l_s:

     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 'k'th nearest vector, all candidates are included in
     the vote.

_V_a_l_u_e:

     factor of classifications of training set. 'doubt' will be
     returned as 'NA'.

_R_e_f_e_r_e_n_c_e_s:

     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.

_S_e_e _A_l_s_o:

     'knn'

_E_x_a_m_p_l_e_s:

     data(iris3)
     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)

