median(a, axis=None, out=None, overwrite_input=False, keepdims=False)
Returns the median of the array elements.
Given a vector V
with N
non masked values, the median of V
is the middle value of a sorted copy of V
( Vs
) - i.e. Vs[(N-1)/2]
, when N
is odd, or {Vs[N/2 - 1] + Vs[N/2]}/2
when N
is even.
Input array or object that can be converted to an array.
Axis along which the medians are computed. The default (None) is to compute the median along a flattened version of the array.
Alternative output array in which to place the result. It must have the same shape and buffer length as the expected output but the type will be cast if necessary.
If True, then allow use of memory of input array (a) for calculations. The input array will be modified by the call to median. This will save memory when you do not need to preserve the contents of the input array. Treat the input as undefined, but it will probably be fully or partially sorted. Default is False. Note that, if :None:None:`overwrite_input` is True, and the input is not already an ndarray
, an error will be raised.
If this is set to True, the axes which are reduced are left in the result as dimensions with size one. With this option, the result will broadcast correctly against the input array.
A new array holding the result is returned unless out is specified, in which case a reference to out is returned. Return data-type is float64
for integers and floats smaller than float64
, or the input data-type, otherwise.
Compute the median along the specified axis.
>>> x = np.ma.array(np.arange(8), mask=[0]*4 + [1]*4)
... np.ma.median(x) 1.5
>>> x = np.ma.array(np.arange(10).reshape(2, 5), mask=[0]*6 + [1]*4)
... np.ma.median(x) 2.5
>>> np.ma.median(x, axis=-1, overwrite_input=True) masked_array(data=[2.0, 5.0], mask=[False, False], fill_value=1e+20)See :
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them