knntree

本程序是基于linux系统下c++代码

knnTree               package:knnTree               R Documentation

_K-_N_E_A_R_E_S_T _N_E_I_G_H_B_O_R _C_L_A_S_S_I_F_I_E_R_S _W_I_T_H_I_N _L_E_A_V_E_S _O_F _A _T_R_E_E

_D_e_s_c_r_i_p_t_i_o_n:

     Construct or predict with a knnTree object, which is a set of
     k-nearest neighbor classifiers, one for each leaf of a tree.

_U_s_a_g_e:

     knnTree (trg.set, trg.classes, v = 10, 
     k.vec = seq(1, 31, by = 2), seed = 0, opt.tree = "ignore", 
     opt.tree.size = 4, scaling = 1, prune.function = prune.misclass, 
     one.SE = TRUE, backward = FALSE, max.steps=-1, v.start = 1, leaf.start = 1, 
     verbose = FALSE, debug = 0, fname = "", use.big = FALSE, save.output = "")

_A_r_g_u_m_e_n_t_s:

 trg.set: 

trg.classes: 

       v: 

   k.vec: 

    seed: 

opt.tree: 

opt.tree.size: 

 scaling: 

prune.function: 

  one.SE: 

backward: 

max.steps: 

 v.start: 

leaf.start: 

 verbose: 

   debug: 

   fname: 

 use.big: 

save.output: 

     {character; if not empty, the resulting object is assigned to
     results in frame 1 and also dumped to disk in the file named in
     save.output. This can be useful for parallel processing.}

_V_a_l_u_e:

     Object of class knnTree. If the tree has n leaves, this will be a
     list with n+2 elements. The first is the global tree. The next n 
     elements are the n individual knn.var objects, one per leaf. Each
     of these objects has two additional pieces: leaf (giving the leaf
     number) and where (giving the row number of the global tree's
     frame for this leaf). The n+2-th element of the list is named call
     and is the call used to  create the object.