2010
DOI: 10.1016/j.datak.2010.05.002
|View full text |Cite
|
Sign up to set email alerts
|

Approximating sliding windows by cyclic tree-like histograms for efficient range queries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 58 publications
0
3
0
Order By: Relevance
“…In streaming data, especially stock data, one cannot assume that the past determinations of the discretization parameters will remain the same in the future since the distribution of the underlying data may change (see Section 4.2 on Concept Drift). One solution for this is to discretize over fixed and sliding time windows batch learning classifiers [32,33,66,84,204]. The idea is that when the underlying concept remains stable, the size of the window increases to allow for more data; when the concept drifts, the window shrinks.…”
Section: Discretizationmentioning
confidence: 99%
“…In streaming data, especially stock data, one cannot assume that the past determinations of the discretization parameters will remain the same in the future since the distribution of the underlying data may change (see Section 4.2 on Concept Drift). One solution for this is to discretize over fixed and sliding time windows batch learning classifiers [32,33,66,84,204]. The idea is that when the underlying concept remains stable, the size of the window increases to allow for more data; when the concept drifts, the window shrinks.…”
Section: Discretizationmentioning
confidence: 99%
“…The data being mined are now often in the form of streaming data [3,35,6], and an important problem in this area is that of detecting frequent items in a data stream. The problem of frequent item discovery in streaming data has attracted much attention, because it is relevant to many different applications across various domains [18,20,17].…”
Section: Introductionmentioning
confidence: 99%
“…In addition, the histogram approach shows a good capability of data extraction in order to get accurate values based on capacity and PSNR. 6,27 More specifically, 31 based on our experimental works, the performance of the DWT and DCT techniques are compared and observed by maintaining a good PSNR and embedding payload for the MR images. The histogram shifting 1 achieves good strategy and high quality of the stego image.…”
Section: Introductionmentioning
confidence: 99%