Fast and fully-automated histograms for large-scale data sets
From MaRDI portal
Publication:6167056
DOI10.1016/j.csda.2022.107668arXiv2212.13524OpenAlexW4311989047MaRDI QIDQ6167056
Fabrice Rossi, Valentina Zelaya Mendizábal, Marc Boullé
Publication date: 7 July 2023
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.13524
Cites Work
- Unnamed Item
- Unnamed Item
- The Essential Histogram
- Optimal cross-validation in density estimation with the \(L^{2}\)-loss
- MODL: a Bayes optimal discretization method for continuous attributes
- Nonparametric density estimation by exact leave-\(p\)-out cross-validation
- A universal prior for integers and estimation by minimum description length
- Stochastic complexity and modeling
- Akaike's information criterion and Kullback-Leibler loss for histogram density estimation
- Modeling by shortest data description
- Estimating the dimension of a model
- On asymptotics of certain recurrences arising in universal coding
- Densities, spectral densities and modality.
- A linear-time algorithm for computing the multinomial stochastic complexity
- Combining regular and irregular histograms by penalized likelihood
- On optimal and data-based histograms
- On the approximation of curves by line segments using dynamic programming
- Identifying excessively rounded or truncated data
- How many bins should be put in a regular histogram
- Akaike's information criterion and the histogram
- An optimal variable cell histogram
- On stochastic complexity and nonparametric density estimation
- On the histogram as a density estimator:L 2 theory
- Density estimation by stochastic complexity
- The Efficiency of Histogram-like Techniques for Database Query Optimization
- Strong optimality of the normalized ML models as universal codes and information in data
- A comparison of automatic histogram constructions
This page was built for publication: Fast and fully-automated histograms for large-scale data sets
