Open Access
Towards interval uncertainty propagation control in bivariate aggregation processes and the introduction of width-limited interval-valued overlap functions
(Elsevier, 2021) Da Cruz Asmus, Tiago; Pereira Dimuro, Graçaliz; Bedregal, Benjamin; Sanz Delgado, José Antonio; 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
Overlap functions are a class of aggregation functions that measure the overlapping degree between two values. They have been successfully applied as a fuzzy conjunction operation in several problems in which associativity is not required, such as image processing and classification. Interval-valued overlap functions were defined as an extension to express the overlapping of interval-valued data, and they have been usually applied when there is uncertainty regarding the assignment of membership degrees, as in interval-valued fuzzy rule-based classification systems. In this context, the choice of a total order for intervals can be significant, which motivated the recent developments on interval-valued aggregation functions and interval-valued overlap functions that are increasing to a given admissible order, that is, a total order that refines the usual partial order for intervals. Also, width preservation has been considered on these recent works, in an intent to avoid the uncertainty increase and guarantee the information quality, but no deeper study was made regarding the relation between the widths of the input intervals and the output interval, when applying interval-valued functions, or how one can control such uncertainty propagation based on this relation. Thus, in this paper we: (i) introduce and develop the concepts of width-limited interval-valued functions and width limiting functions, presenting a theoretical approach to analyze the relation between the widths of the input and output intervals of bivariate interval-valued functions, with special attention to interval-valued aggregation functions; (ii) introduce the concept of (a,b)-ultramodular aggregation functions, a less restrictive extension of one-dimension convexity for bivariate aggregation functions, which have an important predictable behaviour with respect to the width when extended to the interval-valued context; (iii) define width-limited interval-valued overlap functions, taking into account a function that controls the width of the output interval and a new notion of increasingness with respect to a pair of partial orders (≤1,≤2); (iv) present and compare three construction methods for these width-limited interval-valued overlap functions, considering a pair of orders (≤1,≤2), which may be admissible or not, showcasing the adaptability of our developments.
Open Access
FUZZ-EQ: a data equalizer for boosting the discrimination power of fuzzy classifiers
(Elsevier, 2020) Uriz Martín, Mikel Xabier; Elkano Ilintxeta, Mikel; Bustince Sola, Humberto; Galar Idoate, Mikel; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA13
The definition of linguistic terms is a critical part of the construction of any fuzzy classifier. Fuzzy partitioning methods (FPMs) range from simple uniform partitioning to sophisticated optimization algorithms. In this paper we present FUZZ-EQ, a preprocessing algorithm that facilitates the construc-tion of meaningful fuzzy partitions regardless of the FPM used. The proposed approach is radically different from any existing FPM: instead of adjusting the fuzzy sets to the training data, FUZZ-EQ adjusts the training data to a hypothetical uniform partition before applying any FPM. To do so, the original data distribution is transformed into a uniform distribution by applying the probability integral transform. FUZZ-EQ allows FPMs to provide classifiers with more granularity on high density regions, increasing the overall discrimination capability. Additionally, we describe the procedure to reverse this transformation and recover the interpretability of linguistic terms. To assess the effectiveness of our proposal, we conducted an extensive empirical study consisting of 41 classification tasks and 9 fuzzy classifiers with different FPMs, rule induction algorithms, and rule structures. We also tested the scalability of FUZZ-EQ in Big Data classification problems such as HIGGS, with 11 million examples. Experimental results reveal that FUZZ-EQ significantly boosted the classification performance of those classifiers using the same linguistic terms for all rules, including state-of-the-art classifiers such as FARC-HD or IVTURS.
Open Access
An empirical study on supervised and unsupervised fuzzy measure construction methods in highly imbalanced classification
(IEEE, 2020) Uriz Martín, Mikel Xabier; Paternain Dallo, Daniel; Bustince Sola, Humberto; Galar Idoate, Mikel; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
The design of an ensemble of classifiers involves the definition of an aggregation mechanism that produces a single response obtained from the information provided by the classifiers. A specific aggregation methodology that has been studied in the literature is the use of fuzzy integrals, such as the Choquet or the Sugeno integral, where the associated fuzzy measure tries to represent the interaction existing between the classifiers of the ensemble. However, defining the big number of coefficients of a fuzzy measure is not a trivial task and therefore, many different algorithms have been proposed. These can be split into supervised and unsupervised, each class having different learning mechanisms and particularities. Since there is no clear knowledge about the correct method to be used, in this work we propose an experimental study for comparing the performance of eight different learning algorithms under the same framework of imbalanced dataset. Moreover, we also compare the specific fuzzy integral (Choquet or Sugeno) and their synergies with the different fuzzy measure construction methods.
Open Access
Optical images-based edge detection in Synthetic Aperture Radar images
(Elsevier, 2015) Silva Junior, Gilberto P.; Frery, Alejandro C.; Bustince Sola, Humberto; Barrenechea Tartas, Edurne; Marco Detchart, Cedric; Automática y Computación; Automatika eta Konputazioa
We address the issue of adapting optical images-based edge detection techniques for use in Polarimetric Synthetic Aperture Radar (PolSAR) imagery. We modify the gravitational edge detection technique (inspired by the Law of Universal Gravity) proposed by Lopez-Molina et al., using the non-standard neighbourhood configuration proposed by Fu et al., to reduce the speckle noise in polarimetric SAR imagery. We compare the modified and unmodified versions of the gravitational edge detection technique with the well-established one proposed by Canny, as well as with a recent multiscale fuzzy-based technique proposed by Lopez-Molina et al. We also address the issues of aggregation of gray level images before and after edge detection and of filtering. All techniques addressed here are applied to a mosaic built using class distributions obtained from a real scene, as well as to the true PolSAR image; the mosaic results are assessed using Baddeley’s Delta Metric. Our experiments show that modifying the gravitational edge detection technique with a non-standard neighbourhood configuration produces better results than the original technique, as well as the other techniques used for comparison. The experiments show that adapting edge detection methods from Computational Intelligence for use in PolSAR imagery is a new field worthy of exploration.
Open Access
Some properties of implications via aggregation functions and overlap functions
(Taylor & Francis, 2014) Zapata, Hugo; Bustince Sola, Humberto; Miguel Turullols, Laura de; Guerra Errea, Carlos; Automática y Computación; Automatika eta Konputazioa; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
In this work, using the identification between implication operators and aggregation functions, we study the implication operators that are recovered from overlap functions. In particular, we focus in which properties of implication operators are preserved. We also study how negations can be defined in terms of overlap functions.
Open Access
Some bipolar-preferences-involved aggregation methods for a sequence of OWA weight vectors
(Springer, 2021) Jin, LeSheng; Yager, Ronald R.; Chen, Zhen-Song; Špirková, Jana; Paternain Dallo, Daniel; Mesiar, Radko; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
The ordered weighted averaging (OWA) operator and its associated weight vectors have been both theoretically and practically verified to be powerful and effective in modeling the optimism/pessimism preference of decision makers. When several different OWA weight vectors are offered, it is necessary to develop certain techniques to aggregate them into one OWA weight vector. This study firstly details several motivating examples to show the necessity and usefulness of merging those OWA weight vectors. Then, by applying the general method for aggregating OWA operators proposed in a recent literature, we specifically elaborate the use of OWA aggregation to merge OWA weight vectors themselves. Furthermore, we generalize the normal preference degree in the unit interval into a preference sequence and introduce subsequently the preference aggregation for OWA weight vectors with given preference sequences. Detailed steps in related aggregation procedures and corresponding numerical examples are also provided in the current study.
Open Access
Image reduction using means on discrete product lattices
(IEEE, 2012) Beliakov, Gleb; Bustince Sola, Humberto; Paternain Dallo, Daniel; Automática y Computación; Automatika eta Konputazioa
We investigate the problem of averaging values on lattices, and in particular on discrete product lattices. This problem arises in image processing when several color values given in RGB, HSL, or another coding scheme, need to be combined. We show how the arithmetic mean and the median can be constructed by minimizing appropriate penalties, and we discuss which of them coincide with the Cartesian product of the standard mean and median. We apply these functions in image processing. We present three algorithms for color image reduction based on minimizing penalty functions on discrete product lattices.
Open Access
Strong negations and restricted equivalence functions revisited: an analytical and topological approach
(Elsevier, 2021) Bustince Sola, Humberto; Campión Arrastia, María Jesús; Miguel Turullols, Laura de; Induráin Eraso, Esteban; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Throughout this paper, our main idea is to analyze the concepts of a strong negation and a restricted equivalence function, that appear in a natural way when dealing with theory and applications of fuzzy sets and fuzzy logic. Here we will use an analytical and topological approach, showing how to construct them in an easy way. In particular, we will also analyze some classical functional equation related to those key concepts.
Open Access
Extensión multidimensional de la integral de Choquet discreta y su aplicación en redes neuronales recurrentes
(Universidad de Málaga, 2021) Ferrero Jaurrieta, Mikel; Rodríguez Martínez, Iosu; Pereira Dimuro, Graçaliz; Fernández Fernández, Francisco Javier; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
En este trabajo presentamos una definición de la integral de Choquet discreta n-dimensional, para fusionar datos vectoriales. Como aplicación, utilizamos estas nuevas integrales de Choquet discretas multidimensionales en la fusión de información secuencial en las redes neuronales recurrentes, mejorando los resultados obtenidos mediante el método de agregación tradicional.
Open Access
On generalized overlap and grouping indices in n-dimensional contexts
(Springer, 2025-05-08) Asmus, Tiago da Cruz; Dimuro, Graçaliz Pereira; Lucca, Giancarlo; Marco Detchart, Cedric; Santos, Helida; Camargo, Heloisa A.; 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
Overlap and grouping indices are functions measuring, respectively, the fuzzy intersection and fuzzy union of two fuzzy sets. They have been applied successfully in several fields, such as in interpolative fuzzy systems, fuzzy rule-based classification systems and comparison of fuzzy inference rules. Overlap and grouping indices can be built employing overlap and grouping functions, respectively, which are possibly non-associative aggregation functions with features that provide good results when applied to practical bivariate problems. Many studies have generalized the concepts of overlap and grouping functions to be applied in n-dimensional problems. However, the concepts of overlap/grouping indices have not been generalized in similar pattern. Since the associative property may not hold, their application in n-dimensional domains, for comparing more than two fuzzy sets at a time, is not immediate, which limit their application in such contexts. The objective of this paper is to introduce the concepts of n-dimensional and general overlap/grouping indices, with special attention to the development of their construction methods based on generalized overlap/grouping functions. As an application example, we introduce the concept of n-dimensional Jaccard index, with a construction method based on n-dimensional overlap/grouping indices, providing an n-dimensional fuzzy set similarity score.