Open Access
Enhancing the efficiency of the interval-valued fuzzy rule-based classifier with tuning and rule selection
(Springer, 2020) Sanz Delgado, José Antonio; Da Cruz Asmus, Tiago; Osa Hernández, Borja de la; Bustince Sola, Humberto; Institute of Smart Cities - ISC; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA1926
Interval-Valued fuzzy rule-based classifier with TUning and Rule Selection, IVTURS, is a state-of-the-art fuzzy classifier. One of the key point of this method is the usage of interval-valued restricted equivalence functions because their parametrization allows one to tune them to each problem, which leads to obtaining accurate results. However, they require the application of the exponentiation several times to obtain a result, which is a time demanding operation implying an extra charge to the computational burden of the method. In this contribution, we propose to reduce the number of exponentiation operations executed by the system, so that the efficiency of the method is enhanced with no alteration of the obtained results. Moreover, the new approach also allows for a reduction on the search space of the evolutionary method carried out in IVTURS. Consequently, we also propose four different approaches to take advantage of this reduction on the search space to study if it can imply an enhancement of the accuracy of the classifier. The experimental results prove: 1) the enhancement of the efficiency of IVTURS and 2) the accuracy of IVTURS is competitive versus that of the approaches using the reduced search space.
Open Access
Affine construction methodology of aggregation functions
(Elsevier, 2020) Roldán López de Hierro, Antonio Francisco; Roldán, Concepción; Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Rodríguez Martínez, Iosu; Fardoun, Habib; Lafuente López, Julio; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Aggregation functions have attracted much attention in recent times because of its potential use in many areas such us data fusion and decision making. In practice, most of the aggregation functions that scientists use in their studies are constructed from very simple (usually affine or polynomial) functions. However, these are distinct in nature. In this paper, we develop a systematic study of these two classes of functions from a common point of view. To do this, we introduce the class of affine aggregation functions, which cover both the aforementioned families and most of examples of aggregation functions that are used in practice, including, by its great applicability, the symmetric case. Our study allows us to characterize when a function constructed from affine or polynomial functions is, in fact, a new aggregation function. We also study when sums or products of this kind of functions are again an aggregation function.
Open Access
Comprehensive rules-based and preferences induced weights allocation in group decision-making with BUI
(Springer, 2022) Li, GePeng; Yager, Ronald R.; Zhang, XinXing; Mesiar, Radko; Jin, LeSheng; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Decision-makers' subjective preferences can be well modeled using preference aggregation operators and related induced weights allocation mechanisms. However, when several different types of preferences occur in some decision environment with more complex uncertainties, repeated uses of preferences induced weights allocation sometimes become unsuitable or less reasonable. In this work, we discuss a common decision environment where several invited experts will offer their respective evaluation values for a certain object. There are three types of preferences which will significantly affect the weights allocations from experts. Instead of unsuitably performing preference induced weights allocation three times independently and then merging the results together using convex combination as some literatures recently did, in this work, we propose some organic and comprehensive rules-based screen method to first rule out some unqualified experts and then take preference induced weights allocation for the refined group of experts. A numerical example in business management and decision-making is presented to show the cognitive reasonability and practical feasibility. © 2022, The Author(s).
Open Access
T-overlap t-migrative functions: a generalization of migrativity in t-overlap functions
(Universidad Distrital Francisco José de Caldas (Colombia), 2020) Zapata, Hugo; Bustince Sola, Humberto; Pereira Dimuro, Graçaliz; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Este artículo introduce una generalización de funciones migrativas por extensión de la condición de la operación producto aplicada en las variables. Más específicamente, en lugar de exigir multiplicar la variable x por un número real alfa; en este trabajo se trabaja este número alfa con las variables de acuerdo a una t-norma. Se denomina a esta generalización función t-migrativa con respecto a tal tnorma. Luego se analizan las propiedades principales de funciones t-migrativas en funciones t-overlap y se introducen algunos métodos de construcción de este tipo de funciones.
Open Access
Reemplazo de la función de pooling de redes neuronales convolucionales por combinaciones lineales de funciones crecientes
(Universidad de Málaga, 2021) Rodríguez Martínez, Iosu; Lafuente López, Julio; Sesma Sara, Mikel; Herrera, Francisco; Ursúa Medrano, Pablo; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Las redes convolucionales llevan a cabo un proceso automatico de extracción y fusión de características mediante el cual obtienen la información más relevante de una imagen dada. El proceso de submuestreo mediante el cual se fusionan características localmente próximas, conocido como ‘pooling’, se lleva a cabo tradicionalmente con funciones sencillas como el máximo o la media aritmética, ignorando otras opciones muy populares en el campo de la teoría de agregaciones. En este trabajo proponemos reemplazar dichas funciones por otra serie de ordenes estadísticos, así como por la integral de Sugeno y una nueva generalización de la misma. Además, basándonos en trabajos que emplean la combinación convexa del máximo y la media, presentamos una nueva capa que permite combinar varias de las nuevas agregaciones, mejorando sus resultados individuales.
Open Access
Penalty function in optimization problems: a review of recent developments
(Springer, 2018) Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Burillo López, Pedro; Automática y Computación; Automatika eta Konputazioa; Institute of Smart Cities - ISC
In this chapter we make a brief revision of some recent developments on the notion of penalty function as a tool for the fusion of information, including the most recently published definition as well as the extension of the concept to the lattice setting.
Embargo
From type-(2,k) grouping indices to type-(2,k) Jaccard indices
(Elsevier, 2025-02-01) Roldán López de Hierro, Antonio Francisco; Roldán, Concepción; Guerra Errea, Carlos; Fernández Fernández, Francisco Javier; Cruz, Anderson; Moraes, Ronei Marcos de; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
In this work, we introduce the notion of grouping index for type-2 fuzzy sets as a measure of how far the union of two type-2 fuzzy sets over the same universe is from the total universe. We also show how we can extend the notion of the Jaccard index to the type-2 setting by means of type-2 grouping and overlap indexes.
Open Access
Image feature extraction using OD-monotone functions
(Springer, 2018) Marco Detchart, Cedric; López Molina, Carlos; Fernández Fernández, Francisco Javier; Pagola Barrio, Miguel; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas
Edge detection is a basic technique used as a preliminary step for, e.g., object extraction and recognition in image processing. Many of the methods for edge detection can be fit in the breakdown structure by Bezdek, in which one of the key parts is feature extraction. This work presents a method to extract edge features from a grayscale image using the so-called ordered directionally monotone functions. For this purpose we introduce some concepts about directional monotonicity and present two construction methods for feature extraction operators. The proposed technique is competitive with the existing methods in the literature. Furthermore, if we combine the features obtained by different methods using penalty functions, the results are equal or better results than stateof-the-art methods.
Open Access
Convolution lattices
(Elsevier, 2018) Miguel Turullols, Laura de; Bustince Sola, Humberto; Baets, Bernard de; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
We propose two convolution operations on the set of functions between two bounded lattices and investigate the algebraic structure they constitute, in particular the lattice laws they satisfy. Each of these laws requires the restriction to a specific subset of functions, such as normal, idempotent or convex functions. Combining all individual results, we identify the maximal subsets of functions resulting in a bounded lattice, and show this result to be equivalent to the distributivity of the lattice acting as domain of the functions. Furthermore, these lattices turn out to be distributive as well. Additionally, we show that for the larger subset of idempotent functions, although not satisfying the absorption laws, the convolution operations satisfy the Birkhoff equation.
Open Access
Pseudo overlap functions, fuzzy implications and pseudo grouping functions with applications
(MDPI, 2022) Zhang, Xiaohong; Liang, Rong; Bustince Sola, Humberto; Bedregal, Benjamin; Fernández Fernández, Francisco Javier; Li, Mengyuan; Ou, Qiqi; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Overlap and grouping functions are important aggregation operators, especially in information fusion, classification and decision-making problems. However, when we do more in-depth application research (for example, non-commutative fuzzy reasoning, complex multi-attribute decision making and image processing), we find overlap functions as well as grouping functions are required to be commutative (or symmetric), which limit their wide applications. For the above reasons, this paper expands the original notions of overlap functions and grouping functions, and the new concepts of pseudo overlap functions and pseudo grouping functions are proposed on the basis of removing the commutativity of the original functions. Some examples and construction methods of pseudo overlap functions and pseudo grouping functions are presented, and the residuated implication (co-implication) operators derived from them are investigated. Not only that, some applications of pseudo overlap (grouping) functions in multi-attribute (group) decision-making, fuzzy mathematical morphology and image processing are discussed. Experimental results show that, in many application fields, pseudo overlap functions and pseudo grouping functions have greater flexibility and practicability.