In KNN, each sample can be classified into a specific class label, and the class labels to which its K neighbors account for the majority. The characteristic of the KNN classifier is its simple implementation. The essence of classification is to classify new samples that do not know the class label. The usual practice is to divide the data set into training and test data. Each sample in the test data needs to determine its K nearest neighbors from the training data. According to (22). Calculate the distance between the training group and the test group, defined as training and H test.
正在翻译中..