This article studies a large class of averaging aggregation functions based on minimizing a distance from the vector of inputs, or equivalently, minimizing a penalty imposed for deviations of individual inputs from the aggregated value. We provide a systematization of various types of penalty based aggregation functions, and show how many special cases arise as the result. We show how new aggregation functions can be constructed either analytically or numerically and provide many examples. We establish connection with the maximum likelihood principle, and present tools for averaging experimental noisy data with distinct noise distributions.
Reproduced with the specific permission of the copyright owner.
Field of Research
080108 Neural, Evolutionary and Fuzzy Computation
Socio Economic Objective
970108 Expanding Knowledge in the Information and Computing Sciences
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact firstname.lastname@example.org.