OWA operators based on admissible permutations
Date
2019Version
Acceso abierto / Sarbide irekia
Type
Contribución a congreso / Biltzarrerako ekarpena
Version
Versión aceptada / Onetsi den bertsioa
Project Identifier
ES/1PE/TIN2016-77356
Impact
|
10.1109/FUZZ-IEEE.2019.8858866
Abstract
In this work we propose a new OWA operator defined on bounded convex posets of a vector-lattice. In order to overcome the non-existence of a total order, which is necessary to obtain a non-decreasing arrangement of the input data, we use the concept of admissible permutation. Based on it, our proposal calculates the different ways in which the input vector could be arranged, always respecting the ...
[++]
In this work we propose a new OWA operator defined on bounded convex posets of a vector-lattice. In order to overcome the non-existence of a total order, which is necessary to obtain a non-decreasing arrangement of the input data, we use the concept of admissible permutation. Based on it, our proposal calculates the different ways in which the input vector could be arranged, always respecting the partial order. For each admissible arrangement, we calculate an intermediate value which is finally collected and averaged by means of the arithmetic mean. We analyze several properties of this operator and we give some counterexamples of those properties of aggregation functions which are not satisfied. [--]
Subject
Aggregation functions,
Admissible order,
Admissible permutation,
OWA operator
Publisher
IEEE
Published in
2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE): 23-26 June, New Orleans, Louisiana, USA, pp. 1-5
Departament
Universidad Pública de Navarra. Departamento de Estadística, Informática y Matemáticas /
Nafarroako Unibertsitate Publikoa. Estatistika, Informatika eta Matematika Saila
Publisher version
Sponsorship
This work has been partially supported by MINECO, AEI/FEDER,UE under grant TIN2016-77356-P, by grant VEGA 1/0006/19 and by the Public University of Navarre under the project PJUPNA13.