Towards Symbolic Time Series Representation Improved by Kernel Density Estimators

• URL: http://arxiv.org/abs/2205.12960v1
• Date: Wed, 25 May 2022 13:16:18 GMT
• Title: Towards Symbolic Time Series Representation Improved by Kernel Density Estimators
• Authors: Matej Kloska and Viera Rozinajova
• Abstract summary: This paper builds up on the popular mapping technique Symbolic Aggregate approXimation algorithm (SAX) It is extensively utilized in sequence classification, pattern mining, anomaly detection, time series indexing and other data mining tasks. We describe here our approach, including evaluation on commonly employed tasks such as time series reconstruction error and Euclidean distance lower bounding with promising improvements over SAX.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper deals with symbolic time series representation. It builds up on the popular mapping technique Symbolic Aggregate approXimation algorithm (SAX), which is extensively utilized in sequence classification, pattern mining, anomaly detection, time series indexing and other data mining tasks. However, the disadvantage of this method is, that it works reliably only for time series with Gaussian-like distribution. In our previous work we have proposed an improvement of SAX, called dwSAX, which can deal with Gaussian as well as non-Gaussian data distribution. Recently we have made further progress in our solution - edwSAX. Our goal was to optimally cover the information space by means of sufficient alphabet utilization; and to satisfy lower bounding criterion as tight as possible. We describe here our approach, including evaluation on commonly employed tasks such as time series reconstruction error and Euclidean distance lower bounding with promising improvements over SAX.

Related papers

• Equation Discovery with Bayesian Spike-and-Slab Priors and Efficient Kernels [57.46832672991433]
  We propose a novel equation discovery method based on Kernel learning and BAyesian Spike-and-Slab priors (KBASS) We use kernel regression to estimate the target function, which is flexible, expressive, and more robust to data sparsity and noises. We develop an expectation-propagation expectation-maximization algorithm for efficient posterior inference and function estimation.
  arXiv  Detail & Related papers  (2023-10-09T03:55:09Z)
• Quick Adaptive Ternary Segmentation: An Efficient Decoding Procedure For Hidden Markov Models [70.26374282390401]
  Decoding the original signal (i.e., hidden chain) from the noisy observations is one of the main goals in nearly all HMM based data analyses. We present Quick Adaptive Ternary (QATS), a divide-and-conquer procedure which decodes the hidden sequence in polylogarithmic computational complexity.
  arXiv  Detail & Related papers  (2023-05-29T19:37:48Z)
• HyperTime: Implicit Neural Representation for Time Series [131.57172578210256]
  Implicit neural representations (INRs) have recently emerged as a powerful tool that provides an accurate and resolution-independent encoding of data. In this paper, we analyze the representation of time series using INRs, comparing different activation functions in terms of reconstruction accuracy and training convergence speed. We propose a hypernetwork architecture that leverages INRs to learn a compressed latent representation of an entire time series dataset.
  arXiv  Detail & Related papers  (2022-08-11T14:05:51Z)
• Langevin Monte Carlo for Contextual Bandits [72.00524614312002]
  Langevin Monte Carlo Thompson Sampling (LMC-TS) is proposed to directly sample from the posterior distribution in contextual bandits. We prove that the proposed algorithm achieves the same sublinear regret bound as the best Thompson sampling algorithms for a special case of contextual bandits.
  arXiv  Detail & Related papers  (2022-06-22T17:58:23Z)
• Sparse-Group Log-Sum Penalized Graphical Model Learning For Time Series [12.843340232167266]
  We consider the problem of inferring the conditional independence graph (CIG) of a stationary multivariate Gaussian time series. A sparse-group lasso based frequency-domain formulation of the problem has been considered in the literature. We illustrate our approach utilizing both synthetic and real data.
  arXiv  Detail & Related papers  (2022-04-29T00:06:41Z)
• An efficient aggregation method for the symbolic representation of temporal data [0.0]
  We present a new variant of the adaptive Brownian bridge-based aggregation (ABBA) method, called fABBA. This variant utilizes a new aggregation approach tailored to the piecewise representation of time series. In contrast to the original method, the new approach does not require the number of time series symbols to be specified in advance.
  arXiv  Detail & Related papers  (2022-01-14T22:51:24Z)
• TSAX is Trending [0.0]
  Symbolic Aggregate approXimation (SAX) is one of the most popular representation methods of time series data. We present a new modification of SAX that only adds minimal complexity to SAX, but substantially improves its performance in time series classification.
  arXiv  Detail & Related papers  (2021-12-24T02:34:50Z)
• MrSQM: Fast Time Series Classification with Symbolic Representations [11.853438514668207]
  MrSQM uses multiple symbolic representations and efficient sequence mining to extract important time series features. We study four feature selection approaches on symbolic sequences, ranging from fully supervised, to unsupervised and hybrids. Our experiments on 112 datasets of the UEA/UCR benchmark demonstrate that MrSQM can quickly extract useful features.
  arXiv  Detail & Related papers  (2021-09-02T15:54:46Z)
• Gaussian MRF Covariance Modeling for Efficient Black-Box Adversarial Attacks [86.88061841975482]
  We study the problem of generating adversarial examples in a black-box setting, where we only have access to a zeroth order oracle. We use this setting to find fast one-step adversarial attacks, akin to a black-box version of the Fast Gradient Sign Method(FGSM) We show that the method uses fewer queries and achieves higher attack success rates than the current state of the art.
  arXiv  Detail & Related papers  (2020-10-08T18:36:51Z)
• Extreme-SAX: Extreme Points Based Symbolic Representation for Time Series Classification [0.0]
  We present Extreme-SAX (E-SAX), which uses only the extreme points of each segment to represent the time series. E-SAX has exactly the same simplicity and efficiency of the original SAX, yet it gives better results in time series classification than the original SAX.
  arXiv  Detail & Related papers  (2020-10-02T00:17:08Z)
• Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
  Local features provide region-to-region rather than point-to-point correspondences. We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline. Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
  arXiv  Detail & Related papers  (2020-07-20T12:07:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.