# Histogram

Histogram
One of the Seven Basic Tools of Quality
First described byKarl Pearson
PurposeTo roughly assess the probability distribution of a given variable by depicting the frequencies of observations occurring in certain ranges of values.

A histogram is an approximate representation of the distribution of numerical or categorical data. It was first introduced by Karl Pearson.[1] To construct a histogram, the first step is to "bin" (or "bucket") the range of values—that is, divide the entire range of values into a series of intervals—and then count how many values fall into each interval. The bins are usually specified as consecutive, non-overlapping intervals of a variable. The bins (intervals) must be adjacent, and are often (but not required to be) of equal size.[2]

If the bins are of equal size, a rectangle is erected over the bin with height proportional to the frequency—the number of cases in each bin. A histogram may also be normalized to display "relative" frequencies. It then shows the proportion of cases that fall into each of several categories, with the sum of the heights equaling 1.

However, bins need not be of equal width; in that case, the erected rectangle is defined to have its area proportional to the frequency of cases in the bin.[3] The vertical axis is then not the frequency but frequency density—the number of cases per unit of the variable on the horizontal axis. Examples of variable bin width are displayed on Census bureau data below.

As the adjacent bins leave no gaps, the rectangles of a histogram touch each other to indicate that the original variable is continuous.[4]

Histograms give a rough sense of the density of the underlying distribution of the data, and often for density estimation: estimating the probability density function of the underlying variable. The total area of a histogram used for probability density is always normalized to 1. If the length of the intervals on the x-axis are all 1, then a histogram is identical to a relative frequency plot.

A histogram can be thought of as a simplistic kernel density estimation, which uses a kernel to smooth frequencies over the bins. This yields a smoother probability density function, which will in general more accurately reflect distribution of the underlying variable. The density estimate could be plotted as an alternative to the histogram, and is usually drawn as a curve rather than a set of boxes. Histograms are nevertheless preferred in applications, when their statistical properties need to be modeled. The correlated variation of a kernel density estimate is very difficult to describe mathematically, while it is simple for a histogram where each bin varies independently.

An alternative to kernel density estimation is the average shifted histogram,[5] which is fast to compute and gives a smooth curve estimate of the density without using kernels.

The histogram is one of the seven basic tools of quality control.[6]

Histograms are sometimes confused with bar charts. A histogram is used for continuous data, where the bins represent ranges of data, while a bar chart is a plot of categorical variables. Some authors recommend that bar charts have gaps between the rectangles to clarify the distinction.[7][8]

## Examples

This is the data for the histogram to the right, using 500 items:

Bin Count
−3.5 to −2.51 9
−2.5 to −1.51 32
−1.5 to −0.51 109
−0.5 to 0.49 180
0.5 to 1.49 132
1.5 to 2.49 34
2.5 to 3.49 4

The words used to describe the patterns in a histogram are: "symmetric", "skewed left" or "right", "unimodal", "bimodal" or "multimodal".

It is a good idea to plot the data using several different bin widths to learn more about it. Here is an example on tips given in a restaurant.

The U.S. Census Bureau found that there were 124 million people who work outside of their homes.[9] Using their data on the time occupied by travel to work, the table below shows the absolute number of people who responded with travel times "at least 30 but less than 35 minutes" is higher than the numbers for the categories above and below it. This is likely due to people rounding their reported journey time.[citation needed] The problem of reporting values as somewhat arbitrarily rounded numbers is a common phenomenon when collecting data from people.[citation needed]

Histogram of travel time (to work), US 2000 census. Area under the curve equals the total number of cases. This diagram uses Q/width from the table.
Data by absolute numbers
Interval Width Quantity Quantity/width
0 5 4180 836
5 5 13687 2737
10 5 18618 3723
15 5 19634 3926
20 5 17981 3596
25 5 7190 1438
30 5 16369 3273
35 5 3212 642
40 5 4122 824
45 15 9200 613
60 30 6461 215
90 60 3435 57

This histogram shows the number of cases per unit interval as the height of each block, so that the area of each block is equal to the number of people in the survey who fall into its category. The area under the curve represents the total number of cases (124 million). This type of histogram shows absolute numbers, with Q in thousands.

Data by proportion
Interval Width Quantity (Q) Q/total/width
0 5 4180 0.0067
5 5 13687 0.0221
10 5 18618 0.0300
15 5 19634 0.0316
20 5 17981 0.0290
25 5 7190 0.0116
30 5 16369 0.0264
35 5 3212 0.0052
40 5 4122 0.0066
45 15 9200 0.0049
60 30 6461 0.0017
90 60 3435 0.0005

This histogram differs from the first only in the vertical scale. The area of each block is the fraction of the total that each category represents, and the total area of all the bars is equal to 1 (the fraction meaning "all"). The curve displayed is a simple density estimate. This version shows proportions, and is also known as a unit area histogram.

In other words, a histogram represents a frequency distribution by means of rectangles whose widths represent class intervals and whose areas are proportional to the corresponding frequencies: the height of each is the average frequency density for the interval. The intervals are placed together in order to show that the data represented by the histogram, while exclusive, is also contiguous. (E.g., in a histogram it is possible to have two connecting intervals of 10.5–20.5 and 20.5–33.5, but not two connecting intervals of 10.5–20.5 and 22.5–32.5. Empty intervals are represented as empty and not skipped.)[10]

## Mathematical definition

An ordinary and a cumulative histogram of the same data. The data shown is a random sample of 10,000 points from a normal distribution with a mean of 0 and a standard deviation of 1.

In a more general mathematical sense, a histogram is a function mi that counts the number of observations that fall into each of the disjoint categories (known as bins), whereas the graph of a histogram is merely one way to represent a histogram. Thus, if we let n be the total number of observations and k be the total number of bins, the histogram mi meets the following conditions:

${\displaystyle n=\sum _{i=1}^{k}{m_{i}}.}$

### Cumulative histogram

A cumulative histogram is a mapping that counts the cumulative number of observations in all of the bins up to the specified bin. That is, the cumulative histogram Mi of a histogram mj is defined as:

${\displaystyle M_{i}=\sum _{j=1}^{i}{m_{j}}.}$

### Number of bins and width

There is no "best" number of bins, and different bin sizes can reveal different features of the data. Grouping data is at least as old as Graunt's work in the 17th century, but no systematic guidelines were given[11] until Sturges's work in 1926.[12]

Using wider bins where the density of the underlying data points is low reduces noise due to sampling randomness; using narrower bins where the density is high (so the signal drowns the noise) gives greater precision to the density estimation. Thus varying the bin-width within a histogram can be beneficial. Nonetheless, equal-width bins are widely used.

Some theoreticians have attempted to determine an optimal number of bins, but these methods generally make strong assumptions about the shape of the distribution. Depending on the actual data distribution and the goals of the analysis, different bin widths may be appropriate, so experimentation is usually needed to determine an appropriate width. There are, however, various useful guidelines and rules of thumb.[13]

The number of bins k can be assigned directly or can be calculated from a suggested bin width h as:

${\displaystyle k=\left\lceil {\frac {\max x-\min x}{h}}\right\rceil .}$

The braces indicate the ceiling function.

#### Square-root choice

${\displaystyle k=\lceil {\sqrt {n}}\rceil \,}$

which takes the square root of the number of data points in the sample (used by Excel histograms and many other) and rounds to the next integer.[14]

#### Sturges' formula

Sturges' formula[12] is derived from a binomial distribution and implicitly assumes an approximately normal distribution.

${\displaystyle k=\lceil \log _{2}n\rceil +1,\,}$

It implicitly bases the bin sizes on the range of the data and can perform poorly if n < 30, because the number of bins will be small—less than seven—and unlikely to show trends in the data well. It may also perform poorly if the data are not normally distributed.

#### Rice Rule

${\displaystyle k=\lceil 2{\sqrt[{3}]{n}}\rceil ,}$

The Rice Rule [15] is presented as a simple alternative to Sturges's rule.

#### Doane's formula

Doane's formula[16] is a modification of Sturges' formula which attempts to improve its performance with non-normal data.

${\displaystyle k=1+\log _{2}(n)+\log _{2}\left(1+{\frac {|g_{1}|}{\sigma _{g_{1}}}}\right)}$

where ${\displaystyle g_{1}}$ is the estimated 3rd-moment-skewness of the distribution and

${\displaystyle \sigma _{g_{1}}={\sqrt {\frac {6(n-2)}{(n+1)(n+3)}}}}$

#### Scott's normal reference rule

${\displaystyle h={\frac {3.49{\hat {\sigma }}}{\sqrt[{3}]{n}}},}$

where ${\displaystyle {\hat {\sigma }}}$ is the sample standard deviation. Scott's normal reference rule[17] is optimal for random samples of normally distributed data, in the sense that it minimizes the integrated mean squared error of the density estimate.[11]

#### Freedman–Diaconis' choice

${\displaystyle h=2{\frac {\operatorname {IQR} (x)}{\sqrt[{3}]{n}}},}$

which is based on the interquartile range, denoted by IQR. It replaces 3.5σ of Scott's rule with 2 IQR, which is less sensitive than the standard deviation to outliers in data.

#### Minimizing cross-validation estimated squared error

This approach of minimizing integrated mean squared error from Scott's rule can be generalized beyond normal distributions, by using leave-one out cross validation:[19][20]

${\displaystyle {\underset {h}{\operatorname {arg\,min} }}{\hat {J}}(h)={\underset {h}{\operatorname {arg\,min} }}\left({\frac {2}{(n-1)h}}-{\frac {n+1}{n^{2}(n-1)h}}\sum _{k}N_{k}^{2}\right)}$

Here, ${\displaystyle N_{k}}$ is the number of datapoints in the kth bin, and choosing the value of h that minimizes J will minimize integrated mean squared error.

#### Shimazaki and Shinomoto's choice

The choice is based on minimization of an estimated L2 risk function[21]

${\displaystyle {\underset {h}{\operatorname {arg\,min} }}{\frac {2{\bar {m}}-v}{h^{2}}}}$

where ${\displaystyle \textstyle {\bar {m}}}$ and ${\displaystyle \textstyle v}$ are mean and biased variance of a histogram with bin-width ${\displaystyle \textstyle h}$, ${\displaystyle \textstyle {\bar {m}}={\frac {1}{k}}\sum _{i=1}^{k}m_{i}}$ and ${\displaystyle \textstyle v={\frac {1}{k}}\sum _{i=1}^{k}(m_{i}-{\bar {m}})^{2}}$.

#### Variable bin widths

Rather than choosing evenly spaced bins, for some applications it is preferable to vary the bin width. This avoids bins with low counts. A common case is to choose equiprobable bins, where the number of samples in each bin is expected to be approximately equal. The bins may be chosen according to some known distribution or may be chosen based on the data so that each bin has ${\displaystyle \approx n/k}$ samples. When plotting the histogram, the frequency density is used for the dependent axis. While all bins have approximately equal area, the heights of the histogram approximate the density distribution.

For equiprobable bins, the following rule for the number of bins is suggested:[22]

${\displaystyle k=2n^{2/5}}$

This choice of bins is motivated by maximizing the power of a Pearson chi-squared test testing whether the bins do contain equal numbers of samples. More specifically, for a given confidence interval ${\displaystyle \alpha }$ it is recommended to choose between 1/2 and 1 times the following equation:[23]

${\displaystyle k=4\left({\frac {2n^{2}}{\Phi ^{-1}(\alpha )}}\right)^{\frac {1}{5}}}$

Where ${\displaystyle \Phi ^{-1}}$ is the probit function. Following this rule for ${\displaystyle \alpha =0.05}$ would give between ${\displaystyle 1.88n^{2/5}}$ and ${\displaystyle 3.77n^{2/5}}$; the coefficient of 2 is chosen as an easy-to-remember value from this broad optimum.

#### Remark

A good reason why the number of bins should be proportional to ${\displaystyle {\sqrt[{3}]{n}}}$ is the following: suppose that the data are obtained as ${\displaystyle n}$ independent realizations of a bounded probability distribution with smooth density. Then the histogram remains equally "rugged" as ${\displaystyle n}$ tends to infinity. If ${\displaystyle s}$ is the "width" of the distribution (e. g., the standard deviation or the inter-quartile range), then the number of units in a bin (the frequency) is of order ${\displaystyle nh/s}$ and the relative standard error is of order ${\displaystyle {\sqrt {s/(nh)}}}$. Comparing to the next bin, the relative change of the frequency is of order ${\displaystyle h/s}$ provided that the derivative of the density is non-zero. These two are of the same order if ${\displaystyle h}$ is of order ${\displaystyle s/{\sqrt[{3}]{n}}}$, so that ${\displaystyle k}$ is of order ${\displaystyle {\sqrt[{3}]{n}}}$. This simple cubic root choice can also be applied to bins with non-constant width.

Histogram and density function for a Gumbel distribution [24]

## References

1. ^ Pearson, K. (1895). "Contributions to the Mathematical Theory of Evolution. II. Skew Variation in Homogeneous Material" (PDF). Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. 186: 343–414. Bibcode:1895RSPTA.186..343P. doi:10.1098/rsta.1895.0010.
2. ^ Howitt, D.; Cramer, D. (2008). Introduction to Statistics in Psychology (Fourth ed.). Prentice Hall. ISBN 978-0-13-205161-3.
3. ^ Freedman, D.; Pisani, R.; Purves, R. (1998). Statistics (Third ed.). W. W. Norton. ISBN 978-0-393-97083-8.
4. ^ Charles Stangor (2011) "Research Methods For The Behavioral Sciences". Wadsworth, Cengage Learning. ISBN 9780840031976.
5. ^ David W. Scott (December 2009). "Averaged shifted histogram". Wiley Interdisciplinary Reviews: Computational Statistics. 2:2 (2): 160–164. doi:10.1002/wics.54.
6. ^ Nancy R. Tague (2004). "Seven Basic Quality Tools". The Quality Toolbox. Milwaukee, Wisconsin: American Society Quality. p. 15. Retrieved 2010-02-05.
7. ^ Naomi, Robbins. "A Histogram is NOT a Bar Chart". Forbes.com. Forbes. Retrieved 31 July 2018.
8. ^ M. Eileen Magnello (December 2006). "Karl Pearson and the Origins of Modern Statistics: An Elastician becomes a Statistician". The New Zealand Journal for the History and Philosophy of Science and Technology. 1 volume. OCLC 682200824.
9. ^
10. ^ Dean, S., & Illowsky, B. (2009, February 19). Descriptive Statistics: Histogram. Retrieved from the Connexions Web site: http://cnx.org/content/m16298/1.11/
11. ^ a b c Scott, David W. (1992). Multivariate Density Estimation: Theory, Practice, and Visualization. New York: John Wiley.CS1 maint: ref=harv (link)
12. ^ a b Sturges, H. A. (1926). "The choice of a class interval". Journal of the American Statistical Association. 21 (153): 65–66. doi:10.1080/01621459.1926.10502161. JSTOR 2965501.
13. ^ e.g. § 5.6 "Density Estimation", W. N. Venables and B. D. Ripley, Modern Applied Statistics with S (2002), Springer, 4th edition. ISBN 0-387-95457-0.
14. ^
15. ^ Online Statistics Education: A Multimedia Course of Study (http://onlinestatbook.com/). Project Leader: David M. Lane, Rice University (chapter 2 "Graphing Distributions", section "Histograms")
16. ^ Doane DP (1976) Aesthetic frequency classification. American Statistician, 30: 181–183
17. ^ Scott, David W. (1979). "On optimal and data-based histograms". Biometrika. 66 (3): 605–610. doi:10.1093/biomet/66.3.605.
18. ^ Freedman, David; Diaconis, P. (1981). "On the histogram as a density estimator: L2 theory" (PDF). Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete. 57 (4): 453–476. CiteSeerX 10.1.1.650.2473. doi:10.1007/BF01025868.
19. ^ Wasserman, Larry (2004). All of Statistics. New York: Springer. p. 310. ISBN 978-1-4419-2322-6.
20. ^ Stone, Charles J. (1984). "An asymptotically optimal histogram selection rule" (PDF). Proceedings of the Berkeley conference in honor of Jerzy Neyman and Jack Kiefer.
21. ^ Shimazaki, H.; Shinomoto, S. (2007). "A method for selecting the bin size of a time histogram". Neural Computation. 19 (6): 1503–1527. CiteSeerX 10.1.1.304.6404. doi:10.1162/neco.2007.19.6.1503. PMID 17444758.
22. ^ Jack Prins; Don McCormack; Di Michelson; Karen Horrell. "Chi-square goodness-of-fit test". NIST/SEMATECH e-Handbook of Statistical Methods. NIST/SEMATECH. p. 7.2.1.1. Retrieved 29 March 2019.
23. ^ Moore, David (1986). "3". In D'Agostino, Ralph; Stephens, Michael (eds.). Goodness-of-Fit Techniques. New York, NY, USA: Marcel Dekker Inc. p. 70. ISBN 0-8247-7487-6.
24. ^ A calculator for probability distributions and density functions
25. ^ An illustration of histograms and probability density functions