Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment

DOI10.1016/J.TCS.2011.09.029MaRDI QIDQ764307zbMATHOpenAlexWikidataFDO

Authors François Petitjean, Pierre Gançarski

Publication date 13 March 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.09.029

zbMATH Keywords

soft computingdynamic time warpingmultiple alignmenttime series averagingcompact multiple alignmentconsensus sequencetime series summarizing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Algorithms on strings (68W32)

Recommendations

• Consensus patterns of a set of time series via a wavelet-based temporal localization: emphasizing the utility over point-wise averaging and averaging under dynamic time warping
• A global averaging method for dynamic time warping, with applications to clustering
• A time warping approach to multiple sequence alignment
• Exact mean computation in dynamic time warping spaces
• Sufficient conditions for the existence of a sample mean of time series under dynamic time warping

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1330052 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A global averaging method for dynamic time warping, with applications to clustering
• Algorithms on Strings, Trees and Sequences
• An adaptive genetic clustering method for exploratory mining of feature vector and time series data
• Dynamic programming algorithm optimization for spoken word recognition
• Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
• Steiner Minimal Trees

Cited in

(13)

• On the alignment of multiple time series fragments
• Times series averaging and denoising from a probabilistic perspective on time-elastic kernels
• Symmetric time warping, Boltzmann pair probabilities and functional genomics
• A global averaging method for dynamic time warping, with applications to clustering
• A time warping approach to multiple sequence alignment
• On computing exact means of time series using the move-split-merge metric
• An average-compress algorithm for the sample mean problem under dynamic time warping
• Sufficient conditions for the existence of a sample mean of time series under dynamic time warping
• Tight hardness results for consensus problems on circular strings and time series
• Consensus patterns of a set of time series via a wavelet-based temporal localization: emphasizing the utility over point-wise averaging and averaging under dynamic time warping
• SimUSF: an efficient and effective similarity measure that is invariant to violations of the interval scale assumption
• Exact mean computation in dynamic time warping spaces
• Approximating ( k,ℓ )-Median Clustering for Polygonal Curves

Describes a project that uses

Uses Software

• MUSCLE
• Kalign
• T-coffee
• PROMALS
• PCMA

This page was built for publication: Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764307)