How many bins should be put in a regular histogram
ESAIM: Probability and Statistics, Tome 10 (2006), pp. 24-45.

Given an n-sample from some unknown density f on [0,1], it is easy to construct an histogram of the data based on some given partition of [0,1], but not so much is known about an optimal choice of the partition, especially when the data set is not large, even if one restricts to partitions into intervals of equal length. Existing methods are either rules of thumbs or based on asymptotic considerations and often involve some smoothness properties of f. Our purpose in this paper is to give an automatic, easy to program and efficient method to choose the number of bins of the partition from the data. It is based on bounds on the risk of penalized maximum likelihood estimators due to Castellan and heavy simulations which allowed us to optimize the form of the penalty function. These simulations show that the method works quite well for sample sizes as small as 25.

DOI : 10.1051/ps:2006001
Classification : 62E25, 62G05
Mots clés : regular histograms, density estimation, penalized maximum likelihood, model selection 
@article{PS_2006__10__24_0,
     author = {Birg\'e, Lucien and Rozenholc, Yves},
     title = {How many bins should be put in a regular histogram},
     journal = {ESAIM: Probability and Statistics},
     pages = {24--45},
     publisher = {EDP-Sciences},
     volume = {10},
     year = {2006},
     doi = {10.1051/ps:2006001},
     mrnumber = {2197101},
     zbl = {1136.62329},
     language = {en},
     url = {http://archive.numdam.org/articles/10.1051/ps:2006001/}
}
TY  - JOUR
AU  - Birgé, Lucien
AU  - Rozenholc, Yves
TI  - How many bins should be put in a regular histogram
JO  - ESAIM: Probability and Statistics
PY  - 2006
SP  - 24
EP  - 45
VL  - 10
PB  - EDP-Sciences
UR  - http://archive.numdam.org/articles/10.1051/ps:2006001/
DO  - 10.1051/ps:2006001
LA  - en
ID  - PS_2006__10__24_0
ER  - 
%0 Journal Article
%A Birgé, Lucien
%A Rozenholc, Yves
%T How many bins should be put in a regular histogram
%J ESAIM: Probability and Statistics
%D 2006
%P 24-45
%V 10
%I EDP-Sciences
%U http://archive.numdam.org/articles/10.1051/ps:2006001/
%R 10.1051/ps:2006001
%G en
%F PS_2006__10__24_0
Birgé, Lucien; Rozenholc, Yves. How many bins should be put in a regular histogram. ESAIM: Probability and Statistics, Tome 10 (2006), pp. 24-45. doi : 10.1051/ps:2006001. http://archive.numdam.org/articles/10.1051/ps:2006001/

[1] H. Akaike, A new look at the statistical model identification. IEEE Trans. Automatic Control 19 (1974) 716-723. | Zbl

[2] A.R. Barron, L. Birgé and P. Massart. Risk bounds for model selection via penalization. Probab. Theory Relat. Fields 113 (1999) 301-415. | Zbl

[3] L. Birgé and P. Massart, From model selection to adaptive estimation, in Festschrift for Lucien Le Cam: Research Papers in Probability and Statistics, D. Pollard, E. Torgersen and G. Yang, Eds., Springer-Verlag, New York (1997) 55-87. | Zbl

[4] L. Birgé and P. Massart, Gaussian model selection. J. Eur. Math. Soc. 3 (2001) 203-268. | Zbl

[5] G. Castellan, Modified Akaike's criterion for histogram density estimation. Technical Report. Université Paris-Sud, Orsay (1999).

[6] G. Castellan, Sélection d'histogrammes à l'aide d'un critère de type Akaike. CRAS 330 (2000) 729-732. | Zbl

[7] J. Daly, The construction of optimal histograms. Commun. Stat., Theory Methods 17 (1988) 2921-2931. | Zbl

[8] L. Devroye, A Course in Density Estimation. Birkhäuser, Boston (1987). | MR | Zbl

[9] L. Devroye, and L. Györfi, Nonparametric Density Estimation: The L 1 View. John Wiley, New York (1985). | MR | Zbl

[10] L. Devroye and G. Lugosi, Combinatorial Methods in Density Estimation. Springer-Verlag, New York (2001). | MR | Zbl

[11] D. Freedman and P. Diaconis, On the histogram as a density estimator: L 2 theory. Z. Wahrscheinlichkeitstheor. Verw. Geb. 57 (1981) 453-476. | Zbl

[12] P. Hall, Akaike's information criterion and Kullback-Leibler loss for histogram density estimation. Probab. Theory Relat. Fields 85 (1990) 449-467. | Zbl

[13] P. Hall and E.J. Hannan, On stochastic complexity and nonparametric density estimation. Biometrika 75 (1988) 705-714. | Zbl

[14] K. He and G. Meeden, Selecting the number of bins in a histogram: A decision theoretic approach. J. Stat. Plann. Inference 61 (1997) 49-59. | Zbl

[15] D.R.M. Herrick, G.P. Nason and B.W. Silverman, Some new methods for wavelet density estimation. Sankhya, Series A 63 (2001) 394-411.

[16] M.C. Jones, On two recent papers of Y. Kanazawa. Statist. Probab. Lett. 24 (1995) 269-271. | Zbl

[17] Y. Kanazawa, Hellinger distance and Akaike's information criterion for the histogram. Statist. Probab. Lett. 17 (1993) 293-298. | Zbl

[18] L.M. Le Cam, Asymptotic Methods in Statistical Decision Theory. Springer-Verlag, New York (1986). | MR | Zbl

[19] L.M. Le Cam and G.L. Yang, Asymptotics in Statistics: Some Basic Concepts. Second Edition. Springer-Verlag, New York (2000). | MR | Zbl

[20] J. Rissanen, Stochastic complexity and the MDL principle. Econ. Rev. 6 (1987) 85-102. | Zbl

[21] M. Rudemo, Empirical choice of histograms and kernel density estimators. Scand. J. Statist. 9 (1982) 65-78. | Zbl

[22] D.W. Scott, On optimal and databased histograms. Biometrika 66 (1979) 605-610. | Zbl

[23] H.A. Sturges, The choice of a class interval. J. Am. Stat. Assoc. 21 (1926) 65-66.

[24] C.C. Taylor, Akaike's information criterion and the histogram. Biometrika. 74 (1987) 636-639. | Zbl

[25] G.R. Terrell, The maximal smoothing principle in density estimation. J. Am. Stat. Assoc. 85 (1990) 470-477.

[26] M.P. Wand, Data-based choice of histogram bin width. Am. Statistician 51 (1997) 59-64.

Cité par Sources :