stumpy
stumpy copied to clipboard
TDAmeritrade
STUMPY is a powerful and scalable Python library for modern time series analysis
On the UCR Matrix Profile site, they have a growing list of time series questions that can be solved by computing the matrix profile. The PDF can be found [here](https://www.cs.ucr.edu/~eamonn/100_Time_Series_Data_Mining_Questions__with_Answers.pdf)...
This paper is [here](https://www.cs.ucr.edu/~eamonn/ContrastProfile_V048_names.pdf) The supporting site is [here](https://sites.google.com/view/contrastprofile) The main goal of a contrast profile is to annotate each subsequence of a time series so that you can discover...
MERLIN algorithm is for anomaly detection in long time series data `T`. It is initially proposed in paper [MERLIN](https://www.cs.ucr.edu/~eamonn/MERLIN_Long_version_for_website.pdf). In this issue, we would like to provide some ideas on...
[A recent paper](https://biblio.ugent.be/publication/8605188) dealing with the matrix profile has identified that > when comparing subsequences that are relatively flat and contain noise, the resulting distance is high despite the visual...
There is the [2018 VALMOD paper](https://helios2.mi.parisdescartes.fr/~themisp/publications/sigmod18-valmod.pdf) and, later the [2020 MAD paper](https://arxiv.org/pdf/2008.13447.pdf). VALMOD appears to be targeted towards motif discovery while MAD extends VALMOD and targets both Motif And Discord...
### Discussed in https://github.com/TDAmeritrade/stumpy/discussions/415 Originally posted by **udf2457** June 19, 2021 I was reading about MERLIN which was presented at ICDM 2020: - Matrix Profile XXI: MERLIN: Parameter-Free Discovery of...
Here is a recent paper titled ["Motif Density for Selecting Optimal Window Length in Motif Discovery"](http://www.infsoc.org/journal/vol11/IJIS_11_2_095-105.pdf) > Motif discovery is not only a fundamental method for finding repetitive subsequences in...
Now that `mpdist` has been implemented, it would be useful to have an `mpdist` tutorial The paper is [here](https://ueaeprints.uea.ac.uk/id/eprint/69244/1/ICDM_2018_Shaghayegh.pdf) The supporting website is [here](https://sites.google.com/site/mpdistinfo/) The goal of this tutorial would...
Demonstrate how to find the top-K motifs and top-K nearest neighbors in multi-dimensional data
# Pull Request Checklist Below is a simple checklist but please do not hesitate to ask for assistance! - [x] Fork, clone, and checkout the newest version of the code...
Metadata
Owner
Metadata
STUMPY is a powerful and scalable Python library for modern time series analysis