Proceedings 2001 IEEE International Conference on Data Mining
DOI: 10.1109/icdm.2001.989531
|View full text |Cite
|
Sign up to set email alerts
|

An online algorithm for segmenting time series

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
664
0
10

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 778 publications
(675 citation statements)
references
References 15 publications
1
664
0
10
Order By: Relevance
“…Here, our primary objective was to demonstrate how model-based techniques are used for improving various aspects of query processing over sensor data. Lastly, we discussed data compression techniques, like, linear approximation [34,39,48], multi-model approximations [39,40,50] and orthogonal transformations [1,22,53,7].…”
Section: Discussionmentioning
confidence: 99%
See 4 more Smart Citations
“…Here, our primary objective was to demonstrate how model-based techniques are used for improving various aspects of query processing over sensor data. Lastly, we discussed data compression techniques, like, linear approximation [34,39,48], multi-model approximations [39,40,50] and orthogonal transformations [1,22,53,7].…”
Section: Discussionmentioning
confidence: 99%
“…The other two approaches perform better than the sliding window approach, but they need to scan all data, hence they cannot be used for approximating streaming data. Based on this observation, Keogh et al [34] propose a new algorithm that combines the online processing property of the sliding window approach and the performance of the bottomup approach. This approach needs a predefined buffer length.…”
Section: Methods For Data Segmentationmentioning
confidence: 99%
See 3 more Smart Citations