Finding frequent items in data streams
From MaRDI portal
Recommendations
Cites work
- Fast, small-space algorithms for approximate histogram maintenance
- scientific article; zbMATH DE number 1301871 (Why is no real title available?)
- scientific article; zbMATH DE number 1305513 (Why is no real title available?)
- scientific article; zbMATH DE number 1424324 (Why is no real title available?)
- scientific article; zbMATH DE number 1445300 (Why is no real title available?)
- Space lower bounds for distance approximation in the data stream model
- The space complexity of approximating the frequency moments
Cited in
(69)- Identifying correlated heavy-hitters in a two-dimensional data stream
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Finding longest increasing and common subsequences in streaming data
- Space-efficient estimation of statistics over sub-sampled streams
- Competitive Analysis of Maintaining Frequent Items of a Stream
- Sparser Johnson-Lindenstrauss transforms
- Study of a discovery method for useful data items in distributed data streams
- Taylor polynomial estimator for estimating frequency moments
- Finding Frequent Items in a Turnstile Data Stream
- Finding Frequent Elements in Non-bursty Streams
- On Finding Frequent Elements in a Data Stream
- An efficient algorithm for mining approximate frequent item over data streams
- Estimating hybrid frequency moments of data streams
- Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
- Faster kernel ridge regression using sketching and preconditioning
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- Identifying frequent items in distributed data sets
- Space‐efficient tracking of persistent items in a massive data stream
- Mining frequent items in data stream using time fading model
- High probability frequency moment sketches
- Nearly optimal distinct elements and heavy hitters on sliding windows
- On low-risk heavy hitters and sparse recovery schemes
- Tight bounds for the subspace sketch problem with applications
- Tensor-structured sketching for constrained least squares
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- A Framework for Adversarially Robust Streaming Algorithms
- Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels
- Adversarially robust property-preserving hash functions
- Simple analyses of the sparse Johnson-Lindenstrauss transform
- On approximating matrix norms in data streams
- Database Theory - ICDT 2005
- Sketching for principal component regression
- Modeling support changes in streaming item sets
- Sparser Johnson-Lindenstrauss transforms
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
- Randomized numerical linear algebra: Foundations and algorithms
- Phase transition in count approximation by count-min sketch with conservative updates
- Randomized algorithms for the computation of multilinear rank-(_1,_2,_3) approximations
- Unbiased estimation of inner product via higher order count sketch
- Sketched approximation of regularized canonical correlation analysis
- Stochastic linear regularization methods: random discrepancy principle and applications
- \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams
- Forty years of frequent items
- Voting almost maximizes social welfare despite limited communication
- What's hot and what's not: tracking most frequent items dynamically
- Model counting meets \(F_0\) estimation
- Fast identification of heavy hitters by cached and packed group testing
- Count-min sketch with variable number of hash functions: an experimental study
- Sparsifying count sketch
- Improving compressed matrix multiplication using control variate method
- High-precision randomized preconditioned iterative methods for the random feature method
- Derandomization with pseudorandomness
- Fine-grained analysis and faster algorithms for iteratively solving linear systems
- Uniform approximation of vectors using adaptive randomized information
- Faster and space efficient indexing for locality sensitive hashing
- Randomized iterative methods for generalized absolute value equations: solvability and error bounds
- Low-rank approximation algorithm using sparse projection and its applications
- Randomized low-rank approximations beyond Gaussian random matrices
- Learning what to remember
- A very sketchy talk (invited talk)
- Separations for estimating large frequency moments on data streams
- RCLUPPr: a new randomized CholeskyQR with LU preconditioning
- Adaptive and non-adaptive randomized approximation of high-dimensional vectors
- Subspace Langevin Monte Carlo
- Minimizing recourse in an adaptive balls and bins game
- A general method for estimating correlated aggregates over a data stream
This page was built for publication: Finding frequent items in data streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884870)
