Open Access
From restricted equivalence functions on Ln to similarity measures between fuzzy multisets
(IEEE, 2023) Ferrero Jaurrieta, Mikel; Takáč, Zdenko; Rodríguez Martínez, Iosu; Marco Detchart, Cedric; Bernardini, Ángela; Fernández Fernández, Francisco Javier; López Molina, Carlos; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Restricted equivalence functions are well-known functions to compare two numbers in the interval between 0 and 1. Despite the numerous works studying the properties of restricted equivalence functions and their multiple applications as support for different similarity measures, an extension of these functions to an n-dimensional space is absent from the literature. In this paper, we present a novel contribution to the restricted equivalence function theory, allowing to compare multivalued elements. Specifically, we extend the notion of restricted equivalence functions from L to L n and present a new similarity construction on L n . Our proposal is tested in the context of color image anisotropic diffusion as an example of one of its many applications.
Open Access
Reduction of complexity using generators of pseudo-overlap and pseudo-grouping functions
(2024) Ferrero Jaurrieta, Mikel; Paiva, Rui; Cruz, Anderson; Bedregal, Benjamin; Zhang, Xiaohong; Takáč, Zdenko; López Molina, Carlos; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Overlap and grouping functions can be used to measure events in which we must consider either the maximum or the minimum lack of knowledge. The commutativity of overlap and grouping functions can be dropped out to introduce the notions of pseudo-overlap and pseudo-grouping functions, respectively. These functions can be applied in problems where distinct orders of their arguments yield different values, i.e., in non-symmetric contexts. Intending to reduce the complexity of pseudo-overlap and pseudo-grouping functions, we propose new construction methods for these functions from generalized concepts of additive and multiplicative generators. We investigate the isomorphism between these families of functions. Finally, we apply these functions in an illustrative problem using them in a time series prediction combined model using the IOWA operator to evidence that using these generators and functions implies better performance.
Open Access
Generalizando el pooling maximo por funciones (a, b)-grouping en redes neuronales convolucionales
(CAEPIA, 2024) Rodríguez Martínez, Iosu; Da Cruz Asmus, Tiago; Pereira Dimuro, Graçaliz; Herrera, Francisco; Takáč, Zdenko; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Gobierno de Navarra / Nafarroako Gobernua
Este artículo es un resumen del trabajo publicado en la revista Information Fusion [1]. En este artículo explorábamos el reemplazo del operador de pooling máximo comunmente empleado en redes neuronales convolucionales (CNNs) por funciones (a, b)-grouping. Estas funciones extienden el concepto de función de grouping clásica [2] a un intervalo cerrado [a, b], siguiendo la filosofía de [3]. En el contexto del operador de pooling, estas nuevas funciones ayudan a la optimización de los modelos suavizando los gradientes en el proceso de retropropagación y obteniendo resultados competitivos con métodos más complejos
Open Access
Generalizing max pooling via (a, b)-grouping functions for convolutional neural networks
(Elsevier, 2023) Rodríguez Martínez, Iosu; Da Cruz Asmus, Tiago; Pereira Dimuro, Graçaliz; Herrera, Francisco; Takáč, Zdenko; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
Due to their high adaptability to varied settings and effective optimization algorithm, Convolutional Neural Networks (CNNs) have set the state-of-the-art on image processing jobs for the previous decade. CNNs work in a sequential fashion, alternating between extracting significant features from an input image and aggregating these features locally through ‘‘pooling" functions, in order to produce a more compact representation. Functions like the arithmetic mean or, more typically, the maximum are commonly used to perform this downsampling operation. Despite the fact that many studies have been devoted to the development of alternative pooling algorithms, in practice, ‘‘max-pooling" still equals or exceeds most of these possibilities, and has become the standard for CNN construction. In this paper we focus on the properties that make the maximum such an efficient solution in the context of CNN feature downsampling and propose its replacement by grouping functions, a family of functions that share those desirable properties. In order to adapt these functions to the context of CNNs, we present (𝑎, 𝑏)- grouping functions, an extension of grouping functions to work with real valued data. We present different construction methods for (𝑎, 𝑏)-grouping functions, and demonstrate their empirical applicability for replacing max-pooling by using them to replace the pooling function of many well-known CNN architectures, finding promising results.
Open Access
De funciones de equivalencia restringida en Lⁿ a medidas de similitud entre multiconjuntos difusos
(CAEPIA, 2024) Ferrero Jaurrieta, Mikel; Rodríguez Martínez, Iosu; Bernardini, Ángela; Fernández Fernández, Francisco Javier; López Molina, Carlos; Bustince Sola, Humberto; Takáč, Zdenko; Marco Detchart, Cedric; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC
Este artículo es un resumen del trabajo publicado en la revista IEEE Transactions on Fuzzy Systems. En este trabajo, presentamos una contribución a la teoría de las Funciones de Equivalencia Restringida (REF), que permite comparar elementos multivaluados. Extendemos el concepto de REF de L a Ln y presentamos una nueva construcción de similitud en Ln. A partir de esta filosofía se construyen medidas de similitud entre multiconjuntos difusos y se presenta un ejemplo aplicado en el contexto de la difusión anisotrópica de imágenes en color.
Embargo
Degree of totalness: how to choose the best admissible permutation for vector fuzzy integration
(Elsevier, 2023-08-30) Ferrero Jaurrieta, Mikel; Horanská, Lubomíra; Lafuente López, Julio; Mesiar, Radko; Pereira Dimuro, Graçaliz; Takáč, Zdenko; Gómez Fernández, Marisol; Fernández Fernández, Francisco Javier; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
The use of aggregation operators that require ordering of the data brings a problem when the structures to be aggregated are multi-valued, since there may be several admissible orders. To addressing this problem, the concept of admissible permutation was introduced for intervals. In this paper we extend this concept to vector domain. However, the problem of selecting the best possible permutation is still an open problem. In this paper we present a novel concept in order to choose the best admissible permutation for vectors: the degree of totalness. This concept allows us to represent to which degree the admissible permutation reorder given vectors as a chain with respect to the partial order. Finally, from the best admissible permutation we construct the Choquet integral.
Open Access
A study on the suitability of different pooling operators for convolutional neural networks in the prediction of COVID-19 through chest x-ray image analysis
(Elsevier, 2024) Rodríguez Martínez, Iosu; Ursúa Medrano, Pablo; Fernández Fernández, Francisco Javier; Takáč, Zdenko; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
The 2019 coronavirus disease outbreak, caused by the severe acute respiratory syndrome type-2 virus (SARS-CoV-2), was declared a pandemic in March 2020. Since its emergence to the present day, this disease has brought multiple countries to the brink of health care collapse during several waves of the disease. One of the most common tests performed on patients is chest x-ray imaging. These images show the severity of the patient's illness and whether it is indeed covid or another type of pneumonia. Automated assessment of this type of imaging could alleviate the time required for physicians to treat and diagnose each patient. To this end, in this paper we propose the use of Convolutional Neural Networks (CNNs) to carry out this process. The aim of this paper is twofold. Firstly, we present a pipeline adapted to this problem, covering all steps from the preprocessing of the datasets to the generation of classification models based on CNNs. Secondly, we have focused our study on the modification of the information fusion processes of this type of architectures, in the pooling layers. We propose a number of aggregation theory functions that are suitable to replace classical processes and have shown their benefits in past applications, and study their performance in the context of the x-ray classification problem. We find that replacing the feature reduction processes of CNNs leads to drastically different behaviours of the final model, which can be beneficial when prioritizing certain metrics such as precision or recall.
Embargo
Non-symmetric over-time pooling using pseudo-grouping functions for convolutional neural networks
(Elsevier, 2024-07-01) Ferrero Jaurrieta, Mikel; Paiva, Rui; Cruz, Anderson; Bedregal, Benjamin; Miguel Turullols, Laura de; Takáč, Zdenko; López Molina, Carlos; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC
Convolutional Neural Networks (CNNs) are a family of networks that have become state-of-the-art in several fields of artificial intelligence due to their ability to extract spatial features. In the context of natural language processing, they can be used to build text classification models based on textual features between words. These networks fuse local features to generate global features in their over-time pooling layers. These layers have been traditionally built using the maximum function or other symmetric functions such as the arithmetic mean. It is important to note that the order of input local features is significant (i.e. the symmetry is not an inherent characteristic of the model). While this characteristic is appropriate for image-oriented CNNs, where symmetry might make the network robust to image rigid transformations, it seems counter-productive for text processing, where the order of the words is certainly important. Our proposal is, hence, to use non-symmetric pooling operators to replace the maximum or average functions. Specifically, we propose to perform over-time pooling using pseudo-grouping functions, a family of non-symmetric aggregation operators that generalize the maximum function. We present a construction method for pseudo-grouping functions and apply different examples of this family to over-time pooling layers in text-oriented CNNs. Our proposal is tested on seven different models and six different datasets in the context of engineering applications, e.g. text classification. The results show an overall improvement of the models when using non-symmetric pseudo-grouping functions over the traditional pooling function.