Bedregal, Benjamin
Loading...
Email Address
person.page.identifierURI
Birth Date
Job Title
Last Name
Bedregal
First Name
Benjamin
person.page.departamento
Ingeniería Eléctrica, Electrónica y de Comunicación
person.page.instituteName
ORCID
person.page.observainves
person.page.upna
Name
- Publications
- item.page.relationships.isAdvisorOfPublication
- item.page.relationships.isAdvisorTFEOfPublication
- item.page.relationships.isAuthorMDOfPublication
26 results
Search Results
Now showing 1 - 10 of 26
Publication 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 - ISCConvolutional 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.Publication 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 MatematikaOverlap 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.Publication Open Access On fuzzy implications derived from general overlap functions and their relation to other classes(MDPI, 2023) Pinheiro, Jocivania; Santos, Helida; Pereira Dimuro, Graçaliz; Bedregal, Benjamin; Santiago, Regivan; Fernández Fernández, Francisco Javier; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISCThere are distinct techniques to generate fuzzy implication functions. Despite most of them using the combination of associative aggregators and fuzzy negations, other connectives such as (general) overlap/grouping functions may be a better strategy. Since these possibly non-associative operators have been successfully used in many applications, such as decision making, classification and image processing, the idea of this work is to continue previous studies related to fuzzy implication functions derived from general overlap functions. In order to obtain a more general and flexible context, we extend the class of implications derived by fuzzy negations and t-norms, replacing the latter by general overlap functions, obtaining the so-called (GO, N)-implication functions. We also investigate their properties, the aggregation of (GO, N)-implication functions, their characterization and the intersections with other classes of fuzzy implication functions.Publication 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 KonputazioaIn 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.Publication Open Access Generalization of QL-operators based on general overlap and general grouping functions(IEEE, 2022) Botelho, Cecilia; Galvao, Alessandra; Santos, Helida; Pinheiro, Jocivania; Bedregal, Benjamin; Yamin, Adenauer; Reiser, Renata; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaFirstly, this work discusses the main conditions guarantying that general overlap (grouping) functions can be obtained from n-dimensional overlap (grouping) functions. Focusing on QL-implications, which are usually generated by strong negations together with t-norms and t-conorms, we consider a non-restrictive construction, by relaxing not only the associativity and the corresponding neutral elements (NE) but also the reverse construction of other properties. Thus, the main properties of the QL-implication class are studied, considering a tuple (G,N,O) generated from grouping and overlap functions together with the greatest fuzzy negation. In addition, in order to provide more flexibility, we define a subclass of QL-implications generated from general overlap and general grouping functions. Some examples are introduced, illustrating the constructive methods to generate such operators.Publication Open Access N-dimensional admissibly ordered interval-valued overlap functions and its influence in interval-valued fuzzy rule-based classification systems(IEEE, 2021) Da Cruz Asmus, Tiago; Sanz Delgado, José Antonio; Pereira Dimuro, Graçaliz; Bedregal, Benjamin; Fernández Fernández, Francisco Javier; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y MatemáticasOverlap functions are a type of aggregation functions that are not required to be associative, generally used to indicate the overlapping degree between two values. They have been successfully used as a conjunction operator in several practical problems, such as fuzzy rulebased classification systems (FRBCSs) and image processing. Some extensions of overlap functions were recently proposed, such as general overlap functions and, in the interval-valued context, n-dimensional interval-valued overlap functions. The latter allow them to be applied in n-dimensional problems with interval-valued inputs, like interval-valued classification problems, where one can apply interval-valued FRBCSs (IV-FRBCSs). In this case, the choice of an appropriate total order for intervals, like an admissible order, can play an important role. However, neither the relationship between the interval order and the n-dimensional interval-valued overlap function (which may or may not be increasing for that order) nor the impact of this relationship in the classification process have been studied in the literature. Moreover, there is not a clear preferred n-dimensional interval-valued overlap function to be applied in an IV-FRBCS. Hence, in this paper we: (i) present some new results on admissible orders, which allow us to introduce the concept of n-dimensional admissibly ordered interval-valued overlap functions, that is, n-dimensional interval-valued overlap functions that are increasing with respect to an admissible order; (ii) develop a width-preserving construction method for this kind of function, derived from an admissible order and an n-dimensional overlap function, discussing some of its features; (iii) analyze the behaviour of several combinations of admissible orders and n-dimensional (admissibly ordered) interval-valued overlap functions when applied in IV-FRBCSs. All in all, the contribution of this paper resides in pointing out the effect of admissible orders and n-dimensional admissibly ordered interval-valued overlap functions, both from a theoretical and applied points of view, the latter when considering classification problems.Publication 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áticasIn 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]?Publication Open Access Admissible OWA operators for fuzzy numbers(Elsevier, 2024) García-Zamora, Diego; Cruz, Anderson; Neres, Fernando; Santiago, Regivan; Roldán López de Hierro, Antonio Francisco; Paiva, Rui; Pereira Dimuro, Graçaliz; Martínez López, Luis; Bedregal, Benjamin; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISCOrdered Weighted Averaging (OWA) operators are some of the most widely used aggregation functions in classic literature, but their application to fuzzy numbers has been limited due to the complexity of defining a total order in fuzzy contexts. However, the recent notion of admissible order for fuzzy numbers provides an effective method to totally order them by refining a given partial order. Therefore, this paper is devoted to defining OWA operators for fuzzy numbers with respect to admissible orders and investigating their properties. Firstly, we define the OWA operators associated with such admissible orders and then we show their main properties. Afterward, an example is presented to illustrate the applicability of these AOWA operators in linguistic decision-making. In this regard, we also develop an admissible order for trapezoidal fuzzy numbers that can be efficiently applied in practice.Publication Open Access Aggregation of individual rankings through fusion functions: criticism and optimality analysis(IEEE, 2020) Bustince Sola, Humberto; Bedregal, Benjamin; Campión Arrastia, María Jesús; Silva, Ivanoska da; Fernández Fernández, Francisco Javier; Induráin Eraso, Esteban; Raventós Pujol, Armajac; Santiago, Regivan; Estatistika, Informatika eta Matematika; Institute for Advanced Materials and Mathematics - INAMAT2; Estadística, Informática y MatemáticasThroughout this paper, our main idea is to analyze from a theoretical and normative point of view different methods to aggregate individual rankings. To do so, first we introduce the concept of a general mean on an abstract set. This new concept conciliates the social choice where well-known impossibility results as the Arrovian ones are encountered and the decision-making approaches where the necessity of fusing rankings is unavoidable. Moreover it gives rise to a reasonable definition of the concept of a ranking fusion function that does indeed satisfy the axioms of a general mean. Then we will introduce some methods to build ranking fusion functions, paying a special attention to the use of score functions, and pointing out the equivalence between ranking and scoring. To conclude, we prove that any ranking fusion function introduces a partial order on rankings implemented on a finite set of alternatives. Therefore, this allows us to compare rankings and different methods of aggregation, so that in practice one should look for the maximal elements with respect to such orders defined on rankings IEEE.Publication Open Access Additively generated (a,b)-implication functions*(IEEE, 2023) Santos, Helida; Pereira Dimuro, Graçaliz; Bedregal, Benjamin; Paiva, Rui; Lucca, Giancarlo; Moura, Bruno; Cruz, Anderson; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaSome problems involving classification through neural networks are known to use inputs out of the scope of the unit interval. Therefore, defining operations on arbitrary closed real intervals may be an interesting strategy to tackle this issue and enhance those application environments. In this paper we follow the ideas already discussed in the literature regarding (a,b)-fusion functions, and (a,b)-negations, to provide a new way to construct implication functions. The main idea is to construct an operator using additively generated functions that preserve the properties required by implication functions.
- «
- 1 (current)
- 2
- 3
- »