Neural Time Warping For Multiple Sequence Alignment

• URL: http://arxiv.org/abs/2006.15753v1
• Date: Mon, 29 Jun 2020 00:16:40 GMT
• Title: Neural Time Warping For Multiple Sequence Alignment
• Authors: Keisuke Kawano, Takuro Kutsuna, Satoshi Koide
• Abstract summary: Multiple sequences alignment (MSA) is a traditional and challenging task for time-series analyses. We propose neural time warping (NTW) that relaxes the original MSA to a continuous optimization and obtains the alignments using a neural network.
• Score: 13.922507071009958
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multiple sequences alignment (MSA) is a traditional and challenging task for time-series analyses. The MSA problem is formulated as a discrete optimization problem and is typically solved by dynamic programming. However, the computational complexity increases exponentially with respect to the number of input sequences. In this paper, we propose neural time warping (NTW) that relaxes the original MSA to a continuous optimization and obtains the alignments using a neural network. The solution obtained by NTW is guaranteed to be a feasible solution for the original discrete optimization problem under mild conditions. Our experimental results show that NTW successfully aligns a hundred time-series and significantly outperforms existing methods for solving the MSA problem. In addition, we show a method for obtaining average time-series data as one of applications of NTW. Compared to the existing barycenters, the mean time series data retains the features of the input time-series data.

Related papers

• Deep Time Warping for Multiple Time Series Alignment [0.0]
  Time Series Alignment is a critical task in signal processing with numerous real-world applications. This paper introduces a novel approach for Multiple Time Series Alignment leveraging Deep Learning techniques.
  arXiv  Detail & Related papers  (2025-02-22T18:55:51Z)
• Diffeomorphic Temporal Alignment Nets for Time-series Joint Alignment and Averaging [8.14908648005543]
  In time-series analysis, nonlinear temporal misalignment remains a pivotal challenge that forestalls even simple averaging. DTAN predicts and applies diffeomorphic transformations in an input-dependent manner, thus facilitating the joint alignment (JA) and averaging of time-series ensembles. We extend our framework to incorporate multi-task learning (MT-DTAN), enabling simultaneous timeseries alignment and classification.
  arXiv  Detail & Related papers  (2025-02-10T15:55:08Z)
• Trajectory Flow Matching with Applications to Clinical Time Series Modeling [77.58277281319253]
  Trajectory Flow Matching (TFM) trains a Neural SDE in a simulation-free manner, bypassing backpropagation through the dynamics. We demonstrate improved performance on three clinical time series datasets in terms of absolute performance and uncertainty prediction.
  arXiv  Detail & Related papers  (2024-10-28T15:54:50Z)
• Multi-Source and Test-Time Domain Adaptation on Multivariate Signals using Spatio-Temporal Monge Alignment [59.75420353684495]
  Machine learning applications on signals such as computer vision or biomedical data often face challenges due to the variability that exists across hardware devices or session recordings. In this work, we propose Spatio-Temporal Monge Alignment (STMA) to mitigate these variabilities. We show that STMA leads to significant and consistent performance gains between datasets acquired with very different settings.
  arXiv  Detail & Related papers  (2024-07-19T13:33:38Z)
• DASA: Delay-Adaptive Multi-Agent Stochastic Approximation [64.32538247395627]
  We consider a setting in which $N$ agents aim to speedup a common Approximation problem by acting in parallel and communicating with a central server. To mitigate the effect of delays and stragglers, we propose textttDASA, a Delay-Adaptive algorithm for multi-agent Approximation.
  arXiv  Detail & Related papers  (2024-03-25T22:49:56Z)
• Graph Spatiotemporal Process for Multivariate Time Series Anomaly Detection with Missing Values [67.76168547245237]
  We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies. Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-01-11T10:10:16Z)
• Match-And-Deform: Time Series Domain Adaptation through Optimal Transport and Temporal Alignment [10.89671409446191]
  We introduce the Match-And-Deform (MAD) approach that aims at finding correspondences between the source and target time series. When embedded into a deep neural network, MAD helps learning new representations of time series that both align the domains. Empirical studies on benchmark datasets and remote sensing data demonstrate that MAD makes meaningful sample-to-sample pairing and time shift estimation.
  arXiv  Detail & Related papers  (2023-08-24T09:57:11Z)
• Time-Parameterized Convolutional Neural Networks for Irregularly Sampled Time Series [26.77596449192451]
  Irregularly sampled time series are ubiquitous in several application domains, leading to sparse, not fully-observed and non-aligned observations. Standard sequential neural networks (RNNs) and convolutional neural networks (CNNs) consider regular spacing between observation times, posing significant challenges to irregular time series modeling. We parameterize convolutional layers by employing time-explicitly irregular kernels.
  arXiv  Detail & Related papers  (2023-08-06T21:10:30Z)
• STING: Self-attention based Time-series Imputation Networks using GAN [4.052758394413726]
  STING (Self-attention based Time-series Imputation Networks using GAN) is proposed. We take advantage of generative adversarial networks and bidirectional recurrent neural networks to learn latent representations of the time series. Experimental results on three real-world datasets demonstrate that STING outperforms the existing state-of-the-art methods in terms of imputation accuracy.
  arXiv  Detail & Related papers  (2022-09-22T06:06:56Z)
• NRTSI: Non-Recurrent Time Series Imputation for Irregularly-sampled Data [14.343059464246425]
  Time series imputation is a fundamental task for understanding time series with missing data. We propose a novel imputation model called NRTSI without any recurrent modules. NRTSI can easily handle irregularly-sampled data, perform multiple-mode imputation, and handle the scenario where dimensions are partially observed.
  arXiv  Detail & Related papers  (2021-02-05T18:41:25Z)
• Automatic Registration and Clustering of Time Series [7.822816087275812]
  We propose a new method for automatic time series alignment within a clustering problem. Our approach, Temporal Registration using Optimal Unitary Transformations (TROUT), is based on a novel dissimilarity measure between time series. By embedding our new measure in a optimization formulation, we retain well-known advantages of computational and statistical performance.
  arXiv  Detail & Related papers  (2020-12-08T21:51:21Z)
• TadGAN: Time Series Anomaly Detection Using Generative Adversarial Networks [73.01104041298031]
  TadGAN is an unsupervised anomaly detection approach built on Generative Adversarial Networks (GANs) To capture the temporal correlations of time series, we use LSTM Recurrent Neural Networks as base models for Generators and Critics. To demonstrate the performance and generalizability of our approach, we test several anomaly scoring techniques and report the best-suited one.
  arXiv  Detail & Related papers  (2020-09-16T15:52:04Z)
• Improving a State-of-the-Art Heuristic for the Minimum Latency Problem with Data Mining [69.00394670035747]
  Hybrid metaheuristics have become a trend in operations research. A successful example combines the Greedy Randomized Adaptive Search Procedures (GRASP) and data mining techniques.
  arXiv  Detail & Related papers  (2019-08-28T13:12:30Z)

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.