[KIRJA][B] Machine learning for data streams: with practical examples in MOA

A Bifet, R Gavalda, G Holmes, B Pfahringer - 2023 - books.google.com
A hands-on approach to tasks and techniques in data stream mining and real-time analytics,
with examples in MOA, a popular freely available open-source software framework. Today …

Synopses for massive data: Samples, histograms, wavelets, sketches

G Cormode, M Garofalakis, PJ Haas… - … and Trends® in …, 2011 - nowpublishers.com
Abstract Methods for Approximate Query Processing (AQP) are essential for dealing with
massive data. They are often the only means of providing interactive response times when …

Data streams: Algorithms and applications

S Muthukrishnan - Foundations and Trends® in Theoretical …, 2005 - nowpublishers.com
In the data stream scenario, input arrives very rapidly and there is limited memory to store
the input. Algorithms have to work with one or few passes over the data, space less than …

Stable distributions, pseudorandom generators, embeddings, and data stream computation

P Indyk - Journal of the ACM (JACM), 2006 - dl.acm.org
In this article, we show several results obtained by combining the use of stable distributions
with pseudorandom generators for bounded space. In particular:---We show that, for any …

Graph sketches: sparsification, spanners, and subgraphs

KJ Ahn, S Guha, A McGregor - Proceedings of the 31st ACM SIGMOD …, 2012 - dl.acm.org
When processing massive data sets, a core task is to construct synopses of the data. To be
useful, a synopsis data structure should be easy to construct while also yielding good …

Differentially private continual releases of streaming frequency moment estimations

A Epasto, J Mao, AM Medina, V Mirrokni… - arxiv preprint arxiv …, 2023 - arxiv.org
The streaming model of computation is a popular approach for working with large-scale
data. In this setting, there is a stream of items and the goal is to compute the desired …

[PDF][PDF] Sketch techniques for approximate query processing

G Cormode - Foundations and Trends in Databases …, 2011 - archive.dimacs.rutgers.edu
Sketch techniques have undergone extensive development within the past few years. They
are especially appropriate for the data streaming scenario, in which large quantities of data …

Tight bounds for adversarially robust streams and sliding windows via difference estimators

DP Woodruff, S Zhou - 2021 IEEE 62nd Annual Symposium on …, 2022 - ieeexplore.ieee.org
In the adversarially robust streaming model, a stream of elements is presented to an
algorithm and is allowed to depend on the output of the algorithm at earlier times during the …

Estimating pagerank on graph streams

AD Sarma, S Gollapudi, R Panigrahy - Journal of the ACM (JACM), 2011 - dl.acm.org
This article focuses on computations on large graphs (eg, the web-graph) where the edges
of the graph are presented as a stream. The objective in the streaming model is to use small …

Adversarially robust streaming algorithms via differential privacy

A Hasidim, H Kaplan, Y Mansour… - Advances in …, 2020 - proceedings.neurips.cc
A streaming algorithm is said to be adversarially robust if its accuracy guarantees are
maintained even when the data stream is chosen maliciously, by an adaptive adversary. We …