Genetic versus nearest-neighbor imputation of missing attribute values for RBF networks

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Missing data is a common issue in almost every real-world dataset. In this work, we investigate the relative merits of applying two imputation schemes for coping with this problem while designing radial basis function network classifiers, which show sensitiveness to the existence of missing values. Whereas the first scheme centers upon the k-nearest neighbor algorithm and has been deployed with success in other supervised/unsupervised learning contexts, the second is based on a simple genetic algorithm model and has not been fully explored so far. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

De Oliveira, P. G., & Coelho, A. L. V. (2009). Genetic versus nearest-neighbor imputation of missing attribute values for RBF networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5507 LNCS, pp. 276–283). https://doi.org/10.1007/978-3-642-03040-6_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free