Mean of circular quantities

Revision as of 19:29, 4 September 2012 by WikiBot (talk | contribs) (Robot: Automated text replacement (-{{WikiDoc Cardiology Network Infobox}} +, -<references /> +{{reflist|2}}, -{{reflist}} +{{reflist|2}}))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In mathematics, a mean of circular quantities is a mean which is suited for quantities like angles, daytimes, and fractional parts of real numbers. This is necessary since most of the usual means fail on circular quantities. For example, the arithmetic mean of 0° and 360° is 180°, although 0° would be clearly the better choice. [1]

Mean of angles

Since the arithmetic mean is not effective for angles, the following method can be used to obtain both a mean value and measure for the variance of the angles:

Convert all angles to corresponding points on the unit circle, e.g. <math>\alpha</math> to <math>(\cos\alpha,\sin\alpha)</math>. That is convert polar coordinates to Cartesian coordinates. Then compute the arithmetic mean of these points. The resulting point will lie in the unit circle. Convert that point back to polar coordinates. The angle is a reasonable mean of the input angles. The resulting radius will be 1 if all angles are equal. If the angles are uniformly distributed on the circle, then the resulting radius will be 0. In other words, the radius measures the concentration of the angles.

Given the angles <math>\alpha_1,\dots,\alpha_n</math> the mean is computed by

<math>M \alpha = \operatorname{atan2}\left(\frac{1}{n}\cdot\sum_{j=1}^n \sin\alpha_j, \frac{1}{n}\cdot\sum_{j=1}^n \cos\alpha_j\right) </math>

using the atan2 variant of the arctangent function, or

<math>M \alpha = \arg\left(\frac{1}{n}\cdot\sum_{j=1}^n \exp(i\cdot\alpha_j)\right) </math>

using complex numbers.

Properties

The mean <math>M\alpha</math>

  • maximizes the likelihood of the mean parameter of the circular normal distribution and
  • minimizes the sum of a certain distance on the circle, more precisely <math>M\alpha = \underset{\beta}{\operatorname{argmin}} \sum_{j=1}^n d(\alpha_j,\beta)</math>, where <math>d(\varphi,\beta) = 1-\cos(\varphi-\beta)</math>. The distance <math>d(\varphi,\beta)</math> measures the length of the projection of the segment between the two points on the unit circle associated with <math>\varphi</math> and <math>\beta</math> onto the line through the origin and the point associated with <math>\beta</math>.

See also

References

  1. Christopher M. Bishop: Pattern Recognition and Machine Learning (Information Science and Statistics), ISBN 0387310738

Template:WikiDoc Sources