论文：Exact Discovery of Time Series Motifs

Speeded up Brute Force Motif Discovery:

Github：https://github.com/saifuddin778/mkalgo

但是感觉有一行比较奇怪，应该是 ，而不是，因为 是递增排列的，并且 best-so-far > 0.

Generalization to multiple reference points:

https://github.com/nicholasg3/motif-mining/tree/95bbb05ac5d0f9e90134a67a789ea7e607f22cea

注意：

for j = 1 to m-offset 而不是 for j = 1 to R

Time Series Clustering with Dynamic Time Warping (DTW)

https://github.com/goodmattg/wikipedia_kaggle