kNN ensembles with penalized DTW for multivariate time series imputation
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Standard
kNN ensembles with penalized DTW for multivariate time series imputation. / Oehmcke, Stefan; Zielinski, Oliver; Kramer, Oliver.
2016 International Joint Conference on Neural Networks, IJCNN 2016. Institute of Electrical and Electronics Engineers Inc., 2016. s. 2774-2781 7727549.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - kNN ensembles with penalized DTW for multivariate time series imputation
AU - Oehmcke, Stefan
AU - Zielinski, Oliver
AU - Kramer, Oliver
PY - 2016/10/31
Y1 - 2016/10/31
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85007198754&partnerID=8YFLogxK
U2 - 10.1109/IJCNN.2016.7727549
DO - 10.1109/IJCNN.2016.7727549
M3 - Article in proceedings
AN - SCOPUS:85007198754
SP - 2774
EP - 2781
BT - 2016 International Joint Conference on Neural Networks, IJCNN 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 International Joint Conference on Neural Networks, IJCNN 2016
Y2 - 24 July 2016 through 29 July 2016
ER -
ID: 223196498