CKNNI: An improved KNN-based missing value handling technique

Abstract

In data mining field, experimental data sets are often incomplete due to the imperfect nature of real world situations. However, the incompleteness of data sets generally leads to biased outcomes. Thus, data completeness is one of the most essential challenges among data mining tasks. In order to achieve better outcome many researchers have explored various techniques to reduce data incompleteness, and some existing methods have been widely used in real world applications. This paper first discusses some existing representative missing data handling techniques with their advantages and drawbacks. Then a new improved KNN based algorithm, Class-Based K-clusters Nearest Neighbor Imputation (CKNNI) is proposed, which integrates K-means cluster algorithm and conventional KNN algorithm to impute missing values in data sets. By clustering instances in the same class with K-means algorithm, CKNNI method then applies KNN algorithm to select a closest neighbor from the set of centroids in resulted clusters, and missing values are imputed with the ones from corresponding variables in a selected neighbor. Finally, the comparison based on multiple data sets indicates that CKNNI has improved the performance of KNN imputation significantly on large data sets yet comparative to other superior missing value handling algorithms.