Open Access
Directional monotonicity of multidimensional fusion functions with respect to admissible orders
(Elsevier, 2023-03-09) Sesma Sara, Mikel; Bustince Sola, Humberto; Mesiar, Radko; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA25-2022
The notion of directional monotonicity emerged as a relaxation of the monotonicity condition of aggregation functions. As the extension of aggregation functions to fuse more complex information than numeric data, directional monotonicity was extended to the framework of multidimensional data, with respect to the product order, which is a partial order. In this work, we present the notion of admissible order for multidimensional data and we define the concept of directional monotonicity for multidimensional fusion functions with respect to an admissible order. Moreover, we study the main properties of directionally monotone functions in this new context. We conclude that, while some of the properties are still valid (e.g. the set of directions of increasingness is still closed under convex combinations), some of the main ones no longer hold (e.g. there does not exist a finite set of directions that characterize standard monotonicity in terms of directional monotonicity).
Open Access
Operador de comparación de elementos multivaluados basado en funciones de equivalencia restringida
(Universidad de Málaga, 2021) Castillo López, Aitor; López Molina, Carlos; Fernández Fernández, Francisco Javier; Sesma Sara, Mikel; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
En este trabajo proponemos un nuevo enfoque del algoritmo de clustering gravitacional basado en lo que Einstein considero su 'mayor error': la constante cosmológica. De manera similar al algoritmo de clustering gravitacional, nuestro enfoque está inspirado en principios y leyes del cosmos, y al igual que ocurre con la teoría de la relatividad de Einstein y la teoría de la gravedad de Newton, nuestro enfoque puede considerarse una generalización del agrupamiento gravitacional, donde, el algoritmo de clustering gravitacional se recupera como caso límite. Además, se desarrollan e implementan algunas mejoras que tienen como objetivo optimizar la cantidad de iteraciones finales, y de esta forma, se reduce el tiempo de ejecución tanto para el algoritmo original como para nuestra versión.
Open Access
Local properties of strengthened ordered directional and other forms of monotonicity
(Springer, 2019) Sesma Sara, Mikel; Miguel Turullols, Laura de; Mesiar, Radko; Fernández Fernández, Francisco Javier; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA13
In this study we discuss some of the recent generalized forms of monotonicity, introduced in the attempt of relaxing the monotonicity condition of aggregation functions. Specifically, we deal with weak, directional, ordered directional and strengthened ordered directional monotonicity. We present some of the most relevant properties of the functions that satisfy each of these monotonicity conditions and, using the concept of pointwise directional monotonicity, we carry out a local study of the discussed relaxations of monotonicity. This local study enables to highlight the differences between each notion of monotonicity. We illustrate such differences with an example of a restricted equivalence function.
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
New classes of the moderate deviation functions
(Springer Nature, 2021) Špirková, Jana; Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Sesma Sara, Mikel; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
At present, in the field of aggregation of various input values, attention is focused on the construction of aggregation functions using other functions that can affect the resulting aggregated value. This resulting value should characterize the properties of the individual input values as accurately as possible. Attention is also paid to aggregation using the so-called moderate deviation function. Using this function in aggregation ensures that all properties of aggregation functions are preserved. This work offers constructions of the moderate deviation functions using negations and automorphisms on the symmetric interval [−1, 1] and a general closed interval [a, b] ⊂ [−∞, ∞].
Open Access
Enhancing DreamBooth with LoRA for generating unlimited characters with stable diffusion
(IEEE, 2024-09-09) Pascual Casas, Rubén; Maiza Coupin, Adrián Mikel; Sesma Sara, Mikel; Paternain Dallo, Daniel; Galar Idoate, Mikel; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA2023-11377
This paper addresses the challenge of generating unlimited new and distinct characters that encompass the style and shared visual characteristics of a limited set of human designed characters. This is a relevant problem in the audiovisual industry, as the ability to rapidly produce original characters that adhere to specific characteristics greatly increases the possibilities in the production of movies, series, or video games. Our solution is built upon DreamBooth, a widely extended fine-tuning method for text-to-image models. We propose an adaptation focusing on two main challenges: the impracticality of relying on detailed image prompts for character description and the few-shot learning scenario with a limited set of characters available for training. To solve these issues, we introduce additional character-specific tokens to DreamBooth training and remove its class-specific regularization dataset. For an unlimited generation of characters, we propose the usage of random tokens and random embeddings. This proposal is tested on two specialized datasets and the results shows our method¿s capability to produce diverse characters that adhere to a style and visual characteristics. An ablation study to analyze the contributions of the proposed modifications is also developed.
Open Access
A framework for generalized monotonicity of fusion functions
(Elsevier, 2023) Sesma Sara, Mikel; Šeliga, Adam; Boczek, Michał; Jin, LeSheng; Kaluszka, Marek; Kalina, Martin; Bustince Sola, Humberto; Mesiar, Radko; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
The relaxation of the property of monotonicity is a trend in the theory of aggregation and fusion functions and several generalized forms of monotonicity have been introduced, most of which are based on the notion of directional monotonicity. In this paper, we propose a general framework for generalized monotonicity that encompasses the different forms of monotonicity that we can find in the literature. Additionally, we introduce various new forms of monotonicity that are not based on directional monotonicity. Specifically, we introduce dilative monotonicity, which requires that the function increases when the inputs have increased by a common factor, and a general form of monotonicity that is dependent on a function T and a subset of the domain Z. This two new generalized monotonicities are the basis to propose a set of different forms of monotonicity. We study the particularities of each of the new proposals and their links to the previous relaxed forms of monotonicity. We conclude that the introduction of dilative monotonicity complements the conditions of weak monotonicity for fusion functions and that (T,Z)-monotonicity yields a condition that is slightly stronger than weak monotonicity. Finally, we present an application of the introduced notions of monotonicity in sentiment analysis.
Open Access
A fuzzy association rule-based classifier for imbalanced classification problems
(Elsevier, 2021) Sanz Delgado, José Antonio; Sesma Sara, Mikel; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
Imbalanced classification problems are attracting the attention of the research community because they are prevalent in real-world problems and they impose extra difficulties for learning methods. Fuzzy rule-based classification systems have been applied to cope with these problems, mostly together with sampling techniques. In this paper, we define a new fuzzy association rule-based classifier, named FARCI, to tackle directly imbalanced classification problems. Our new proposal belongs to the algorithm modification category, since it is constructed on the basis of the state-of-the-art fuzzy classifier FARC–HD. Specifically, we modify its three learning stages, aiming at boosting the number of fuzzy rules of the minority class as well as simplifying them and, for the sake of handling unequal fuzzy rule lengths, we also change the matching degree computation, which is a key step of the inference process and it is also involved in the learning process. In the experimental study, we analyze the effectiveness of each one of the new components in terms of performance, F-score, and rule base size. Moreover, we also show the superiority of the new method when compared versus FARC–HD alongside sampling techniques, another algorithm modification approach, two cost-sensitive methods and an ensemble.
Open Access
Strengthened ordered directional and other generalizations of monotonicity for aggregation functions
(Springer, 2018) Sesma Sara, Mikel; Miguel Turullols, Laura de; Lafuente López, Julio; Barrenechea Tartas, Edurne; Mesiar, Radko; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
A tendency in the theory of aggregation functions is the generalization of the monotonicity condition. In this work, we examine the latest developments in terms of different generalizations. In particular, we discuss strengthened ordered directional monotonicity, its relation to other types of monotonicity, such as directional and ordered directional monotonicity and the main properties of the class of functions that are strengthened ordered directionally monotone. We also study some construction methods for such functions and provide a characterization of usual monotonicity in terms of these notions of monotonicity.
Open Access
Linking mathematical morphology and L-fuzzy concepts
(World Scientific, 2017) Alcalde, Cristina; Burusco Juandeaburre, Ana; Bustince Sola, Humberto; Fuentes González, Ramón; Sesma Sara, Mikel; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
In this paper we study the relation between L-fuzzy morphology and L-fuzzy concepts over complete lattices. In particular, we show how the erosion and dilation operators of the former can be understood in terms of the derivation operators of the latter, even when the set of objects is different from the set of attributes.