Download PDFOpen PDF in browser

Empirical Investigation of Learning-Based Imputation Policies

13 pagesPublished: September 29, 2016

Abstract

Certain approaches for missing-data imputation propose the use of learning techniques to identify regularities and relations between attributes, which are subsequently used to impute some of the missing data. Prior theoretical results suggest that the soundness and completeness of such learning-based techniques can be improved by applying rules anew on the imputed data, as long as one is careful in choosing which rules to apply at each stage. This work presents an empirical investigation of three natural learning-based imputation policies: training rules once and applying them repeatedly; training new rules at each iteration; continuing the training of previous rules at each iteration. We examine how the three policies fare across different settings. In line with the predictions of the theory, we find that an iterative learn-predict approach is preferable.

Keyphrases: Chaining rules, empirical investigation, imputation policies, Iterative learning and reasoning, machine learning, missing data, training rules

In: Christoph Benzmüller, Geoff Sutcliffe and Raul Rojas (editors). GCAI 2016. 2nd Global Conference on Artificial Intelligence, vol 41, pages 161--173

Links:
BibTeX entry
@inproceedings{GCAI2016:Empirical_Investigation_of_Learning_Based,
  author    = {Hara Skouteli and Loizos Michael},
  title     = {Empirical Investigation of Learning-Based Imputation Policies},
  booktitle = {GCAI 2016. 2nd Global Conference on Artificial Intelligence},
  editor    = {Christoph Benzm\textbackslash{}"uller and Geoff Sutcliffe and Raul Rojas},
  series    = {EPiC Series in Computing},
  volume    = {41},
  pages     = {161--173},
  year      = {2016},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/hlg},
  doi       = {10.29007/rcnn}}
Download PDFOpen PDF in browser