Construction of aggregation functions from data using linear programming

  • Authors:
  • Gleb Beliakov

  • Affiliations:
  • School of Engineering and Information Technology, Deakin University, 221 Burwood Hwy, Burwood 3125, Australia

  • Venue:
  • Fuzzy Sets and Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.20

Visualization

Abstract

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.