Open Access
CFM-BD: a distributed rule induction algorithm for building compact fuzzy models in Big Data classification problems
(IEEE, 2020) Elkano Ilintxeta, Mikel; Sanz Delgado, José Antonio; Barrenechea Tartas, Edurne; Bustince Sola, Humberto; Galar Idoate, Mikel; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas
Interpretability has always been a major concern for fuzzy rule-based classifiers. The usage of human-readable models allows them to explain the reasoning behind their predictions and decisions. However, when it comes to Big Data classification problems, fuzzy rule based classifiers have not been able to maintain the good tradeoff between accuracy and interpretability that has characterized these techniques in non-Big-Data environments. The most accurate methods build models composed of a large number of rules and fuzzy sets that are too complex, while those approaches focusing on interpretability do not provide state-of-the-art discrimination capabilities. In this paper, we propose a new distributed learning algorithm named CFM-BD to construct accurate and compact fuzzy rule-based classification systems for Big Data. This method has been specifically designed from scratch for Big Data problems and does not adapt or extend any existing algorithm. The proposed learning process consists of three stages: Preprocessing based on the probability integral transform theorem; rule induction inspired by CHI-BD and Apriori algorithms; and rule selection by means of a global evolutionary optimization. We conducted a complete empirical study to test the performance of our approach in terms of accuracy, complexity, and runtime. The results obtained were compared and contrasted with four state-of-the-art fuzzy classifiers for Big Data (FBDT, FMDT, Chi-Spark-RS, and CHI-BD). According to this study, CFM-BD is able to provide competitive discrimination capabilities using significantly simpler models composed of a few rules of less than three antecedents, employing five linguistic labels for all variables.
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
On admissible orders over closed subintervals of [0,1]
(Elsevier, 2020) Santana, Fagner; Bedregal, Benjamin; Viana, Petrucio; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas
In this paper, we make some considerations about admissible orders on the set of closed subintervals of the unit interval I[0,1], i.e. linear orders that refine the product order on intervals. We propose a new way to generate admissible orders on I[0,1] which is more general than those we find in the current literature. Also, we deal with the possibility of an admissible order on I[0,1] to be isomorphic to the usual order on [0,1]. We prove that some orders constructed by our method are not isomorphic to the usual one and we make some considerations about the following question: is there some admissible order on I[0,1] isomorphic to the usual order on [0,1]?
Open Access
Extensions of fuzzy sets in image processing: an overview
(EUSFLAT, 2011) Pagola Barrio, Miguel; Barrenechea Tartas, Edurne; Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Galar Idoate, Mikel; Jurío Munárriz, Aránzazu; López Molina, Carlos; Paternain Dallo, Daniel; Sanz Delgado, José Antonio; Couto, Pedro; Melo-Pinto, Pedro; Automática y Computación; Automatika eta Konputazioa
This work presents a valuable review for the interested reader of the recent Works using extensions of fuzzy sets in image processing. The chapter is divided as follows: first we recall the basics of the extensions of fuzzy sets, i.e. Type 2 fuzzy sets, interval-valued fuzzy sets and Atanassov’s intuitionistic fuzzy sets. In sequent sections we review the methods proposed for noise removal (sections 3), image enhancement (section 4), edge detection (section 5) and segmentation (section 6). There exist other image segmentation tasks such as video de-interlacing, stereo matching or object representation that are not described in this work.
Open Access
A method for inference in approximate reasoning based on normal intuitionistic fuzzy sets
(Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences, 1995) Bustince Sola, Humberto; Burillo López, Pedro; Mohedano Salillas, Victoria; Automática y Computación; Automatika eta Konputazioa
This paper introduces a method of approximate inference which operates with nornal intuitionistic fuzzy. We give a definition of degree of compatibility between intuitionistic fuzzy sets and we present a method for the construction of these sets. Lastly we present the method of inference in approximate reasoning with normal intuitionistic fuzzy sets and we study its most immediate properties.
Embargo
Construction methods of fuzzy implications on bounded posets
(Elsevier, 2024) Wang, Mei; Zhang, Xiaohong; Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC
The fuzzy implication on bounded lattices was introduced by Palmeira et al., and the method of extending fuzzy implications on bounded lattices by using retraction was provided. However, we find that the extension of fuzzy implications on bounded lattices can also be realized through homomorphism. In order to get better results, we will continue to study this topic in this paper. In particular, we will focus on the construction methods of fuzzy implications on bounded posets. More precisely, we will give some construction methods of fuzzy implications via 0,1-homomorphism on bounded posets. Then we further study two special kinds of fuzzy implications, (Q,N)-implications and RQ-implications on bounded posets, where Q is a quasi-overlap function. Finally, we discuss the distributive laws and the importation laws of (Q,N)-implications and RQ-implications over a quasi-overlap function Q.
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.
Embargo
Fuzzy dissimilarities and the fuzzy choquet integral of triangular fuzzy numbers on [0,1]
(Elsevier, 2025-04-01) Roldán López de Hierro, Antonio Francisco; Cruz, Anderson; Santiago, Regivan; Roldán, Concepción; García-Zamora, Diego; Neres, Fernando; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC
Having in mind the huge amount of data daily registered in the world, it is becoming increasingly important to summarize the information included in a data set. In Statistics and Computer Science, this task is successfully carried out by aggregation functions. One of the most widely applied methodologies of aggregating data is the Choquet integral. The main aim of this paper is to introduce an appropriate notion of Choquet integral in the context of fuzzy numbers. To do this, we face three challenges: the underlying uncertainty when handling fuzzy numbers, the way to order fuzzy numbers by appropriate binary relations and the way to compute the dissimilarity among fuzzy numbers. Illustrative examples are given by involving the α-order on the family of all triangular fuzzy numbers with support on [0,1].
Open Access
Quantifying repressive acts: explanation and challenges of the documentary archive of historical memory in Navarre
(2019) Majuelo Gil, Emilio; Mendiola Gonzalo, Fernando; Garmendia Amutxastegi, Gotzon; Piérola Narvarte, Gemma; García Funes, Juan Carlos; Yániz Berrio, Edurne; Pérez Ibarrola, Nerea; Barrenechea Tartas, Edurne; Rodríguez Martínez, Iosu; Sesma Redín, Rubén; Bustince Sola, Humberto; Ciencias Humanas y de la Educación; Giza eta Hezkuntza Zientziak; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
This document presents the historiographical and methodological foundations of the database of the Documentary Archive of Historical Memory in Navarre, which was developed in the Public University of Navarre following a commission from the Parliament and Government of Navarre. For this purpose a database was elaborated on the Francoist repression with the aim of including the great variety of repressive practices that historiography has identified. This database can be swiftly and easily consulted by the different social, institutional and academic agents. In the first place, the present document provides an assessment of the publication in several autonomous communities in recent years of different online databases on the victims of the civil war and the Francoist repression. Next, it introduces the unit of analysis of our database, “repressive acts”, which it inserts in the historiographical context of the Francoist repression and studies on violence. In the third section, a description is given of the different repressive categories and subcategories in which the repressive acts are framed. Finally, it presents some technical characteristics of the database’s internal organization and software.
Open Access
Funções de agregação baseadas em integral de Choquet aplicadas em redimensionalização de imagens
(Universidade Passo Fundo, 2019) Bueno, Jéssica C. S.; Dias, Camila A.; Pereira Dimuro, Graçaliz; Borges, Eduardo N.; Botelho, Silvia S. C.; Mattos, Viviane L. D. de; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
The increasing data volume, coupled with the high complexity of these data, has generated the need to develop increasingly efficient knowledge extraction techniques, both in computational cost and precision. Most of the problems that are addressed by these techniques have complex information to be identified. For this, machine learning methods are used, where these methods use a variety of functions inside the different steps that are employed in their architectures. One of these consists in the use of aggregation functions to resize images. In this context, a study of aggregation functions based on the Choquet integral is presented, where the main feature of Choquet integral, in comparison with other aggregation functions, resides in the fact that it considers, through the fuzzy measure, the interaction between the elements to be aggregated. Thus, an evaluation study of the performance of the standard Choquet integral functions is presented (Choquet integral based on Copula in relation to the maximum and average functions) looking for results that may be better than the usual applied aggregation functions. The results of such comparisons are promising when evaluated through measures of image quality.