回答:
多変量中央値について受け入れられている定義があるかどうかはわかりません。私がよく知っているのは、Ojaの中央値ポイントです。これは、ポイントのサブセット上に形成されるシンプレックスのボリュームの合計を最小化します。(技術的な定義については、リンクを参照してください。)
更新:上記のOjaの定義について参照されているサイトには、多変量中央値の多くの定義を網羅した素晴らしい論文もあります。
@Arsはそこには受け入れられている定義はありません(これは良い点である)と述べました。分位数を一般化する方法の一般的な代替ファミリがあります。最も重要なことは次のとおりです。
分位プロセス一般レッツの経験的尺度(=の観測の割合である Aを)。次に、と Aでのボレル集合のも選ばれたサブセットのR Dと λ実数値尺度は、あなたが経験的分位関数を定義することができます。
Suppose you can find one that gives you the minimum. Then the set (or an element of the set) gives you the median when is made small enough. The definition of the median is recovered when using and . Ars answer falls into that framework I guess... tukey's half space location may be obtained using and (with , ).
variational definition and M-estimation The idea here is that the -quantile of a random variable in can be defined through a variational equality.
The most common definition is using the quantile regression function (also known as pinball loss, guess why ? ) . The case gives and you can generalize that to higher dimension using @Srikant Answerで行われた距離。これは理論上の中央値ですが、期待値を経験的期待値(平均)に置き換えると経験的中央値が得られます。
where for . He gives a lot of deep reasons for that (see the paper ;)). Generalizing this to higher dimensions require working with a vectorial and replacing by but you can take .
Obviously there are bridges between the different formulations. They are not all obvious...
There are distinct ways to generalize the concept of median to higher dimensions. One not yet mentioned, but which was proposed long ago, is to construct a convex hull, peel it away, and iterate for as long as you can: what's left in the last hull is a set of points that are all candidates to be "medians."
"Head-banging" is another more recent attempt (c. 1980) to construct a robust center to a 2D point cloud. (The link is to documentation and software available at the US National Cancer Institute.)
The principal reason why there are multiple distinct generalizations and no one obvious solution is that R1 can be ordered but R2, R3, ... cannot be.
Geometric median is the point with the smallest average euclidian distance from the samples
The Tukey halfspace median can be extended to >2 dimensions using DEEPLOC, an algorithm due to Struyf and Rousseeuw; see here for details.
The algorithm is used to approximate the point of greatest depth efficiently; naive methods which attempt to determine this exactly usually run afoul of (the computational version of) "the curse of dimensionality", where the runtime required to calculate a statistic grows exponentially with the number of dimensions of the space.
A definition that comes close to it, for unimodal distributions, is the tukey halfspace median
I do not know if any such definition exists but I will try and extend the standard definition of the median to . I will use the following notation:
, : the random variables associated with the two dimensions.
, : the corresponding medians.
: the joint pdf for our random variables
To extend the definition of the median to , we choose and to minimize the following:
The problem now is that we need a definition for what we mean by:
The above is in a sense a distance metric and several possible candidate definitions are possible.
Computing the median under the euclidean metric will require computing the expectation of the above with respect to the joint density .
Computing the median in the case of the taxicab metric involves computing the median of and separately as the metric is separable in and .