Data classification is a hot topic in machine learning research. Most classification algorithms need complete data sets, but missing data widely exists in our life. It is necessary to classify the data sets with missing data. Generally speaking, the existence of missing data will affect the classification effect, so the processing method of missing data largely determines the quality of the classification algorithm. In this paper, K-nearest Neighbor (KNN) algorithm is improved with the help of Patial Distance Strategy(PDS)to be applied to incomplete data sets. The processed data set is visualized. The classification effect is compared with the mean imputation and 0-value imputation, and the different features of the data set are weighted in various ways. The results show that our method has high accuracy on incomplete data sets.
Partial Weighted K-nearest Neighbor Classification of Incomplete Data
2022-10-12
1530272 byte
Conference paper
Electronic Resource
English
Nearest neighbor weighted average customization for modeling faces
British Library Online Contents | 2013
|LDA/SVM driven nearest neighbor classification
IEEE | 2001
|LDA/SVM Driven Nearest Neighbor Classification
British Library Conference Proceedings | 2001
|Hyperspectral Signature Classification with Tabular Nearest-Neighbor Encoding
British Library Conference Proceedings | 2007
|British Library Online Contents | 2015
|