English

Dynamic Ordered Weighted Averaging Functions for Complete Lattices

Logic 2018-06-06 v1 Logic in Computer Science

Abstract

In this paper we introduce a class of operators on complete lattices called Dynamic Ordered Weighted Averaging (DYOWA) functions. These functions provide a generalized form of an important class of aggregation functions: The Ordered Weighted Averaging (OWA) functions, whose applications can be found in several areas like: Image Processing and Decision Making. The wide range of applications of OWAs motivated many researchers to study their variations. One of them was proposed by Lizassoaim and Moreno in 2013, which extends those functions to complete lattices. Here, we propose a new generalization of OWAs that also generalizes the operators proposed by Lizassoaim and Moreno.

Cite

@article{arxiv.1806.01672,
  title  = {Dynamic Ordered Weighted Averaging Functions for Complete Lattices},
  author = {Antonio Diego S. Farias and Regivan H. N. Santiago and Benjamín Bedregal},
  journal= {arXiv preprint arXiv:1806.01672},
  year   = {2018}
}
R2 v1 2026-06-23T02:19:40.493Z