Finding frequent items in data streams
From MaRDI portal
Publication:1884870
DOI10.1016/S0304-3975(03)00400-6zbMath1071.68020WikidataQ59831030 ScholiaQ59831030MaRDI QIDQ1884870
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (39)
Randomized numerical linear algebra: Foundations and algorithms ⋮ Taylor Polynomial Estimator for Estimating Frequency Moments ⋮ A Framework for Adversarially Robust Streaming Algorithms ⋮ Sparser Johnson-Lindenstrauss Transforms ⋮ A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition ⋮ Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels ⋮ Faster Kernel Ridge Regression Using Sketching and Preconditioning ⋮ Phase transition in count approximation by count-min sketch with conservative updates ⋮ Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_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 ⋮ Estimating hybrid frequency moments of data streams ⋮ On deterministic sketching and streaming for sparse recovery and norm estimation ⋮ Voting almost maximizes social welfare despite limited communication ⋮ Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. ⋮ Sketching for Principal Component Regression ⋮ Identifying frequent items in distributed data sets ⋮ High Probability Frequency Moment Sketches ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ Identifying correlated heavy-hitters in a two-dimensional data stream ⋮ Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. ⋮ On Low-Risk Heavy Hitters and Sparse Recovery Schemes ⋮ Modeling support changes in streaming item sets ⋮ Unnamed Item ⋮ Finding longest increasing and common subsequences in streaming data ⋮ Unnamed Item ⋮ Fast randomized matrix and tensor interpolative decomposition using countsketch ⋮ A general method for estimating correlated aggregates over a data stream ⋮ Space‐efficient tracking of persistent items in a massive data stream ⋮ On Approximating Matrix Norms in Data Streams ⋮ Tight Bounds for the Subspace Sketch Problem with Applications ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares ⋮ Unnamed Item ⋮ Tensor-Structured Sketching for Constrained Least Squares ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching ⋮ Space-efficient estimation of statistics over sub-sampled streams
Cites Work
This page was built for publication: Finding frequent items in data streams
