Algorithm 2 Pseudo code for K-nearest neighbors training

Require: Initialize $k,func,target,dat{a}_t$ Require: Initialize $neighbors$=[]  Train first weak decision tree model  for Each observation $dat{a}_t$ do   $distance$ = euclidean distance $\left(data\right[:-1],target)$   calculate euclidean distance   append neighbors  end for  pick the top-K closest training data  take the most common label of these labels  return labels