Median

This article is about the statistical concept. For other uses, see Median (disambiguation).

In statistics and probability theory, a median is the number separating the higher half of a data sample, a population, or a probability distribution, from the lower half. The median of a finite list of numbers can be found by arranging all the observations from lowest value to highest value and picking the middle one (e.g., the median of {3, 3, 5, 9, 11} is 5). If there is an even number of observations, then there is no single middle value; the median is then usually defined to be the mean of the two middle values (the median of {3, 5, 7, 9} is (5 + 7) / 2 = 6), which corresponds to interpreting the median as the fully trimmed mid-range. The median is of central importance in robust statistics, as it is the most resistant statistic, having a breakdown point of 50%: so long as no more than half the data are contaminated, the median will not give an arbitrarily large result. A median is only defined on ordered one-dimensional data, and is independent of any distance metric. A geometric median, on the other hand, is defined in any number of dimensions.

In a sample of data, or a finite population, there may be no member of the sample whose value is identical to the median (in the case of an even sample size); if there is such a member, there may be more than one so that the median may not uniquely identify a sample member. Nonetheless, the value of the median is uniquely determined with the usual definition. A related concept, in which the outcome is forced to correspond to a member of the sample, is the medoid. At most, half the population have values strictly less than the median, and, at most, half have values strictly greater than the median. If each group contains less than half the population, then some of the population is exactly equal to the median. For example, if a < b < c, then the median of the list {a, b, c} is b, and, if a < b < c < d, then the median of the list {a, b, c, d} is the mean of b and c; i.e., it is (b + c)/2.

The median can be used as a measure of location when a distribution is skewed, when end-values are not known, or when one requires reduced importance to be attached to outliers, e.g., because they may be measurement errors.

In terms of notation, some authors represent the median of a variable x either as x͂ or as μ_1/2 sometimes also M. There is no widely accepted standard notation for the median, so the use of these or other symbols for the median needs to be explicitly defined when they are introduced.

The median is the 2nd quartile, 5th decile, and 50th percentile.

Measures of location and dispersion

The median is one of a number of ways of summarising the typical values associated with members of a statistical population; thus, it is a possible location parameter. Since the median is the same as the second quartile, its calculation is illustrated in the article on quartiles.

When the median is used as a location parameter in descriptive statistics, there are several choices for a measure of variability: the range, the interquartile range, the mean absolute deviation, and the median absolute deviation.

For practical purposes, different measures of location and dispersion are often compared on the basis of how well the corresponding population values can be estimated from a sample of data. The median, estimated using the sample median, has good properties in this regard. While it is not usually optimal if a given population distribution is assumed, its properties are always reasonably good. For example, a comparison of the efficiency of candidate estimators shows that the sample mean is more statistically efficient than the sample median when data are uncontaminated by data from heavy-tailed distributions or from mixtures of distributions, but less efficient otherwise, and that the efficiency of the sample median is higher than that for a wide range of distributions. More specifically, the median has a 64% efficiency compared to the minimum-variance mean (for large normal samples), which is to say the variance of the median will be ~50% greater than the variance of the mean—see Efficiency (statistics)#Asymptotic efficiency and references therein.

Probability distributions

Geometric visualisation of the mode, median and mean of an arbitrary probability density function.

For any probability distribution on the real line R with cumulative distribution function F, regardless of whether it is any kind of continuous probability distribution, in particular an absolutely continuous distribution (which has a probability density function), or a discrete probability distribution, a median is by definition any real number m that satisfies the inequalities

$\operatorname {P} (X\leq m)\geq {\frac {1}{2}}{\text{ and }}\operatorname {P} (X\geq m)\geq {\frac {1}{2}}\,\!$

or, equivalently, the inequalities

$\int _{(-\infty ,m]}dF(x)\geq {\frac {1}{2}}{\text{ and }}\int _{[m,\infty )}dF(x)\geq {\frac {1}{2}}\,\!$

in which a Lebesgue–Stieltjes integral is used. For an absolutely continuous probability distribution with probability density function ƒ, the median satisfies

$\operatorname {P} (X\leq m)=\operatorname {P} (X\geq m)=\int _{-\infty }^{m}f(x)\,dx={\frac {1}{2}}.\,\!$

Any probability distribution on R has at least one median, but there may be more than one median. Where exactly one median exists, statisticians speak of "the median" correctly; even when the median is not unique, some statisticians speak of "the median" informally.

Medians of particular distributions

The medians of certain types of distributions can be easily calculated from their parameters; furthermore, they exist even for some distributions lacking a well-defined mean, such as the Cauchy distribution:

• The median of a symmetric distribution which possesses a mean μ also takes the value μ.
  • The median of a normal distribution with mean μ and variance σ² is μ. In fact, for a normal distribution, mean = median = mode.
  • The median of a uniform distribution in the interval [a, b] is (a + b) / 2, which is also the mean.
• The median of a Cauchy distribution with location parameter x₀ and scale parameter y is x₀, the location parameter.
• The median of a Power law distribution x^-a, with exponent a > 1 is 2^{1/(a - 1)}x_min, where x_min is the minimum value for which the power law holds
• The median of an exponential distribution with rate parameter λ is the natural logarithm of 2 divided by the rate parameter: λ⁻¹ln 2.
• The median of a Weibull distribution with shape parameter k and scale parameter λ is λ(ln 2)^1/k.

Descriptive statistics

Comparison of mean, median and mode of two log-normal distributions with different skewness.

The median is used primarily for skewed distributions, which it summarizes differently from the arithmetic mean. Consider the multiset { 1, 2, 2, 2, 3, 14 }. The median is 2 in this case, (as is the mode), and it might be seen as a better indication of central tendency (less susceptible to the exceptionally large value in data) than the arithmetic mean of 4.

Calculation of medians is a popular technique in summary statistics and summarizing statistical data, since it is simple to understand and easy to calculate, while also giving a measure that is more robust in the presence of outlier values than is the mean. The widely-cited empirical relationship between the relative locations of the mean and the median for skewed distributions is, however, not generally true. There are, however, various relationships for the absolute difference between them; see below.

Populations

Optimality property

The mean absolute error of a real variable c with respect to the random variable X is

$E(\left|X-c\right|)\,$

Provided that the probability distribution of X is such that the above expectation exists, then m is a median of X if and only if m is a minimizer of the mean absolute error with respect to X. In particular, m is a sample median if and only if m minimizes the arithmetic mean of the absolute deviations.

See also k-medians clustering.

Unimodal distributions

It can be shown for a unimodal distribution that the median ${\tilde {X}}$ and the mean ${\bar {X}}$ lie within (3/5)^1/2 ≈ 0.7746 standard deviations of each other. In symbols,

${\frac {\left|{\tilde {X}}-{\bar {X}}\right|}{\sigma }}\leq (3/5)^{1/2}$

where |.| is the absolute value.

A similar relation holds between the median and the mode: they lie within 3^1/2 ≈ 1.732 standard deviations of each other:

${\frac {\left|{\tilde {X}}-\mathrm {mode} \right|}{\sigma }}\leq 3^{1/2}.$

Inequality relating means and medians

If the distribution has finite variance, then the distance between the median and the mean is bounded by one standard deviation.

This bound was proved by Mallows, who used Jensen's inequality twice, as follows. We have

${\begin{aligned}\left|\mu -m\right|=\left|\mathrm {E} (X-m)\right|&\leq \mathrm {E} \left(\left|X-m\right|\right)\\&\leq \mathrm {E} \left(\left|X-\mu \right|\right)\\&\leq {\sqrt {\mathrm {E} ((X-\mu )^{2})}}=\sigma .\end{aligned}}$

The first and third inequalities come from Jensen's inequality applied to the absolute-value function and the square function, which are each convex. The second inequality comes from the fact that a median minimizes the absolute deviation function

$a\mapsto \mathrm {E} (\left|X-a\right|).\,$

This proof can easily be generalized to obtain a multivariate version of the inequality, as follows:

${\begin{aligned}\left\|\mu -m\right\|=\left\|\mathrm {E} (X-m)\right\|&\leq \mathrm {E} \|X-m\|\\&\leq \mathrm {E} (\left\|X-\mu \right\|)\\&\leq {\sqrt {\mathrm {E} (\|X-\mu \|^{2})}}={\sqrt {\mathrm {trace} (\mathrm {var} (X))}}\end{aligned}}$

where m is a spatial median, that is, a minimizer of the function $a\mapsto \mathrm {E} (\left\|X-a\right\|).\,$ The spatial median is unique when the data-set's dimension is two or more. An alternative proof uses the one-sided Chebyshev inequality; it appears in an inequality on location and scale parameters.

Jensen's inequality for medians

Jensen's inequality states that for any random variable x with a finite expectation E(x) and for any convex function f

$f(E(x))\leq E(f(x))$

It has been shown that if x is a real variable with a unique median m and f is a C function then

$f(m)\leq \operatorname {Median} (f(x))$

A C function is a real valued function, defined on the set of real numbers R, with the property that for any real t

$f^{-1}((-\infty ,t])=\{x\in R\mid f(x)\leq t\}$

is a closed interval, a singleton or an empty set.

Medians for samples

The sample median

Efficient computation of the sample median

Even though comparison-sorting n items requires Ω(n log n) operations, selection algorithms can compute the k'th-smallest of n items with only Θ(n) operations. This includes the median, which is the ⁠n/2⁠'th order statistic (or for an even number of samples, the average of the two middle order statistics).

Selection algorithms still have the downside of requiring Ω(n) memory, that is, they need to have the full sample (or a linear-sized portion of it) in memory. Because this, as well as the linear time requirement, can be prohibitive, several estimation procedures for the median have been developed. A simple one is the median of three rule, which estimates the median as the median of a three-element subsample; this is commonly used as a subroutine in the quicksort sorting algorithm, which uses an estimate of its input's median. A more robust estimator is Tukey's ninther, which is the median of three rule applied with limited recursion: if A is the sample laid out as an array, and

med3(A) = median(A[1], A[⁠n/2⁠], A[n]),

then

ninther(A) = med3(med3(A[1 ... ⁠1/3⁠n]), med3(A[⁠1/3⁠n ... ⁠2/3⁠n]), med3(A[⁠2/3⁠n ... n]))

The remedian is an estimator for the median that requires linear time but sub-linear memory, operating in a single pass over the sample.

Easy explanation of the sample median

In individual series (if number of observation is very low) first one must arrange all the observations in order. Then count(n) is the total number of observation in given data.

If n is odd then Median (M) = value of ((n + 1)/2)th item term.

If n is even then Median (M) = value of [((n)/2)th item term + ((n)/2 + 1)th item term ]/2

For an odd number of values

As an example, we will calculate the sample median for the following set of observations: 1, 5, 2, 8, 7.

Start by sorting the values: 1, 2, 5, 7, 8.

In this case, the median is 5 since it is the middle observation in the ordered list.

The median is the ((n + 1)/2)th item, where n is the number of values. For example, for the list {1, 2, 5, 7, 8}, we have n = 5, so the median is the ((5 + 1)/2)th item.

median = (6/2)th item

median = 3rd item

median = 5

For an even number of values

As an example, we will calculate the sample median for the following set of observations: 1, 6, 2, 8, 7, 2.

Start by sorting the values: 1, 2, 2, 6, 7, 8.

In this case, the arithmetic mean of the two middlemost terms is (2 + 6)/2 = 4. Therefore, the median is 4 since it is the arithmetic mean of the middle observations in the ordered list.

We also use this formula MEDIAN = {(n + 1 )/2}th item . n = number of values

As above example 1, 2, 2, 6, 7, 8 n = 6 Median = {(6 + 1)/2}th item = 3.5th item. In this case, the median is average of the 3rd number and the next one (the fourth number). The median is (2 + 6)/2 which is 4.

Sampling distribution

The distribution of both the sample mean and the sample median were determined by Laplace. The distribution of the sample median from a population with a density function $f(x)$ is asymptotically normal with mean $m$ and variance

${\frac {1}{4nf(m)^{2}}}$

where $m$ is the median value of distribution and $n$ is the sample size. In practice this may be difficult to estimate as the density function is usually unknown.

These results have also been extended. It is now known for the $p$-th quantile that the distribution of the sample $p$-th quantile is asymptotically normal around the $p$-th quantile with variance equal to

${\frac {p(1-p)}{nf(x_{p})^{2}}}$

where $f(x_{p})$ is the value of the distribution density at the $p$-th quantile.

Estimation of variance from sample data

The value of $(2f(x))^{-2}$—the asymptotic value of $n^{-{\frac {1}{2}}}(\nu -m)$ where $\nu$ is the population median—has been studied by several authors. The standard 'delete one' jackknife method produces inconsistent results. An alternative—the 'delete k' method—where $k$ grows with the sample size has been shown to be asymptotically consistent. This method may be computationally expensive for large data sets. A bootstrap estimate is known to be consistent, but converges very slowly (order of $n^{-{\frac {1}{4}}}$). Other methods have been proposed but their behavior may differ between large and small samples.

Efficiency

The efficiency of the sample median, measured as the ratio of the variance of the mean to the variance of the median, depends on the sample size and on the underlying population distribution. For a sample of size $N=2n+1$ from the normal distribution, the ratio is

${\frac {4n}{\pi (2n+1)}}$

For large samples (as $n$ tends to infinity) this ratio tends to ${\frac {2}{\pi }}.$

Other estimators

For univariate distributions that are symmetric about one median, the Hodges–Lehmann estimator is a robust and highly efficient estimator of the population median.

If data are represented by a statistical model specifying a particular family of probability distributions, then estimates of the median can be obtained by fitting that family of probability distributions to the data and calculating the theoretical median of the fitted distribution. Pareto interpolation is an application of this when the population is assumed to have a Pareto distribution.

Coefficient of dispersion

The coefficient of dispersion (CD) is defined as the ratio of the average absolute deviation from the median to the median of the data. It is a statistical measure used by the states of Iowa, New York and South Dakota in estimating dues taxes. In symbols

$CD={\frac {1}{n}}{\frac {\sum |m-x|}{m}}$

where n is the sample size, m is the sample median and x is a variate. The sum is taken over the whole sample.

Confidence intervals for a two sample test where the sample sizes are large have been derived by Bonett and Seier This test assumes that both samples have the same median but differ in the dispersion around it. The confidence interval (CI) is bounded inferiorly by

$\exp \left[\log \left({\frac {t_{a}}{t_{b}}}\right)-z_{\alpha }\left(\operatorname {var} \left[\log \left({\frac {t_{a}}{t_{b}}}\right)\right]\right)^{0.5}\right]$

where t_j is the mean absolute deviation of the j^th sample, var() is the variance and z_α is the value from the normal distribution for the chosen value of α: for α = 0.05, z_α = 1.96. The following formulae are used in the derivation of these confidence intervals

$\operatorname {var} [\log(t_{a})]={\frac {\left({\frac {s_{a}^{2}}{t_{a}^{2}}}+\left({\frac {x_{a}-{\bar {x}}}{t_{a}}}\right)^{2}-1\right)}{n}}$

$\operatorname {var} \left[\log \left({\frac {t_{a}}{t_{b}}}\right)\right]=\operatorname {var} [\log(t_{a})]+\operatorname {var} [\log(t_{b})]-2r(\operatorname {var} [\log(t_{a})]\operatorname {var} [\log(t_{b})])^{0.5}$

where r is the Pearson correlation coefficient between the squared deviation scores

$d_{ia}=|x_{ia}-{\bar {x}}_{a}|$ and $d_{ib}=|x_{ib}-{\bar {x}}_{b}|$

a and b here are constants equal to 1 and 2, x is a variate and s is the standard deviation of the sample.

Multivariate median

Previously, this article discussed the concept of a univariate median for a one-dimensional object (population, sample). When the dimension is two or higher, there are multiple concepts that extend the definition of the univariate median; each such multivariate median agrees with the univariate median when the dimension is exactly one. In higher dimensions, however, there are several multivariate medians.

Marginal median

The marginal median is defined for vectors defined with respect to a fixed set of coordinates. A marginal median is defined to be the vector whose components are univariate medians. The marginal median is easy to compute, and its properties were studied by Puri and Sen.

Spatial median (L1 median)

In a normed vector space of dimension two or greater, the "spatial median" minimizes the expected distance

$a\mapsto \mathrm {E} (\left\|X-a\right\|),\,$

where X and a are vectors, if this expectation has a finite minimum; another definition is better suited for general probability-distributions. The spatial median is unique when the data-set's dimension is two or more. It is a robust and highly efficient estimator of a central tendency of a population.

The Geometric median is the corresponding estimator based on the sample statistics of a finite set of points, rather than the population statistics. It is the point minimizing the arithmetic average of Euclidean distances to the given sample points, instead of the expectation. Note that the arithmetic average and sum are interchangeable since they differ by a fixed constant which does not alter the location of the minimum.

Other multivariate medians

An alternative generalization of the spatial median in higher dimensions that does not relate to a particular metric is the centerpoint.

Other median-related concepts

Pseudo-median

For univariate distributions that are symmetric about one median, the Hodges–Lehmann estimator is a robust and highly efficient estimator of the population median; for non-symmetric distributions, the Hodges–Lehmann estimator is a robust and highly efficient estimator of the population pseudo-median, which is the median of a symmetrized distribution and which is close to the population median. The Hodges–Lehmann estimator has been generalized to multivariate distributions.

Variants of regression

The Theil–Sen estimator is a method for robust linear regression based on finding medians of slopes.

Median filter

Main article: Median filter

In the context of image processing of monochrome raster images there is a type of noise, known as the salt and pepper noise, when each pixel independently becomes black (with some small probability) or white (with some small probability), and is unchanged otherwise (with the probability close to 1). An image constructed of median values of neighborhoods (like 3×3 square) can effectively reduce noise in this case.

Cluster analysis

Main article: k-medians clustering

In cluster analysis, the k-medians clustering algorithm provides a way of defining clusters, in which the criterion of maximising the distance between cluster-means that is used in k-means clustering, is replaced by maximising the distance between cluster-medians.

Median–median line

This is a method of robust regression. The idea dates back to Wald in 1940 who suggested dividing a set of bivariate data into two halves depending on the value of the independent parameter $x$: a left half with values less than the median and a right half with values greater than the median. He suggested taking the means of the dependent $y$ and independent $x$ variables of the left and the right halves and estimating the slope of the line joining these two points. The line could then be adjusted to fit the majority of the points in the data set.

Nair and Shrivastava in 1942 suggested a similar idea but instead advocated dividing the sample into three equal parts before calculating the means of the subsamples. Brown and Mood in 1951 proposed the idea of using the medians of two subsamples rather the means. Tukey combined these ideas and recommended dividing the sample into three equal size subsamples and estimating the line based on the medians of the subsamples.

Median-unbiased estimators

Main article: Bias of an estimator § Median-unbiased estimators

Any mean-unbiased estimator minimizes the risk (expected loss) with respect to the squared-error loss function, as observed by Gauss. A median-unbiased estimator minimizes the risk with respect to the absolute-deviation loss function, as observed by Laplace. Other loss functions are used in statistical theory, particularly in robust statistics.

The theory of median-unbiased estimators was revived by George W. Brown in 1947:

An estimate of a one-dimensional parameter θ will be said to be median-unbiased if, for fixed θ, the median of the distribution of the estimate is at the value θ; i.e., the estimate underestimates just as often as it overestimates. This requirement seems for most purposes to accomplish as much as the mean-unbiased requirement and has the additional property that it is invariant under one-to-one transformation.

— page 584

Further properties of median-unbiased estimators have been reported. In particular, median-unbiased estimators exist in cases where mean-unbiased and maximum-likelihood estimators do not exist. Median-unbiased estimators are invariant under one-to-one transformations.

History

The idea of the median appeared in the 13th century in the Talmud (further for possible older mentions)

The idea of the median also appeared later in Edward Wright's book on navigation (Certaine Errors in Navigation) in 1599 in a section concerning the determination of location with a compass. Wright felt that this value was the most likely to be the correct value in a series of observations.

In 1757, Roger Joseph Boscovich developed a regression method based on the L1 norm and therefore implicitly on the median.

In 1774, Laplace suggested the median be used as the standard estimator of the value of a posterior pdf. The specific criteria was to minimize the expected magnitude of the error; $|\alpha -\alpha ^{*}|$ where $\alpha ^{*}$ is the estimate and $\alpha$ is the true value. Laplaces's criterion was generally rejected for 150 years in favor of the least squares method of Gauss and Legendre which minimizes $(\alpha -\alpha ^{*})^{2}$ to obtain the mean. The distribution of both the sample mean and the sample median were determined by Laplace in the early 1800s.

Antoine Augustin Cournot in 1843 was the first to use the term median (valeur médiane) for the value that divides a probability distribution into two equal halves. Gustav Theodor Fechner used the median (Centralwerth) in sociological and psychological phenomena. It had earlier been used only in astronomy and related fields. Gustav Fechner popularized the median into the formal analysis of data, although it had been used previously by Laplace.

Francis Galton used the English term median in 1881, having earlier used the terms middle-most value in 1869 and the medium in 1880.

See also

• Absolute deviation
• Bias of an estimator
• Concentration of measure for Lipschitz functions
• Median graph
• Median search
• Median slope
• Median voter theory
• Weighted median

External links

• "Median (in statistics)", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• Median as a weighted arithmetic mean of all Sample Observations
• On-line calculator
• Calculating the median
• A problem involving the mean, the median, and the mode.
• Weisstein, Eric W. "Statistical Median". MathWorld.
• Python script for Median computations and income inequality metrics

This article incorporates material from Median of a distribution on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.