How many bins should be put in a regular histogram
From MaRDI portal
Recommendations
Cites work
- A new look at the statistical model identification
- Akaike's information criterion and Kullback-Leibler loss for histogram density estimation
- Akaike's information criterion and the histogram
- Asymptotic methods in statistical decision theory
- Asymptotics in statistics. Some basic concepts.
- Combinatorial methods in density estimation
- Gaussian model selection
- Hellinger distance and Akaike's information criterion for the histogram
- scientific article; zbMATH DE number 3870398 (Why is no real title available?)
- scientific article; zbMATH DE number 3789676 (Why is no real title available?)
- scientific article; zbMATH DE number 1064642 (Why is no real title available?)
- scientific article; zbMATH DE number 4001210 (Why is no real title available?)
- On optimal and data-based histograms
- On stochastic complexity and nonparametric density estimation
- On the histogram as a density estimator:L 2 theory
- On two recent papers of Y. Kanazawa
- Risk bounds for model selection via penalization
- Selecting the number of bins in a histogram: A decision theoretic approach
- Some new methods for wavelet density estimation
- Stochastic complexity and the mdl principle
- Sélection d'histogrammes à l'aide d'un critère de type Akaike
- The construction of optimal histograms
Cited in
(28)- Selecting the number of bins in a histogram: A decision theoretic approach
- Estimating the intensity of a random measure by histogram type estimators
- Iterated Bernstein operators for distribution function and density estimation: balancing between the number of iterations and the polynomial degree
- A new algorithm for fixed design regression and denoising
- Random rates in anisotropic regression. (With discussion)
- Cumulative distribution function estimation under interval censoring case 1
- Adaptive density estimation on bounded domains under mixing conditions
- Statistical estimation with model selection
- Combining regular and irregular histograms by penalized likelihood
- Model selection for density estimation with \(\mathbb L_2\)-loss
- Loda: lightweight on-line detector of anomalies
- Model selection for regression on a random design
- Penalized contrast estimator for adaptive density deconvolution
- Adaptive density estimation for general ARCH models
- Model selection for (auto-)regression with dependent data
- Adaptive estimation of a quadratic functional of a density by model selection
- False discovery rate control for grouped or discretely supported p-values with application to a neuroimaging study
- Adaptive quadratic functional estimation of a weighted density by model selection
- Finite sample penalization in adaptive density deconvolution
- Histogram selection in non Gaussian regression
- A comparison of automatic histogram constructions
- Some applications of concentration inequalities to statistics
- Fast and fully-automated histograms for large-scale data sets
- Nonparametric density estimation in presence of bias and censoring
- Deep tobit model: an integrated framework for high-dimensional censored regression with variable selection
- Adaptive density estimation: A curse of support?
- A hitchhiker's guide to information theoretical measures in psychology
- Random irregular histograms
This page was built for publication: How many bins should be put in a regular histogram
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373752)
