Die Publikationsdatenbank wird fortlaufend aktualisiert. Auch Schriftstücke älterer Jahrgänge werden sukzessive ergänzt.

## 2010 |

Kämpke, T Distance equalizers Artikel 2010. Abstract | BibTeX | Schlagwörter: central tendency, dispersion, mean value, median, robust statistics, shortest path computations @article{--c, title = {Distance equalizers}, author = {T. Kämpke}, year = {2010}, date = {2010-05-15}, abstract = {Distance equalizers are introduced as empirical measures of central tendency that make distances to univariate data as similar as possible. These measures are made precise by means of various so-called fluctuation functions which account for distances in different ways. Distance equalizers differ from the mean and the median. Also, distance equalizers relate to dispersion measures like the median of absolute deviations and allow to define new dispersion measures. Algorithms as well as a closed form solutions for special cases are given. Computations require to perform multiextemal function minimization of several kinds. Distance equalization is shown to enable cluster analysis with a special neighbouhood notion. Cluster computations are reduced to computations of shortest paths with prescribed number of intermediate nodes in weighted directed graphs.}, keywords = {central tendency, dispersion, mean value, median, robust statistics, shortest path computations}, pubstate = {published}, tppubtype = {article} } Distance equalizers are introduced as empirical measures of central tendency that make distances to univariate data as similar as possible. These measures are made precise by means of various so-called fluctuation functions which account for distances in different ways. Distance equalizers differ from the mean and the median. Also, distance equalizers relate to dispersion measures like the median of absolute deviations and allow to define new dispersion measures. Algorithms as well as a closed form solutions for special cases are given. Computations require to perform multiextemal function minimization of several kinds. Distance equalization is shown to enable cluster analysis with a special neighbouhood notion. Cluster computations are reduced to computations of shortest paths with prescribed number of intermediate nodes in weighted directed graphs. |

Herzlich Willkommen! Cookies erleichtern uns den Betrieb unserer Website. Wenn Sie diese Website weiter nutzen, gehen wir von Ihrem Einverständnis aus.EinverstandenDatenschutzerklärung