Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A disk-aware algorithm for time series motif discovery

From MaRDI portal
Publication:408596
Jump to:navigation, search

DOI10.1007/s10618-010-0176-8zbMath1235.68063OpenAlexW2072708938WikidataQ90175810 ScholiaQ90175810MaRDI QIDQ408596

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

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)


Related Items (2)

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


Uses Software

  • PhysioToolkit
  • iSAX


Cites Work

  • Multidimensional divide-and-conquer
  • A disk-aware algorithm for time series motif discovery
  • Reduction techniques for instance-based learning algorithms
  • Discovery of time-series motif from multi-dimensional data based on MDL principle
  • An efficient external sorting with minimal space requirement
  • Unnamed Item


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:408596&oldid=12282851"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 04:36.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki