Aggregation functions based on penalties

Tomasa Calvo

doi:10.1016/j.fss.2009.05.012

Aggregation functions based on penalties

2010-05-01

123

PRE

AI

DOI：10.1016/j.fss.2009.05.012

Original

Original request for help

Save

Abstract

En 中文

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. Crown Copyright (C) 2009 Published by Elsevier B.V. All rights reserved.

Keywords:

Aggregation operators

Means

Quasi-arithmetic means

Median

OWA

Penalty function

Aggregation functions based on penalties

Abstract

Journal

Organization