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
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
OWA operators based on admissible permutations
(IEEE, 2019) Paternain Dallo, Daniel; Jin, LeSheng; Mesiar, Radko; Vavríková, Lucia; 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 work we propose a new OWA operator defined on bounded convex posets of a vector-lattice. In order to overcome the non-existence of a total order, which is necessary to obtain a non-decreasing arrangement of the input data, we use the concept of admissible permutation. Based on it, our proposal calculates the different ways in which the input vector could be arranged, always respecting the partial order. For each admissible arrangement, we calculate an intermediate value which is finally collected and averaged by means of the arithmetic mean. We analyze several properties of this operator and we give some counterexamples of those properties of aggregation functions which are not satisfied.
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
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
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.
Open Access
Enhancing LSTM for sequential image classification by modifying data aggregation
(IEEE, 2021) Takáč, Zdenko; Ferrero Jaurrieta, Mikel; Horanská, Lubomíra; Krivonakova, Nada; Pereira Dimuro, Graçaliz; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Recurrent Neural Networks (RNN) model sequential information and are commonly used for the analysis of time series. The most usual operation to fuse information in RNNs is the sum. In this work, we use a RNN extended type, Long Short-Term Memory (LSTM) and we use it for image classification, to which we give a sequential interpretation. Since the data used may not be independent to each other, we modify the sum operator of an LSTM unit using the n-dimensional Choquet integral, which considers possible data coalitions. We compare our methods to those based on usual aggregation functions, using the datasets Fashion-MNIST and MNIST.
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
VCI-LSTM: Vector choquet integral-based long short-term memory
(IEEE, 2022) Ferrero Jaurrieta, Mikel; Takáč, Zdenko; Fernández Fernández, Francisco Javier; Horanská, Lubomíra; Pereira Dimuro, Graçaliz; Montes Rodríguez, Susana; Díaz, Irene; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika
Choquet integral is a widely used aggregation operator on one-dimensional and interval-valued information, since it is able to take into account the possible interaction among data. However, there are many cases where the information taken into account is vectorial, such as Long Short-Term Memories (LSTM). LSTM units are a kind of Recurrent Neural Networks that have become one of the most powerful tools to deal with sequential information since they have the power of controlling the information flow. In this paper, we first generalize the standard Choquet integral to admit an input composed by $n$-dimensional vectors, which produces an $n$-dimensional vector output. We study several properties and construction methods of vector Choquet integrals. Then, we use this integral in the place of the summation operator, introducing in this way the new VCI-LSTM architecture. Finally, we use the proposed VCI-LSTM to deal with two problems: sequential image classification and text classification.
Open Access
Aggregation functions based on the Choquet integral applied to image resizing
(Atlantis Press, 2019) Bueno, Jéssica C. S.; Dias, Camila A.; Pereira Dimuro, Graçaliz; Santos, Helida; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas
The rising volume of data and its high complexity has brought the need of developing increasingly efficient knowledge extraction techniques, which demands efficiency both in computational cost and in accuracy. Most of problems that are handled by these techniques has complex information to be identified. So, machine learning methods are frequently used, where a variety of functions can be applied in the different steps that are employed in their architecture. One of them is the use of aggregation functions aiming at resizing images. In this context, we introduce a study of aggregation functions based on the Choquet integral, whose main characteristic in comparison with other aggregation functions is that it considers, through fuzzy measure, the interaction between the elements to be aggregated. Thus, our main goal is to present an evaluation study of the performance of the standard Choquet integral the and copula-based generalization of the Choquet integral in relation to the maximum and mean functions, looking for results that may be better than the aggregation functions commonly applied. The results of such comparisons are promising, when evaluated through image quality metrics.