Skip to content

Commit

Permalink
add heading image and update readme to reflect top_k algorithms
Browse files Browse the repository at this point in the history
  • Loading branch information
tylerwmarrs committed May 21, 2019
1 parent 412d6a1 commit 9d7ee4b
Show file tree
Hide file tree
Showing 2 changed files with 15 additions and 0 deletions.
15 changes: 15 additions & 0 deletions README.md
@@ -1,3 +1,6 @@
[docs/images/stumpy_logo_small.png
<div style="text-align:center"><img src="docs/mass-logo.png" /></div>

MASS (Mueen's Algorithm for Similarity Search)
----------------------------------------------

Expand All @@ -23,6 +26,8 @@ Features

**Library Specific Algorithms**
* MASS2_batch - a batch version of MASS2 that reduces overall memory usage, provides parallelization and enables you to find top K number of matches within the time series. The goal of using this implementation is for very large time series similarity search.
* top_k_motifs - find the top K number of similar subsequences to your given query. It returns the starting index of the subsequence.
* top_k_discords - find the top K number of dissimilar subsequences to your given query. It returns the starting index of the subsequence.

Installation
------------
Expand Down Expand Up @@ -64,6 +69,16 @@ indices, distances = mts.mass2_batch(ts, query, batch_size,

# find minimum distance
min_idx = np.argmin(distances)

# find top 4 motif starting indices
k = 4
exclusion_zone = 25
top_motifs = mts.top_k_motifs(distances, k, exclusion_zone)

# find top 4 discord starting indices
k = 4
exclusion_zone = 25
top_discords = mts.top_k_discords(distances, k, exclusion_zone)
```

Citations
Expand Down
Binary file added docs/mass-logo.png
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.

0 comments on commit 9d7ee4b

Please sign in to comment.