2009
DOI: 10.1051/ps:2008005
|View full text |Cite
|
Sign up to set email alerts
|

A comparison of automatic histogram constructions

Abstract: Abstract. Even for a well-trained statistician the construction of a histogram for a given real-valued data set is a difficult problem. It is even more difficult to construct a fully automatic procedure which specifies the number and widths of the bins in a satisfactory manner for a wide range of data sets. In this paper we compare several histogram construction procedures by means of a simulation study. The study includes plug-in methods, cross-validation, penalized maximum likelihood and the taut string proc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 15 publications
(22 citation statements)
references
References 38 publications
(53 reference statements)
0
22
0
Order By: Relevance
“…Stochastic complexity is found using the normalized maximum likelihood distribution. In [28], the performance of 11 different bin selection criteria were analyzed, among them variants of AIC, BIC and MDL. Here, all the criteria were used to calculate the optimal number of bins for 19 different density shapes and real data.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Stochastic complexity is found using the normalized maximum likelihood distribution. In [28], the performance of 11 different bin selection criteria were analyzed, among them variants of AIC, BIC and MDL. Here, all the criteria were used to calculate the optimal number of bins for 19 different density shapes and real data.…”
Section: Related Workmentioning
confidence: 99%
“…Probably because of its prominence, approaches to bin selection for histograms are very popular, with many of the schemes deeply rooted in model selection theory [28,44]. Here, we consider histograms with equal bin width, also known as regular histograms.…”
Section: Case Study: Spherical MDL For Histogramsmentioning
confidence: 99%
“…the bin width δω can be found by applying an adequate algorithm that optimizes a given criterion (see e.g. Davies et al (2009)). This means that δω has an optimal value which depends on the MC data only.…”
Section: Discussionmentioning
confidence: 99%
“…Choosing M , in fact, corresponds to the well-studied, but nevertheless difficult, problem of choosing the number of bins in a regular histogram given a sample of data. Numerous approaches for solving this problem exist, see for example [20] and references therein.…”
Section: Parameter Choicesmentioning
confidence: 99%