Artículos de revista DAC - AKS Aldizkari artikuluak

Permanent URI for this collection

http://hdl.handle.net/2454/10465

Browse

Browsing Artículos de revista DAC - AKS Aldizkari artikuluak by Subject "Aggregation functions"

Now showing 1 - 3 of 3
  • Thumbnail Image
    PublicationOpen Access
    General overlap functions
    (Elsevier, 2019) Miguel Turullols, Laura de; Gómez, Daniel; Tinguaro, Javier; Montero, Javier; Bustince Sola, Humberto; Pereira Dimuro, Graçaliz; Sanz, Jose Antonio; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa.
    As a generalization of bivariate overlap functions, which measure the degree of overlapping (intersection for non-crisp sets) of n different classes, in this paper we introduce the concept of general overlap functions. We characterize the class of general overlap functions and include some construction methods by means of different aggregation and bivariate overlap functions. Finally, we apply general overlap functions to define a new matching degree in a classification problem. We deduce that the global behavior of these functions is slightly better than some other methods in the literature.
  • Thumbnail Image
    PublicationOpen Access
    Pre-aggregation functions: construction and an application
    (IEEE, 2015) Lucca, Giancarlo; Sanz Delgado, José Antonio; Pereira Dimuro, Graçaliz; Bedregal, Benjamin; Mesiar, Radko; Kolesárová, Anna; Bustince Sola, Humberto; Automática y Computación; Automatika eta Konputazioa
    In this work we introduce the notion of preaggregation function. Such a function satisfies the same boundary conditions as an aggregation function, but, instead of requiring monotonicity, only monotonicity along some fixed direction (directional monotonicity) is required. We present some examples of such functions. We propose three different methods to build pre-aggregation functions. We experimentally show that in fuzzy rule-based classification systems, when we use one of these methods, namely, the one based on the use of the Choquet integral replacing the product by other aggregation functions, if we consider the minimum or the Hamacher product t-norms for such construction, we improve the results obtained when applying the fuzzy reasoning methods obtained using two classical averaging operators like the maximum and the Choquet integral.
  • Thumbnail Image
    PublicationOpen Access
    Unbalanced interval-valued OWA operators
    (Springer Berlin Heidelberg, 2016) Miguel Turullols, Laura de; Bustince Sola, Humberto; Barrenechea Tartas, Edurne; Pagola Barrio, Miguel; Fernández Fernández, Francisco Javier; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
    In this work, we introduce a new class of functions defned on the interval-valued setting. These functions extend classical OWA operators but allow for diferent weighting vectors to handle the lower bounds and the upper bounds of the considered intervals. As a consequence, the resulting functions need not be an interval-valued aggregation function, so we study, in the case of the lexicographical order, when these operators give an interval as output and are monotone. We also discuss an illustrative example on a decision making problem in order to show the usefulness of our developments.