Kevin Wellenzohn, Hannes Mitterer, J. Gamper, Michael H. Böhlen, Mourad Khayati
{"title":"Missing Value Imputation in Time Series Using Top-k Case Matching","authors":"Kevin Wellenzohn, Hannes Mitterer, J. Gamper, Michael H. Böhlen, Mourad Khayati","doi":"10.5167/UZH-104341","DOIUrl":null,"url":null,"abstract":"In this paper, we present a simple yet effective algorithm, called the Top-k Case Matching algorithm, for the imputation of miss- ing values in streams of time series data that are similar to each other. The key idea of the algorithm is to look for the k situations in the historical data that are most similar to the current situation and to derive the missing value from the measured values at these k time points. To efficiently identify the top-k most similar historical situations, we adopt Fagin’s Threshold Algorithm, yielding an al- gorithm with sub-linear runtime complexity with high probability, and linear complexity in the worst case (excluding the initial sort- ing of the data, which is done only once). We provide the results of a first experimental evaluation using real-world meteorological data. Our algorithm achieves a high accuracy and is more accurate and efficient than two more complex state of the art solutions.","PeriodicalId":151717,"journal":{"name":"Grundlagen von Datenbanken","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Grundlagen von Datenbanken","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5167/UZH-104341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
In this paper, we present a simple yet effective algorithm, called the Top-k Case Matching algorithm, for the imputation of miss- ing values in streams of time series data that are similar to each other. The key idea of the algorithm is to look for the k situations in the historical data that are most similar to the current situation and to derive the missing value from the measured values at these k time points. To efficiently identify the top-k most similar historical situations, we adopt Fagin’s Threshold Algorithm, yielding an al- gorithm with sub-linear runtime complexity with high probability, and linear complexity in the worst case (excluding the initial sort- ing of the data, which is done only once). We provide the results of a first experimental evaluation using real-world meteorological data. Our algorithm achieves a high accuracy and is more accurate and efficient than two more complex state of the art solutions.