Tree-based procedures have been recently considered as non parametric tools for missing data imputation when dealing with large data structures and no probability assumption. A previous work used incremental algorithm based on cross-validated decision trees and a lexicographic ordering of the single data to be imputed. This paper considers an ensemble method where tree-based model is used as learner. Furthermore, the proposed method allows more accurate imputations through a more efficient algorithm. A simulation case study shows the overall good performance of the proposed method against some competitors. A MatLab implementation enriches Tree Harvest Software for non-standard classification and regression trees.
Boosted Incremental Tree-based Imputation of Missing Data / Siciliano, Roberta; Aria, Massimo; D'Ambrosio, Antonio. - STAMPA. - 1:(2006), pp. 271-278.
Boosted Incremental Tree-based Imputation of Missing Data
SICILIANO, ROBERTA;ARIA, MASSIMO;D'AMBROSIO, ANTONIO
2006
Abstract
Tree-based procedures have been recently considered as non parametric tools for missing data imputation when dealing with large data structures and no probability assumption. A previous work used incremental algorithm based on cross-validated decision trees and a lexicographic ordering of the single data to be imputed. This paper considers an ensemble method where tree-based model is used as learner. Furthermore, the proposed method allows more accurate imputations through a more efficient algorithm. A simulation case study shows the overall good performance of the proposed method against some competitors. A MatLab implementation enriches Tree Harvest Software for non-standard classification and regression trees.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.