A disk-aware algorithm for time series motif discovery

DOI10.1007/S10618-010-0176-8zbMATH Open1235.68063OpenAlexW2072708938WikidataQ90175810 ScholiaQ90175810MaRDI QIDQ408596FDOQ408596

Qiang Zhu, Sydney S. Cash, Abdullah Mueen, Eamonn J. Keogh, M. Brandon Westover

Publication date: 11 April 2012

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc7062370

zbMATH Keywords

pruningbottom-up searchrandom referencestime series motifs

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Multidimensional divide-and-conquer
• Reduction techniques for instance-based learning algorithms
• Discovery of time-series motif from multi-dimensional data based on MDL principle
• A disk-aware algorithm for time series motif discovery
• An efficient external sorting with minimal space requirement

Cited In (3)

• A disk-aware algorithm for time series motif discovery
• Time series joins, motifs, discords and shapelets: a unifying view that exploits the matrix profile
• Constrained motif discovery in time series

Uses Software

• PhysioToolkit
• iSAX

This page was built for publication: A disk-aware algorithm for time series motif discovery

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