weighted mean
please note:
- the text and code below is from The Pseudopedia
- it has been imported raw for GetWiki
The
weighted mean is similar to an
arithmetic mean (the most common type of
average), where instead of each of the data points contributing equally to the final average, some data points contribute more than others. The notion of weighted mean plays a role in
descriptive statistics and also occurs in a more general form in several other areas of mathematics.If all the weights are equal, then the weighted mean is the same as the
arithmetic mean. While weighted means generally behave in a similar fashion to arithmetic means, they do have a few counter-intuitive properties, as captured for instance in
Simpson's paradox.The term
weighted average usually refers to a weighted arithmetic mean, but weighted versions of other means can also be calculated, such as the
weighted geometric mean and the
weighted harmonic mean.
Example
Given two school classes, one with 20 students, and one with 30 students, the grades in each class on a test were:
Morning class = 62, 67, 71, 74, 76, 77, 78, 79, 79, 80, 80, 81, 81, 82, 83, 84, 86, 89, 93, 98
Afternoon class = 81, 82, 83, 84, 85, 86, 87, 87, 88, 88, 89, 89, 89, 90, 90, 90, 90, 91, 91, 91, 92, 92, 93, 93, 94, 95, 96, 97, 98, 99
The straight average for the morning class is 80 and the straight average of the afternoon class is 90. The straight average of 80 and 90 is 85, the mean of the two class means. However, this does not account for the difference in number of students in each class, and the value of 85 does not reflect the average student grade (independent of class). The average student grade can be obtained by averaging all the grades, without regard to classes:
bar{x} = frac{4300}{50} = 86.Or, this can be accomplished by weighting the class means by the number of students in each class (using a weighted mean of the class means):
bar{x} = frac{(20)80 + (30)90}{20 + 30} = 86.Thus, the weighted mean makes it possible to find the average student grade in the case where only the class means and the number of students in each class are available.
Mathematical definition
Formally, the weighted mean of a
non-empty set of data
[xarg∈-→(:4(x;font-size:12(x;">1 xarg∈-→(:4(x;font-size:12(x;">2 deriv(⋅)s xarg∈-→(:4(x;font-size:12(x;">n]
with non-negative
weights
[warg∈-→(:4(x;font-size:12(x;">1 warg∈-→(:4(x;font-size:12(x;">2 deriv(⋅)s warg∈-→(:4(x;font-size:12(x;">n]
is the quantity
which means:
bar{x} = frac{w_1 x_1 + w_2 x_2 + cdots + w_n x_n}{w_1 + w_2 + cdots + w_n}.Therefore data elements with a high weight contribute more to the weighted mean than do elements with a low weight. The weights cannot be negative. Some may be zero, but not all of them (since division by zero is not allowed). The formulas are simplified when the weights are normalized such that they sum up to
1
, i.e.
Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n warg∈-→(:4(x;font-size:12(x;">i = 1
. For such normalized weights the weighted mean is simply
sin;e;">x = Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n warg∈-→(:4(x;font-size:12(x;">i xarg∈-→(:4(x;font-size:12(x;">i
.The common mean
frac 1/nΣarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n xarg∈-→(:4(x;font-size:12(x;">i
is a special case of the weighted mean where all data have equal weights,
warg∈-→(:4(x;font-size:12(x;">i=w
.
Length-weighted mean
This is used for weighting a response variable based upon its dependency on
x
, a distance variable.
bar{y} = frac{y_2 x_2 - y_1 x_1}{x_2 - x_1}
Convex combination
Since only the
relative weights are relevant, any weighted mean can be expressed using coefficients that sum to one. Such a linear combination is called a
convex combination.Using the previous example, we would get the following:
frac{20}{20 + 30} = 0.4,
frac{30}{20 + 30} = 0.6,
bar{x} = frac{(0.4)80% + (0.6)90%}{0.4 + 0.6} = 86%.This simplifies to:
bar{x} = (0.4)80% + (0.6)90% = 86%.
Statistical properties
The weighted sample mean,
sin;e;">x
, with normalized weights (weights summing to one) is itself a random variable. Its expected value and standard deviation are related to the expected values and standard deviations of the observations as follows.If the observations have expected values
E(xarg∈-→(:4(x;font-size:12(x;">i )=sin;e;">xarg∈-→(:4(x;font-size:12(x;">i
,
then the weighted sample mean has expectation
E(sin;e;">x) = Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n warg∈-→(:4(x;font-size:12(x;">i sin;e;">xarg∈-→(:4(x;font-size:12(x;">i
.
Particularly, if the expectations of all observations are equal,
sin;e;">xarg∈-→(:4(x;font-size:12(x;">i=c
, then the expectation of the weighted sample mean will be the same,
For uncorrelated observations with standard deviations
σarg∈-→(:4(x;font-size:12(x;">i
, the weighted sample mean has standard deviation
σ(sin;e;">x)= √ Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n warg∈-→(:4(x;font-size:12(x;">iarg∈-→(:-4(x;font-size:12(x;">2 σarg∈-→(:-4(x;font-size:12(x;">2arg∈-→(:4(x;font-size:12(x;">i
.
Consequently, when the standard deviations of all observations are equal,
σarg∈-→(:4(x;font-size:12(x;">i=d
, the weighted sample mean will have standard deviation
σ(sin;e;">x)= d √ Varg∈-→(:4(x;font-size:12(x;">2
. Here
Varg∈-→(:4(x;font-size:12(x;">2
is the quantity
Varg∈-→(:4(x;font-size:12(x;">2=Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n warg∈-→(:4(x;font-size:12(x;">iarg∈-→(:-4(x;font-size:12(x;">2
,
such that
1/n ≤ Varg∈-→(:4(x;font-size:12(x;">2≤ 1
. It attains its minimum value for equal weights, and its maximum when all weights except one are zero. In the former case we have
σ(sin;e;">x)=d/ √ n
, which is related to the
central limit theorem.
Dealing with variance
For the weighted mean of a list of data for which each element
xarg∈-→(:4(x;font-size:12(x;">i
comes from a different
probability distribution with known
variance σarg∈-→(:4(x;font-size:12(x;">iarg∈-→(:-4(x;font-size:12(x;">2
, one possible choice for the weights is given by:
w_i = frac{1}{sigma_i^2}.The weighted mean in this case is:
bar{x} = frac{ sum_{i=1}^n (x_i/{sigma_i}^2)}{sum_{i=1}^n (1/{sigma_i}^2)},and the variance of the weighted mean is:
sigma_{bar{x}}^2 = frac{ 1 }{sum_{i=1}^n (1/{sigma_i}^2)},which reduces to
σarg∈-→(:4(x;font-size:12(x;">sin;e;">xarg∈-→(:-4(x;font-size:12(x;">2 = σarg∈-→(:4(x;font-size:12(x;">0arg∈-→(:-4(x;font-size:12(x;">2 /n
, when all
σarg∈-→(:4(x;font-size:12(x;">i = σarg∈-→(:4(x;font-size:12(x;">0.
The significance of this choice is that this weighted mean is the
maximum likelihood estimator of the mean of the probability distributions under the assumption that they are independent and
normally distributed with the same mean.
Correcting for over- or under-dispersion
Weighted means are typically used to find the weighted mean of experimental data, rather than theoretically generated data. In this case, there will be some error in the variance of each data point. Typically experimental errors may be underestimated due to the experimenter not taking into account all sources of error in calculating the variance of each data point. In this event, the variance in the weighted mean must be corrected to account for the fact that
χarg∈-→(:-4(x;font-size:12(x;">2
is too large. The correction that must be made is
σarg∈-→(:4(x;font-size:12(x;">sin;e;">xarg∈-→(:-4(x;font-size:12(x;">2 → σarg∈-→(:4(x;font-size:12(x;">sin;e;">xarg∈-→(:-4(x;font-size:12(x;">2 χarg∈-→(:-4(x;font-size:12(x;">2arg∈-→(:4(x;font-size:12(x;">ν
where
χarg∈-→(:-4(x;font-size:12(x;">2arg∈-→(:4(x;font-size:12(x;">ν
is
χarg∈-→(:-4(x;font-size:12(x;">2
divided by the number of degrees of freedom, in this case
n-1
. This gives the variance in the weighted mean as:
σarg∈-→(:4(x;font-size:12(x;">sin;e;">xarg∈-→(:-4(x;font-size:12(x;">2 = 1 /Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n 1/σarg∈-→(:4(x;font-size:12(x;">iarg∈-→(:-4(x;font-size:12(x;">2 ⋅ 1/(n-1) Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n (xarg∈-→(:4(x;font-size:12(x;">i - sin;e;">x )arg∈-→(:-4(x;font-size:12(x;">2/ σarg∈-→(:4(x;font-size:12(x;">iarg∈-→(:-4(x;font-size:12(x;">2 .
Weighted sample variance
Typically when a mean is calculated it is important to know the
variance and
standard deviation of that mean. When a weighted mean
μarg∈-→(:-4(x;font-size:12(x;">*
is used, the variance of the weighted sample is different from the variance of the unweighted sample. The
biased weighted
sample variance is defined similarly to the normal
biased sample variance:
sigma^2 = frac{
sum_{i=1}^N{left(x_i - muright)^2}
}{
N
}
sigma^2_mathrm{weighted} = frac{
sum_{i=1}^N{{w_i}left(x_i - mu^*right)^2}
}{V_1}where
Varg∈-→(:4(x;font-size:12(x;">1 = Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n warg∈-→(:4(x;font-size:12(x;">i
, which is 1 for normalized weights.For small samples, it is customary to use an
unbiased estimator for the population variance. In normal unweighted samples, the
N in the denominator (corresponding to the sample size) is changed to
N − 1. While this is simple in unweighted samples, it is not straightforward when the sample is weighted. The unbiased estimator of a weighted population variance is given by
(1):
s^2 = frac {V_1} {V_1^2-V_2} sum_{i=1}^N{{w_i}left(x_i - mu^*right)^2},where
Varg∈-→(:4(x;font-size:12(x;">2 = Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">n warg∈-→(:4(x;font-size:12(x;">iarg∈-→(:-4(x;font-size:12(x;">2
as introduced previously.The degrees of freedom of the weighted, unbiased sample variance vary accordingly from
N-1
down to
0
.The standard deviation is simply the square root of the variance above.
Accounting for correlations
In the general case, suppose that
X=[xarg∈-→(:4(x;font-size:12(x;">1deriv(⋅)sxarg∈-→(:4(x;font-size:12(x;">n]
,
C
is the
covariance matrix relating the quantities
xarg∈-→(:4(x;font-size:12(x;">i
,
sin;e;">x
is the common mean to be estimated, and
W
is the
design matrix [1, ..., 1] (of length
n
). The
Gauss–Markov theorem states that the estimate of the mean having minimum variance is given by:
σarg∈-→(:-4(x;font-size:12(x;">2arg∈-→(:4(x;font-size:12(x;">sin;e;">x=(Warg∈-→(:-4(x;font-size:12(x;">T Carg∈-→(:-4(x;font-size:12(x;">-1 W)arg∈-→(:-4(x;font-size:12(x;">-1
and
sin;e;">x = σarg∈-→(:-4(x;font-size:12(x;">2arg∈-→(:4(x;font-size:12(x;">sin;e;">x (Warg∈-→(:-4(x;font-size:12(x;">T Carg∈-→(:-4(x;font-size:12(x;">-1 X).
Decreasing strength of interactions
Consider the time series of an independent variable
x
and a dependent variable
y
, with
n
observations sampled at discrete times
targ∈-→(:4(x;font-size:12(x;">i
. In many common situations, the value of
y
at time
targ∈-→(:4(x;font-size:12(x;">i
depends not only on
xarg∈-→(:4(x;font-size:12(x;">i
but also on its past values. Commonly, the strength of this dependence decreases as the separation of observations in time increases. To model this situation, one may replace the independent variable by its sliding mean
z
for a window size
m
.
z_k=sum_{i=1}^m w_i x_{k+1-i}.{|class="wikitable"|+
Range weighted mean interpretation
|
! Range (1–5) || Weighted mean equivalence
|
| | Strong |
|
| | Satisfactory |
Exponentially decreasing weights
In the scenario described in the previous section, most frequently the decrease in interaction strength obeys a negative exponential law. If the observations are sampled at equidistant times, then exponential decrease is equivalent to decrease by a constant fraction 0<Δ<1
at each time step. Setting w=1-Δ
we can define m
normalized weights by warg∈-→(:4(x;font-size:12(x;">i=frac warg∈-→(:-4(x;font-size:12(x;">i-1/Varg∈-→(:4(x;font-size:12(x;">1
, where Varg∈-→(:4(x;font-size:12(x;">1
is the sum of the unnormalized weights. In this case Varg∈-→(:4(x;font-size:12(x;">1
is simply Varg∈-→(:4(x;font-size:12(x;">1=Σarg∈-→(:4(x;font-size:12(x;">i=1arg∈-→(:-4(x;font-size:12(x;">mwarg∈-→(:-4(x;font-size:12(x;">i-1 = frac 1-warg∈-→(:-4(x;font-size:12(x;">m/1-w
, approaching Varg∈-→(:4(x;font-size:12(x;">1=1/(1-w)
for large values of m
.
The damping constant w
must correspond to the actual decrease of interaction strength. If this cannot be determined from theoretical considerations, then the following properties of exponentially decreasing weights are useful in making a suitable choice: at step (1-w)arg∈-→(:-4(x;font-size:12(x;">-1
, the weight approximately equals earg∈-→(:-4(x;font-size:12(x;">-1(1-w)=0.39(1-w)
, the tail area the value earg∈-→(:-4(x;font-size:12(x;">-1
, the head area 1-earg∈-→(:-4(x;font-size:12(x;">-1=0.61
. The tail area at step n
is ≤ earg∈-→(:-4(x;font-size:12(x;">-n(1-w)
. Where primarily the closest n
observations matter and the effect of the remaining observations can be ignored safely, then choose w
such that the tail area is sufficiently small.Weighted averages of functions
The concept of weighted average can be extended to functions.(2)See also
Notes
-
[weblink]
-
[G. H. Hardy, J. E. Littlewood, and G. Pólya. Inequalities (2nd ed.), Cambridge University Press, ISBN 978-0521358804, 1988.]
Further reading
- Bevington, Philip. Data Reduction and Error Analysis for the Physical Sciences.
External links
- {{MathWorld|title=Weighted Mean|urlname=WeightedMean|author=David Terr}}
وسيط وزنيMitjana ponderadaVážený průměrKaalutud keskmineMedia ponderadaLaŭpeza aritmetika meznombroBatezbesteko aritmetiko haztatuMoyenne pondéréeMedia ponderadaממוצע משוקללSúlyozott átlagGewogen gemiddeldeŚrednia ważonaСреднее арифметическое взвешенноеWeighted meanPainotettu keskiarvoAğırlıklı ortalamaСереднє зваженеTrung bình cộng có trọng số加權平均數
- content above as imported from The Pseudopedia
- "weighted mean" does not exist on GetWiki
- time: 12:51pm EDT - Thu, Jul 29 2010