AAAI Publications, Twenty-Sixth AAAI Conference on Artificial Intelligence

Font Size: 
Classification of Sparse Time Series via Supervised Matrix Factorization
Josif Grabocka, Alexandros Nanopoulos, Lars Schmidt-Thieme

Last modified: 2012-07-14


Data sparsity is an emerging real-world problem observed in a various domains ranging from sensor networks to medical diagnosis. Consecutively, numerous machine learning methods were modeled to treat missing values. Nevertheless, sparsity, defined as missing segments, has not been thoroughly investigated in the context of time series classification. We propose a novel principle for classifying time series, which in contrast to existing approaches, avoids reconstructing the missing segments in time series and operates solely on the observed ones. Based on the proposed principle, we develop a method that prevents adding noise that incurs during the reconstruction of the original time series. Ourmethod adapts supervised matrix factorization by projecting time series in a latent space through stochasticlearning. Furthermore the projected data is built in a supervised fashion via a logistic regression. Abundant experiments on a large collection of 37 data sets demonstrate the superiority of our method, which in the majority of cases outperforms a set of baselines that do not follow our proposed principle.


Time Series, Matrix Factorization, Sparsity, Logistic Regression

Full Text: PDF