Construction of aggregation functions from data using linear programming


Autoria(s): Beliakov, Gleb
Data(s)

01/01/2009

Resumo

This article examines the construction of aggregation functions from data by minimizing the least absolute deviation criterion. We formulate various instances of such problems as linear programming problems. We consider the cases in which the data are provided as intervals, and the outputs ordering needs to be preserved, and show that linear programming formulation is valid for such cases. This feature is very valuable in practice, since the standard simplex method can be used.<br />

Identificador

http://hdl.handle.net/10536/DRO/DU:30028308

Idioma(s)

eng

Publicador

Elsevier

Relação

http://dro.deakin.edu.au/eserv/DU:30028308/beliakov-constructionofaggregation-2009.pdf

http://dx.doi.org/10.1016/j.fss.2008.07.004

Direitos

2008, Elsevier B.V.

Palavras-Chave #aggregation operators #fuzzy sets #quasi-arithmetic means #OWA #triangular norms #least absolute deviation
Tipo

Journal Article