Optimal sampling from sliding windows

Abstract

APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are discarded in a stream. The sliding windows model is important for many applications (see, e.g., Babcock, Babu, Datar, Motwani and Widom (PODS 02); and Datar, Gionis, Indyk and Motwani (SODA 02)). There are two equally important types of the sliding windows model -windows with fixed size, (e.g., where items arrive one at a time, and only the most recent n items remain active for some fixed parameter n), and bursty windows (e.g., where many items can arrive in "bursts" at a single step and where only items from the last t steps remain active, again for some fixed parameter t).Random sampling is a fundamental tool for data streams, as numerous algorithms operate on the sampled data instead of on the entire stream. Effective sampling from sliding windows is a nontrivial problem, as elements eventually expire. In fact, the deletions are implicit; i.e., it is not possible to identify deleted elements without storing the entire window. The implicit nature of deletions on sliding windows does not allow the existing methods (even those that support explicit deletions, e.g., Cormode, Muthukrishnan and Rozenbaum (VLDB 05); Frahling, Indyk and Sohler (SOCG 05)) to be directly "translated" to the sliding windows model. One trivial approach to overcoming the problem of implicit deletions is that of over-sampling. When k samples are required, the over-sampling method maintains k > k samples in the hope that at least k samples are not expired. The obvious disadvantages of this method are twofold: (a) It introduces additional costs and thus decreases the performance; and (b) The memory bounds are not deterministic, which is atypical for * Supported in part by NSF grant 0830803

Predicting Decision-Making Time for Diagnosis over NGS Cycles: An Interpretable Machine Learning Approach

“…In principle, a sliding window model is applied for streams of data where only the most “recent” elements stay active, and the rest are discarded [Braverman et al ., 2009]. We used a fixed-time window model where data arrive in time order, and just the recent n elements are captured.…”

“…The advantage of the LSTM is that it overcomes the vanishing gradient problem [Hochreiter, 1998] of RNNs and is effective in capturing long-term temporal dependencies [Bengio et al ., 1994]. To address the speed-accuracy trade-off, we conceptualize the accumulated information with time-series analysis methods by defining a sliding window model [Braverman et al ., 2009] for making a prediction based on the available information from the intermediate stages. Furthermore, understanding the reasons behind predictions is crucial for assessing trust, which is fundamental in taking action based on a prediction, or in predictive model deployment [Ribeiro et al ., 2016].…”

ODN-Pro: An Improved Model Based on YOLOv8 for Enhanced Instance Detection in Orchard Point Clouds

“…This phenomenon can lead to the network erroneously recognizing one tree as multiple trees. To address this issue, we drew inspiration from the concept of a sliding window [45,46]. A sliding window is a fixed-size window that slides over the data sequence from beginning to end in certain steps.…”

Graphlet counting in massive networks

“…-Sliding window insertion-only streaming: In stream data mining, the scope of aggregation often needs to be restricted to include edges that have arrived within a recent window. To handle such cases, we present extensions of Fleet to the sliding window model [12,20,32]. We consider two types of sliding windows: 1) For a sequence-based window, defined as the set of W most recent edges in the stream for a window size parameter w, we present an algorithm FleetSSW.…”