{"id":1409,"date":"2013-11-24T17:58:06","date_gmt":"2013-11-24T17:58:06","guid":{"rendered":"http:\/\/www.blopig.com\/blog\/?p=1409"},"modified":"2013-11-25T11:28:21","modified_gmt":"2013-11-25T11:28:21","slug":"how-many-bins","status":"publish","type":"post","link":"https:\/\/www.blopig.com\/blog\/2013\/11\/how-many-bins\/","title":{"rendered":"How many bins?"},"content":{"rendered":"

As it’s known in non-parametric kernel density estimation the effect of the bandwidth on the estimated density is large and it is usually the parameter who makes the tradeoff between bias and roughness of the estimation (Jones et.al 1996). An analogous problem for histograms is the choice of the bin length and in cases of equal bin lengths the problem can be seen as finding the number of bins to use. \u00a0A data-base methodology for building equal bin-length histograms proposed by (Knuth 2013) based on the marginal of the joint posterior of the number of bins and heights of the bins. To build the histogram first the number of bins has to be selected as the the value (\"\hat{M}) that maximises the following posterior distribution for the number of bins:
\n\"P(M|d,I)\,<\/p>\n

where \"M\" is the number of bins, \"d\" is the data, \"I\" is prior knowledge about the problem, i.e. in particular the use of equal length bins and the range of data \"V\", which has the relation \"V=Mw\" where \"w\" is the width of bins, \"N\" is the number of data points and \"n_k\" is the number of observations that fall in the \"k\"th\u00a0<\/span>bin.<\/p>\n

Now, the height (\"h_k\") of the bins of the histogram is given by:
\n\"h_k=\frac{M}{V}.<\/p>\n

In the case of a normal distribution the authors suggest a sample of 150 data points to “accurately and consistently estimate the shape of the distribution”.<\/p>\n

The following figure shows the relative log-posterior of the number of bins (left) and the estimated histogram for a mixture of three normal samples and a uniform [0,50] (right).<\/p>\n

\"Optimal<\/a><\/p>\n

\n

Knuth, K. H. (2013). Optimal data-based binning for histograms. arXiv preprint\u00a0physics\/0605197. The first version of this paper was published on 2006.<\/p>\n

\n

Jones, M. C., Marron, J. S., and Sheather, S. J. (1996). A brief survey of bandwidth selection for density estimation. Journal of the American Statistical Association,91(433), 401\u2013407.<\/p>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

As it’s known in non-parametric kernel density estimation the effect of the bandwidth on the estimated density is large and it is usually the parameter who makes the tradeoff between bias and roughness of the estimation (Jones et.al 1996). An analogous problem for histograms is the choice of the bin length and in cases of […]<\/p>\n","protected":false},"author":26,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"nf_dc_page":"","wikipediapreview_detectlinks":true,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"ngg_post_thumbnail":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[10],"tags":[],"ppma_author":[514],"class_list":["post-1409","post","type-post","status-publish","format-standard","hentry","category-groupmeetings"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"authors":[{"term_id":514,"user_id":26,"is_guest":0,"slug":"luis","display_name":"Luis Ospina Forero","avatar_url":"https:\/\/secure.gravatar.com\/avatar\/310cef32cd5dac5a383fe35d2e6fa0ed40cb03d0712d2b5a5ef81092db812b3e?s=96&d=mm&r=g","0":null,"1":"","2":"","3":"","4":"","5":"","6":"","7":"","8":""}],"_links":{"self":[{"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/posts\/1409","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/users\/26"}],"replies":[{"embeddable":true,"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/comments?post=1409"}],"version-history":[{"count":10,"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/posts\/1409\/revisions"}],"predecessor-version":[{"id":1427,"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/posts\/1409\/revisions\/1427"}],"wp:attachment":[{"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/media?parent=1409"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/categories?post=1409"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/tags?post=1409"},{"taxonomy":"author","embeddable":true,"href":"https:\/\/www.blopig.com\/blog\/wp-json\/wp\/v2\/ppma_author?post=1409"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}