Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment
DOI10.1016/j.tcs.2011.09.029zbMath1232.68105OpenAlexW2068982516WikidataQ56228140 ScholiaQ56228140MaRDI QIDQ764307
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
soft computingdynamic time warpingmultiple alignmenttime series averagingcompact multiple alignmentconsensus sequencetime series summarizing
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)
Related Items (6)
Uses Software
Cites Work
- A global averaging method for dynamic time warping, with applications to clustering
- Dynamic programming algorithm optimization for spoken word recognition
- Algorithms on Strings, Trees and Sequences
- Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
- An adaptive genetic clustering method for exploratory mining of feature vector and time series data
- Steiner Minimal Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment