The algorithm is entirely well described in the original work [1]. Briefly, it is a gradient descent method that computes simplex with the smallest volume around (M-1)-dimensional data points. A ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results