2010
DOI: 10.1007/978-3-642-12145-6_12
|View full text |Cite
|
Sign up to set email alerts
|

HOT aSAX: A Novel Adaptive Symbolic Representation for Time Series Discords Discovery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(19 citation statements)
references
References 6 publications
0
13
0
Order By: Relevance
“…A more sophisticated way of handling the non-Gaussian distribution with SAX representation is to use adaptive breakpoints. 46 However, we found that the optimal solution for our data was to set breakpoints to values that separated scores into equal-sized bins (quantiles), thus satisfying SAX's expectation that any arbitrary score has an equal probability of being assigned to any of the bins. Another limitation of this study regards the single-site origins of the dataset.…”
Section: Discussionmentioning
confidence: 92%
“…A more sophisticated way of handling the non-Gaussian distribution with SAX representation is to use adaptive breakpoints. 46 However, we found that the optimal solution for our data was to set breakpoints to values that separated scores into equal-sized bins (quantiles), thus satisfying SAX's expectation that any arbitrary score has an equal probability of being assigned to any of the bins. Another limitation of this study regards the single-site origins of the dataset.…”
Section: Discussionmentioning
confidence: 92%
“…They introduce an adaptive window discord discovery (AWDD) to detect the anomaly in ECG recordings. It was developed from a brute force discord discovery (BFDD) algorithm [85]. The algorithm finds candidates with an abnormal heartbeat by selecting the largest Euclidean distance when comparing the heartbeats to each other.…”
Section: Model Trainingmentioning
confidence: 99%
“…For instance, HOT SAX algorithm [ 21 ] bases itself on the representation of symbolic aggregate approximation (SAX). The algorithm has shown a great potential for extending and applying to many other works [ 39 , 40 ].…”
Section: Related Workmentioning
confidence: 99%