A unified scheme for generalizing cardinality estimators to sum aggregation
DOI10.1016/J.IPL.2014.10.009zbMATH Open1302.68306OpenAlexW2040494535MaRDI QIDQ477684FDOQ477684
Authors: Reuven Cohen, Liran Katzir, Aviv Yehezkel 
Publication date: 9 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.10.009
Recommendations
- A universal procedure for aggregating estimators
- Estimating the size of a union of random subsets of fixed cardinality
- Aggregation of affine estimators
- Optimal exponential bounds for aggregation of density estimators
- scientific article
- Aggregating estimates by convex optimization
- Linear and convex aggregation of density estimators
- Efficient estimation of the cardinality of large data sets
Nonparametric estimation (62G05) Software, source code, etc. for problems pertaining to statistics (62-04) Statistics of extreme values; tail inference (62G32) Order statistics; empirical distribution functions (62G30) General topics in the theory of algorithms (68W01)
Cites Work
- Title not available (Why is that?)
- Simulation and the Monte Carlo Method
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Size-estimation framework with applications to transitive closure and reachability
- Probabilistic counting algorithms for data base applications
- Handbook of Statistical Distributions with Applications
- Order statistics and estimating cardinalities of massive data sets
- Title not available (Why is that?)
- Efficient estimation of the cardinality of large data sets
- Estimating the number of Active Flows in a Data Stream over a Sliding Window
Uses Software
This page was built for publication: A unified scheme for generalizing cardinality estimators to sum aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477684)
