\(\renewcommand\AA{\unicode{x212B}}\)
Table of Contents
Computes the most likely mean of the array by minimizing the taxicab distance of the elements from the rest.
Name | Direction | Type | Default | Description |
---|---|---|---|---|
InputArray | Input | dbl list | Mandatory | An input array. |
Output | Output | number | The output (mean). |
This algorithm finds a so-called most-likely mean of an array being the element that has the minimum of the summed square-rooted absolute distances with all the other elements in the array:
Example - MostLikelyMean
import numpy
array = numpy.arange(100)
mlm = MostLikelyMean(array)
print(mlm)
Output:
49.0
Categories: AlgorithmIndex | Arithmetic
C++ header: MostLikelyMean.h (last modified: 2020-03-20)
C++ source: MostLikelyMean.cpp (last modified: 2021-03-31)