numpy.MaskedArray.median() function is used to compute the sum of the masked array elements over the given axis.
numpy.ma.sum(arr, axis=None, dtype=None, out=None, keepdims=False)
arr : [ ndarray ] Input masked array.
axis :[ int, optional] Axis along which the sum is computed. The default (None) is to compute the sum over the flattened array.
dtype : [dtype, optional] Type of the returned array, as well as of the accumulator in which the elements are multiplied.
out : [ndarray, optional] A location into which the result is stored.
-> If provided, it must have a shape that the inputs broadcast to.
-> If not provided or None, a freshly-allocated array is returned.
keepdims :[ bool, optional] 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.
Return : [sum_along_axis, ndarray] A new array holding the result is returned unless out is specified, in which case a reference to out is returned.
Code #1 :
Input array : [[ 1 2] [ 3 -1] [ 5 -3]] Masked array : [[-- 2] [-- -1] [5 -3]] sum of masked array along default axis : 3
Code #2 :
Input array : [[1 0 3] [4 1 6]] Masked array : [[1 0 3] [4 1 --]] sum of masked array along 0 axis : [5 1 3] sum of masked array along 1 axis : [4 5]
- Python | numpy.cov() function
- Numpy recarray.var() function | Python
- Numpy recarray.min() function | Python
- Numpy recarray.max() function | Python
- Numpy recarray.mean() function | Python
- Numpy recarray.dot() function | Python
- Python | numpy.issubdtype() function
- Python | numpy.issubsctype() function
- Numpy MaskedArray.any() function | Python
- Numpy MaskedArray.std() function | Python
- Numpy size() function | Python
- Python | numpy.issctype() function
- Python | Numpy nanmedian() function
- Python | numpy.copyto() function
- Numpy MaskedArray.var() function | Python
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.