In mathematics, generalized means (or power mean or Hölder mean from Otto Hölder) are a family of functions for aggregating sets of numbers. These include as special cases the Pythagorean means (arithmetic, geometric, and harmonic means).
If p is a non-zero real number, and are positive real numbers, then the generalized mean or power mean with exponent p of these positive real numbers is
(See p-norm). For p = 0 we set it equal to the geometric mean (which is the limit of means with exponents approaching zero, as proved below):
Furthermore, for a sequence of positive weights wi we define the weighted power mean as
and when p = 0, it is equal to the weighted geometric mean:
The unweighted means correspond to setting all wi = 1/n.
A few particular values of p yield special cases with their own names:
minimum
harmonic mean
geometric mean
arithmetic mean
root mean squareor quadratic mean
cubic mean
maximum
Let be a sequence of positive real numbers, then the following properties hold:
where is a permutation operator.
In general, if p < q, then
and the two means are equal if and only if x1 = x2 = ... = xn.
The inequality is true for real values of p and q, as well as positive and negative infinity values.
It follows from the fact that, for all real p,
which can be proved using Jensen's inequality.
In particular, for p in {−1, 0, 1}, the generalized mean inequality implies the Pythagorean means inequality as well as the inequality of arithmetic and geometric means.
We will prove the weighted power mean inequality. For the purpose of the proof we will assume the following without loss of generality:
The proof for unweighted power means can be easily obtained by substituting wi = 1/n.
Suppose an average between power means with exponents p and q holds:
applying this, then:
We raise both sides to the power of −1 (strictly decreasing function in positive reals):
We get the inequality for means with exponents −p and −q, and we can use the same reasoning backwards, thus proving the inequalities to be equivalent, which will be used in some of the later proofs.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ce cours entend exposer les fondements de la géométrie à un triple titre :
1/ de technique mathématique essentielle au processus de conception du projet,
2/ d'objet privilégié des logiciels de concept
Building up on the basic concepts of sampling, filtering and Fourier transforms, we address stochastic modeling, spectral analysis, estimation and prediction, classification, and adaptive filtering, w
In mathematics, the harmonic mean is one of several kinds of average, and in particular, one of the Pythagorean means. It is sometimes appropriate for situations when the average rate is desired. The harmonic mean can be expressed as the reciprocal of the arithmetic mean of the reciprocals of the given set of observations.
There are several kinds of mean in mathematics, especially in statistics. Each mean serves to summarize a given group of data, often to better understand the overall value (magnitude and sign) of a given data set. For a data set, the arithmetic mean, also known as "arithmetic average", is a measure of central tendency of a finite set of numbers: specifically, the sum of the values divided by the number of values. The arithmetic mean of a set of numbers x1, x2, ..., xn is typically denoted using an overhead bar, .
In ordinary language, an average is a single number taken as representative of a list of numbers, usually the sum of the numbers divided by how many numbers are in the list (the arithmetic mean). For example, the average of the numbers 2, 3, 4, 7, and 9 (summing to 25) is 5. Depending on the context, an average might be another statistic such as the median, or mode. For example, the average personal income is often given as the median—the number below which are 50% of personal incomes and above which are 50% of personal incomes—because the mean would be higher by including personal incomes from a few billionaires.
An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n.Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed p ...
Various unsupervised learning algorithms including GMM, Birch, Mean- Shift, K-means and DBSCAN were used to cluster the image and depth sensor data. However, it was not possible to fit the clusters on each objects quite separately in as much as data are too ...
Knapsack problems give a simple framework for decision making. A classical example is the min-knapsack problem (MinKnap): choose a subset of items with minimum total cost, whose total profit is above a given threshold. While this model successfully general ...