kNN ensembles with penalized DTW for multivariate time series imputation

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

The imputation of partially missing multivariate time series data is critical for its correct analysis. The biggest problems in time series data are consecutively missing values that would result in serious information loss if simply dropped from the dataset. To address this problem, we adapt the k-Nearest Neighbors algorithm in a novel way for multivariate time series imputation. The algorithm employs Dynamic Time Warping as distance metric instead of point-wise distance measurements. We preprocess the data with linear interpolation to create complete windows for Dynamic Time Warping. The algorithm derives global distance weights from the correlation between features and consecutively missing values are penalized by individual distance weights to reduce error transfer from linear interpolation. Finally, efficient ensemble methods improve the accuracy. Experimental results show accurate imputations on datasets with a high correlation between features. Further, our algorithm shows better results with consecutively missing values than state-of-the-art algorithms.

Original languageEnglish
Title of host publication2016 International Joint Conference on Neural Networks, IJCNN 2016
Number of pages8
PublisherInstitute of Electrical and Electronics Engineers Inc.
Publication date31 Oct 2016
Pages2774-2781
Article number7727549
ISBN (Electronic)9781509006199
DOIs
Publication statusPublished - 31 Oct 2016
Externally publishedYes
Event2016 International Joint Conference on Neural Networks, IJCNN 2016 - Vancouver, Canada
Duration: 24 Jul 201629 Jul 2016

Conference

Conference2016 International Joint Conference on Neural Networks, IJCNN 2016
LandCanada
ByVancouver
Periode24/07/201629/07/2016
SponsorIEEE Computational Intelligence Society (IEEE CIS)

ID: 223196498