A Study of K-Nearest Neighbour as an Imputation Method

DMCA

A Study of K-Nearest Neighbour as an Imputation Method (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gustavo Batista , Maria Carolina Monard

Venue:	In HIS
Citations:	12 - 0 self

BibTeX

@INPROCEEDINGS{Batista03astudy,
    author = {Gustavo Batista and Maria Carolina Monard},
    title = {A Study of K-Nearest Neighbour as an Imputation Method},
    booktitle = {In HIS},
    year = {2003}
}

OpenURL

Abstract

Data quality is a major concern in Machine Learning and other correlated areas such as Knowledge Discovery from Databases (KDD). As most Machine Learning algorithms induce knowledge strictly from data, the quality of the knowledge extracted is largely determined by the quality of the underlying data. One relevant problem in data quality is the presence of missing data. Despite the frequent occurrence of missing data, many Machine Learning algorithms handle missing data in a rather naive way. Missing data treatment should be carefully thought, otherwise bias might be introduced into the knowledge induced. In this work, we analyse the use of the k-nearest neighbour as an imputation method. Imputation is a term that denotes a procedure that replaces the missing values in a data set by some plausible values. Our analysis indicates that missing data imputation based on the k-nearest neighbour algorithm can outperform the internal methods used by C4.5 and CN2 to treat missing data.

Keyphrases

k-nearest neighbour imputation method data quality many machine learning algorithm handle naive way internal method knowledge discovery machine learning algorithm induce knowledge underlying data major concern relevant problem plausible value k-nearest neighbour algorithm data treatment machine learning frequent occurrence data imputation

DMCA