Central tendency

The following may be applied to one-dimensional data. Depending on the circumstances, it may be appropriate to transform the data before calculating a central tendency. Examples are squaring the values or taking logarithms. Whether a transformation is appropriate and what it should be, depend heavily on the data being analyzed.

Arithmetic mean or simply, mean

the sum of all measurements divided by the number of observations in the data set.

Median

the middle value that separates the higher half from the lower half of the data set. The median and the mode are the only measures of central tendency that can be used for ordinal data, in which values are ranked relative to each other but are not measured absolutely.

Mode

the most frequent value in the data set. This is the only central tendency measure that can be used with nominal data, which have purely qualitative category assignments.

Generalized mean

A generalization of the Pythagorean means, specified by an exponent.

Geometric mean

the nth root of the product of the data values, where there are n of these. This measure is valid only for data that are measured on a strictly positive scale.

Harmonic mean

the reciprocal of the arithmetic mean of the reciprocals of the data values. This measure is valid only for data that are measured either on a strictly positive or a strictly negative scale.

Weighted arithmetic mean

an arithmetic mean that incorporates weighting to certain data elements.

Truncated mean or trimmed mean

the arithmetic mean of data values after a certain number or proportion of the highest and lowest data values have been discarded.

Interquartile mean

a truncated mean based on data within the interquartile range.

Midrange

the arithmetic mean of the maximum and minimum values of a data set.

Midhinge

the arithmetic mean of the first and third quartiles.

Quasi-arithmetic mean

A generalization of the generalized mean, specified by a continuous injective function.

Trimean

the weighted arithmetic mean of the median and two quartiles.

Winsorized mean

an arithmetic mean in which extreme values are replaced by values closer to the median.

Any of the above may be applied to each dimension of multi-dimensional data, but the results may not be invariant to rotations of the multi-dimensional space.

Geometric median

the point minimizing the sum of distances to a set of sample points. This is the same as the median when applied to one-dimensional data, but it is not the same as taking the median of each dimension independently. It is not invariant to different rescaling of the different dimensions.

Quadratic mean (often known as the root mean square)

useful in engineering, but not often used in statistics. This is because it is not a good indicator of the center of the distribution when the distribution includes negative values.

Simplicial depth

the probability that a randomly chosen simplex with vertices from the given distribution will contain the given center

Tukey median

a point with the property that every halfspace containing it also contains many sample points

Several measures of central tendency can be characterized as solving a variational problem, in the sense of the calculus of variations, namely minimizing variation from the center. That is, given a measure of statistical dispersion, one asks for a measure of central tendency that minimizes variation: such that variation from the center is minimal among all choices of center. In a quip, "dispersion precedes location". These measures are initially defined in one dimension, but can be generalized to multiple dimensions. This center may or may not be unique. In the sense of L^p spaces, the correspondence is:

The associated functions are called p-norms: respectively 0-"norm", 1-norm, 2-norm, and ∞-norm. The function corresponding to the L⁰ space is not a norm, and is thus often referred to in quotes: 0-"norm".

In equations, for a given (finite) data set X, thought of as a vector x = (x₁,…,x_n), the dispersion about a point c is the "distance" from x to the constant vector c = (c,…,c) in the p-norm (normalized by the number of points n):

${\displaystyle f_{p}(c)=\left\|\mathbf {x} -\mathbf {c} \right\|_{p}:={\bigg (}{\frac {1}{n}}\sum _{i=1}^{n}\left|x_{i}-c\right|^{p}{\bigg )}^{1/p}}$ 

For p = 0 and p = ∞ these functions are defined by taking limits, respectively as p → 0 and p → ∞. For p = 0 the limiting values are 0⁰ = 0 and a⁰ = 0 or a ≠ 0, so the difference becomes simply equality, so the 0-norm counts the number of unequal points. For p = ∞ the largest number dominates, and thus the ∞-norm is the maximum difference.

The mean (L² center) and midrange (L^∞ center) are unique (when they exist), while the median (L¹ center) and mode (L⁰ center) are not in general unique. This can be understood in terms of convexity of the associated functions (coercive functions).

The 2-norm and ∞-norm are strictly convex, and thus (by convex optimization) the minimizer is unique (if it exists), and exists for bounded distributions. Thus standard deviation about the mean is lower than standard deviation about any other point, and the maximum deviation about the midrange is lower than the maximum deviation about any other point.

The 1-norm is not strictly convex, whereas strict convexity is needed to ensure uniqueness of the minimizer. Correspondingly, the median (in this sense of minimizing) is not in general unique, and in fact any point between the two central points of a discrete distribution minimizes average absolute deviation.

The 0-"norm" is not convex (hence not a norm). Correspondingly, the mode is not unique – for example, in a uniform distribution any point is the mode.

Instead of a single central point, one can ask for multiple points such that the variation from these points is minimized. This leads to cluster analysis, where each point in the data set is clustered with the nearest "center". Most commonly, using the 2-norm generalizes the mean to k-means clustering, while using the 1-norm generalizes the (geometric) median to k-medians clustering. Using the 0-norm simply generalizes the mode (most common value) to using the k most common values as centers.

Unlike the single-center statistics, this multi-center clustering cannot in general be computed in a closed-form expression, and instead must be computed or approximated by an iterative method; one general approach is expectation–maximization algorithms.

The notion of a "center" as minimizing variation can be generalized in information geometry as a distribution that minimizes divergence (a generalized distance) from a data set. The most common case is maximum likelihood estimation, where the maximum likelihood estimate (MLE) maximizes likelihood (minimizes expected surprisal), which can be interpreted geometrically by using entropy to measure variation: the MLE minimizes cross-entropy (equivalently, relative entropy, Kullback–Leibler divergence).

A simple example of this is for the center of nominal data: instead of using the mode (the only single-valued "center"), one often uses the empirical measure (the frequency distribution divided by the sample size) as a "center". For example, given binary data, say heads or tails, if a data set consists of 2 heads and 1 tails, then the mode is "heads", but the empirical measure is 2/3 heads, 1/3 tails, which minimizes the cross-entropy (total surprisal) from the data set. This perspective is also used in regression analysis, where least squares finds the solution that minimizes the distances from it, and analogously in logistic regression, a maximum likelihood estimate minimizes the surprisal (information distance).

For unimodal distributions the following bounds are known and are sharp:^[4]

${\displaystyle {\frac {|\theta -\mu |}{\sigma }}\leq {\sqrt {3}},}$ 

${\displaystyle {\frac {|\nu -\mu |}{\sigma }}\leq {\sqrt {0.6}},}$ 

${\displaystyle {\frac {|\theta -\nu |}{\sigma }}\leq {\sqrt {3}},}$ 

where μ is the mean, ν is the median, θ is the mode, and σ is the standard deviation.

For every distribution,^[5][6]

${\displaystyle {\frac {|\nu -\mu |}{\sigma }}\leq 1.}$ 

• Central moment
• Expected value
• Location parameter
• Mean
• Population mean
• Sample mean