Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix typo in SAX algorithm page #1

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix typo in SAX algorithm page #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/morea/algorithm/SAX.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ morea_labels:
### Introduction
In short, Symbolic Aggregate approXimation (SAX) algorithm application to the input time series transforms its into a strings.

The algoithm was proposed by [Lin et al.](http://www.cs.ucr.edu/~eamonn/SAX.htm)) and extends the PAA-based approach inheriting the original algorithm simplicity and low computational complexity while providing satisfactory sensitivity and selectivity in range query processing. Moreover, the use of a symbolic representation opened a door to the existing wealth of data-structures and string-manipulation algorithms in computer science such as hashing, regular expression, pattern matching, suffix trees, and [grammatical inference](http://grammarviz2.github.io/grammarviz2_site/).
The algorithm was proposed by [Lin et al.](http://www.cs.ucr.edu/~eamonn/SAX.htm)) and extends the PAA-based approach inheriting the original algorithm simplicity and low computational complexity while providing satisfactory sensitivity and selectivity in range query processing. Moreover, the use of a symbolic representation opened a door to the existing wealth of data-structures and string-manipulation algorithms in computer science such as hashing, regular expression, pattern matching, suffix trees, and [grammatical inference](http://grammarviz2.github.io/grammarviz2_site/).

### The algorithm
SAX transforms a time-series *X* of length *n* into the string of arbitrary length \\(\omega\\), where \\(\omega << n\\) typically, using an alphabet *A* of size *a > 2*. The algorithm consist of two steps: (i) it transforms the original time-series into the [PAA representation](PAA.html) and (ii) it converts the PAA data into a string.
Expand Down Expand Up @@ -137,4 +137,4 @@ SAX transform of ts2 into string through 9-points PAA: "abbccddba"

SAX distance: 0 + 0 + 0.67 + 0 + 0 + 0 + 0.67 + 0 + 0 = 1.34

_At the plot, orange color depicts symbols distance between which is counted - they are not "adjacent" to each other in the table._
_At the plot, orange color depicts symbols distance between which is counted - they are not "adjacent" to each other in the table._