PaSTiLa: scalable parallel algorithm for unsupervised labeling of long time series

DOI10.1134/S1995080224600766MaRDI QIDQ6586797zbMATH OpenFDO

Authors M. L. Zymbler, A. I. Goglachev

Publication date 13 August 2024

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

labelingtime seriesparallel algorithmhigh-performance clusterCUDAGPUsummarizationsnippetMPdistsnippet-finder

Mathematics Subject Classification ID

Statistics (62-XX) Artificial intelligence (68Txx) Inference from stochastic processes (62Mxx)

Cites work

• An ultra-fast time series distance measure to allow data mining in more complex real-world deployments
• Bounds on Multiprocessing Timing Anomalies
• ClaSP: parameter-free time series segmentation
• Discovery of time series motifs on Intel many-core systems
• Domain agnostic online semantic segmentation for multi-dimensional time series
• Finding Groups in Data
• Greedy Kernel Change-Point Detection
• Introducing time series snippets: a new primitive for summarizing long time series
• The problem of the random walk.
• Time series joins, motifs, discords and shapelets: a unifying view that exploits the matrix profile

This page was built for publication: PaSTiLa: scalable parallel algorithm for unsupervised labeling of long time series

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