Open Access
Pre-aggregation functions: construction and an application
(IEEE, 2015) Lucca, Giancarlo; Sanz Delgado, José Antonio; Pereira Dimuro, Graçaliz; Bedregal, Benjamin; Mesiar, Radko; Kolesárová, Anna; Bustince Sola, Humberto; Automática y Computación; Automatika eta Konputazioa
In this work we introduce the notion of preaggregation function. Such a function satisfies the same boundary conditions as an aggregation function, but, instead of requiring monotonicity, only monotonicity along some fixed direction (directional monotonicity) is required. We present some examples of such functions. We propose three different methods to build pre-aggregation functions. We experimentally show that in fuzzy rule-based classification systems, when we use one of these methods, namely, the one based on the use of the Choquet integral replacing the product by other aggregation functions, if we consider the minimum or the Hamacher product t-norms for such construction, we improve the results obtained when applying the fuzzy reasoning methods obtained using two classical averaging operators like the maximum and the Choquet integral.
Open Access
Paired structures in knowledge representation
(Elsevier, 2016) Montero, Javier; Bustince Sola, Humberto; Pagola Barrio, Miguel; Fernández Fernández, Francisco Javier; Barrenechea Tartas, Edurne; Automática y Computación; Automatika eta Konputazioa
In this position paper we propose a consistent and unifying view to all those basic knowledge representation models that are based on the existence of two somehow opposite fuzzy concepts. A number of these basic models can be found in fuzzy logic and multi-valued logic literature. Here it is claimed that it is the semantic relationship between two paired concepts what determines the emergence of different types of neutrality, namely indeterminacy, ambivalence and conflict, widely used under different frameworks (possibly under different names). It will be shown the potential relevance of paired structures, generated from two paired concepts together with their associated neutrality, all of them to be modeled as fuzzy sets. In this way, paired structures can be viewed as a standard basic model from which different models arise. This unifying view should therefore allow a deeper analysis of the relationships between several existing knowledge representation formalisms, providing a basis from which more expressive models can be later developed.
Open Access
Hyperspectrum comparison using similarity measures
(IEEE, 2017-08-31) López Molina, Carlos; Marco Detchart, Cedric; Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; López Maestresalas, Ainara; Ayala Martini, Daniela; Automática y Computación; Automatika eta Konputazioa; Proyectos e Ingeniería Rural; Landa Ingeniaritza eta Proiektuak
Similarity measures, as studied in the context of fuzzy set theory, have been proven applicable to many different fields. Surely, their primary role is to model the perceived (dis-) similarity between two fuzzy sets or, equivalently, the linguistic terms they represent. However, the richness of the dedicated study makes the similarity measures portable to other contexts in which quantitative comparison plays a key role. In this work we present the application of similarity measures to hyperspectrum comparison in the context of in-lab hyperspectral imaging for bioengineering.
Open Access
A survey on fingerprint minutiae-based local matching for verification and identification: taxonomy and experimental evaluation
(Elsevier, 2015) Peralta, Daniel; Galar Idoate, Mikel; Triguero, Isaac; Paternain Dallo, Daniel; García, Salvador; Barrenechea Tartas, Edurne; Benítez, José Manuel; Bustince Sola, Humberto; Herrera, Francisco; Automática y Computación; Automatika eta Konputazioa
Fingerprint recognition has found a reliable application for verification or identification of people in biometrics. Globally, fingerprints can be viewed as valuable traits due to several perceptions observed by the experts; such as the distinctiveness and the permanence on humans and the performance in real applications. Among the main stages of fingerprint recognition, the automated matching phase has received much attention from the early years up to nowadays. This paper is devoted to review and categorize the vast number of fingerprint matching methods proposed in the specialized literature. In particular, we focus on local minutiae-based matching algorithms, which provide good performance with an excellent trade-off between efficacy and efficiency. We identify the main properties and differences of existing methods. Then, we include an experimental evaluation involving the most representative local minutiae-based matching models in both verification and evaluation tasks. The results obtained will be discussed in detail, supporting the description of future directions.
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.
Open Access
Improving the performance of fuzzy rule-based classification systems with interval-valued fuzzy sets and genetic amplitude tuning
(Elsevier, 2010) Sanz Delgado, José Antonio; Fernández, Alberto; Bustince Sola, Humberto; Herrera, Francisco; Automática y Computación; Automatika eta Konputazioa
Among the computational intelligence techniques employed to solve classification problems, Fuzzy Rule-Based Classification Systems (FRBCSs) are a popular tool because of their interpretable models based on linguistic variables, which are easier to understand for the experts or end-users. The aim of this paper is to enhance the performance of FRBCSs by extending the Knowledge Base with the application of the concept of Interval-Valued Fuzzy Sets (IVFSs). We consider a post-processing genetic tuning step that adjusts the amplitude of the upper bound of the IVFS to contextualize the fuzzy partitions and to obtain a most accurate solution to the problem. We analyze the goodness of this approach using two basic and well-known fuzzy rule learning algorithms, the Chi et al.’s method and the fuzzy hybrid genetics-based machine learning algorithm. We show the improvement achieved by this model through an extensive empirical study with a large collection of data-sets.
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.
Open Access
A supervised fuzzy measure learning algorithm for combining classifiers
(Elsevier, 2023) Uriz Martín, Mikel Xabier; Paternain Dallo, Daniel; Bustince Sola, Humberto; Galar Idoate, Mikel; Institute of Smart Cities - ISC; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
Fuzzy measure-based aggregations allow taking interactions among coalitions of the input sources into account. Their main drawback when applying them in real-world problems, such as combining classifier ensembles, is how to define the fuzzy measure that governs the aggregation and specifies the interactions. However, their usage for combining classifiers has shown its advantage. The learning of the fuzzy measure can be done either in a supervised or unsupervised manner. This paper focuses on supervised approaches. Existing supervised approaches are designed to minimize the mean squared error cost function, even for classification problems. We propose a new fuzzy measure learning algorithm for combining classifiers that can optimize any cost function. To do so, advancements from deep learning frameworks are considered such as automatic gradient computation. Therefore, a gradient-based method is presented together with three new update policies that are required to preserve the monotonicity constraints of the fuzzy measures. The usefulness of the proposal and the optimization of cross-entropy cost are shown in an extensive experimental study with 58 datasets corresponding to both binary and multi-class classification problems. In this framework, the proposed method is compared with other state-of-the-art methods for fuzzy measure learning.
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].