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
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
Interval subsethood measures with respect to uncertainty for the interval-valued fuzzy setting
(Atlantis Press, 2020) Pekala, Barbara; Bentkowska, Urszula; Sesma Sara, Mikel; Fernández Fernández, Francisco Javier; Lafuente López, Julio; Altalhi, A. H.; Knap, Maksymilian; Bustince Sola, Humberto; Pintor Borobia, Jesús María; Estatistika, Informatika eta Matematika; Ingeniaritza; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas; Ingeniería
In this paper, the problem of measuring the degree of subsethood in the interval-valued fuzzy setting is addressed. Taking into account the widths of the intervals, two types of interval subsethood measures are proposed. Additionally, their relation and main properties are studied. These developments are made both with respect to the regular partial order of intervals and with respect to admissible orders. Finally, some construction methods of the introduced interval subsethood measures with the use interval-valued aggregation functions are examined.
Open Access
F-homogeneous functions and a generalization of directional monotonicity
(Wiley, 2022) Santiago, Regivan; Sesma Sara, Mikel; Fernández Fernández, Francisco Javier; Takáč, Zdenko; Mesiar, Radko; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
A function that takes (Formula presented.) numbers as input and outputs one number is said to be homogeneous whenever the result of multiplying each input by a certain factor (Formula presented.) yields the original output multiplied by that same factor. This concept has been extended by the notion of abstract homogeneity, which generalizes the product in the expression of homogeneity by a general function (Formula presented.) and the effect of the factor (Formula presented.) by an automorphism. However, the effect of parameter (Formula presented.) remains unchanged for all the input values. In this study, we generalize further the condition of abstract homogeneity by introducing (Formula presented.) -homogeneity, which is defined with respect to a family of functions, enabling a different behavior for each of the inputs. Next, we study the properties that are satisfied by this family of functions and, moreover, we link this concept with the condition of directional monotonicity, which is a trendy property in the framework of aggregation functions. To achieve that, we generalize directional monotonicity by (Formula presented.) directional monotonicity, which is defined with respect to a family of functions (Formula presented.) and a family of vectors (Formula presented.). Finally, we show how the introduced concepts could be applied in two different problems of computer vision: a snow detection problem and image thresholding improvement. © 2022 The Authors. International Journal of Intelligent Systems published by Wiley Periodicals LLC.
Open Access
Generación ilimitada de personajes mediante Stable Diffusion con DreamBooth y LoRA
(CAEPIA, 2024) 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; Gobierno de Navarra / Nafarroako Gobernua
Este artículo aborda el reto de generar un número ilimitado de personajes nuevos, y distintos, que engloben el estilo y las características visuales compartidas de un conjunto limitado de personajes diseñados por un humano. Este es un problema de gran relevancia en la industria audiovisual, ya que la capacidad de producir rápidamente personajes originales que se adhieran a unas características específicas aumenta enormemente las posibilidades en la producción de películas, series o videojuegos. Nuestra solución se basa en DreamBooth, un método de ajuste de modelos generativos de texto a imagen ampliamente extendido. Proponemos una adaptación centrada en dos retos principales: lo poco práctico que resulta utilizar prompts detallados de las imágenes para describir los personajes y la complejidad del ajuste de modelos a partir de un conjunto limitado de personajes. Para resolver estos problemas, introducimos en el entrenamiento de DreamBooth tokens adicionales específicos para cada personaje y eliminamos el conjunto de datos de regularización. Para generar personajes de manera ilimitada, proponemos el uso de tokens y embeddings aleatorios. Comprobamos la utilidad de la propuesta utilizando dos conjuntos de datos diferentes. Los resultados obtenidos muestran la capacidad de nuestro método para producir personajes diversos que se adhieren a un estilo y a unas características visuales concretas. Finalmente, desarrollamos un estudio de ablación.