First, K nearest neighbor algorithm are used to get the required plane subset of K nearest neighbor algorithm to search the sample points nearest K neighbors, as the representative of the sample points to the idea of the method is: if a sample in the feature space K most similar (i.e., in the feature space adjacent) most of the sample belongs to a category, then the sample also belong to this category, nearest neighbor search with fixed number of nearest neighbor method,
CodePudding user response:
Pray god taught T ^ T