scispace - formally typeset
Search or ask a question
Author

Miguel Pagola

Other affiliations: University of Navarra
Bio: Miguel Pagola is an academic researcher from Universidad Pública de Navarra. The author has contributed to research in topics: Fuzzy set & Fuzzy classification. The author has an hindex of 28, co-authored 99 publications receiving 3140 citations. Previous affiliations of Miguel Pagola include University of Navarra.


Papers
More filters
Journal ArticleDOI
TL;DR: The definition and basic properties of the different types of fuzzy sets that have appeared up to now in the literature are reviewed and the relationships between them are analyzed.
Abstract: In this paper, we review the definition and basic properties of the different types of fuzzy sets that have appeared up to now in the literature. We also analyze the relationships between them and enumerate some of the applications in which they have been used.

386 citations

Journal ArticleDOI
TL;DR: This paper introduces the concept of a grouping function, i.e., a specific type of aggregation function that combines two degrees of support (weak preference) into adegree of information or, say, a degree of comparability between two alternatives, and relates this new concept to that of incomparability.
Abstract: In this paper, we propose new aggregation functions for the pairwise comparison of alternatives in fuzzy preference modeling. More specifically, we introduce the concept of a grouping function, i.e., a specific type of aggregation function that combines two degrees of support (weak preference) into a degree of information or, say, a degree of comparability between two alternatives, and we relate this new concept to that of incomparability. Grouping functions of this type complement the existing concept of overlap functions in a natural way, since the latter can be used to turn two degrees of weak preference into a degree of indifference. We also define the so-called generalized bientropic functions that allow for a unified representation of overlap and grouping functions. Apart from analyzing mathematical properties of these types of functions and exploring relationships between them, we elaborate on their use in fuzzy preference modeling and decision making. We present an algorithm to elaborate on an alternative preference ranking that penalizes those alternatives for which the expert is not sure of his/her preference.

241 citations

Journal ArticleDOI
TL;DR: This paper presents a method to construct interval-valued fuzzy sets from a matrix, in such a way that the length of the interval representing the membership of any element to the new set is obtained from the differences between the values assigned to that element and its neighbors in the starting matrix.

212 citations

Journal ArticleDOI
TL;DR: Results indicate that measures constructed from fuzzy DI-subsethood measures provide the best results, indicating that the minimal set of conditions are studied that must be met by any given measure for comparing images.

164 citations

Journal ArticleDOI
TL;DR: This paper analyzes the manner of generating similarity measures of X. Liu and of J. Fan et al. from the construction of restricted equivalence functions from automorphisms and implication operators.

162 citations


Cited by
More filters
Christopher M. Bishop1
01 Jan 2006
TL;DR: Probability distributions of linear models for regression and classification are given in this article, along with a discussion of combining models and combining models in the context of machine learning and classification.
Abstract: Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

10,141 citations

Journal ArticleDOI
TL;DR: This survey will present existing methods for Data Augmentation, promising developments, and meta-level decisions for implementing DataAugmentation, a data-space solution to the problem of limited data.
Abstract: Deep convolutional neural networks have performed remarkably well on many Computer Vision tasks. However, these networks are heavily reliant on big data to avoid overfitting. Overfitting refers to the phenomenon when a network learns a function with very high variance such as to perfectly model the training data. Unfortunately, many application domains do not have access to big data, such as medical image analysis. This survey focuses on Data Augmentation, a data-space solution to the problem of limited data. Data Augmentation encompasses a suite of techniques that enhance the size and quality of training datasets such that better Deep Learning models can be built using them. The image augmentation algorithms discussed in this survey include geometric transformations, color space augmentations, kernel filters, mixing images, random erasing, feature space augmentation, adversarial training, generative adversarial networks, neural style transfer, and meta-learning. The application of augmentation methods based on GANs are heavily covered in this survey. In addition to augmentation techniques, this paper will briefly discuss other characteristics of Data Augmentation such as test-time augmentation, resolution impact, final dataset size, and curriculum learning. This survey will present existing methods for Data Augmentation, promising developments, and meta-level decisions for implementing Data Augmentation. Readers will understand how Data Augmentation can improve the performance of their models and expand limited datasets to take advantage of the capabilities of big data.

5,782 citations

Journal ArticleDOI
TL;DR: It is proved that the envelope of the hesitant fuzzy sets is an intuitionistic fuzzy set, and it is proved also that the operations proposed are consistent with the ones of intuitionist fuzzy sets when applied to the envelope.
Abstract: Several extensions and generalizations of fuzzy sets have been introduced in the literature, for example, Atanassov's intuitionistic fuzzy sets, type 2 fuzzy sets, and fuzzy multisets. In this paper, we propose hesitant fuzzy sets. Although from a formal point of view, they can be seen as fuzzy multisets, we will show that their interpretation differs from the two existing approaches for fuzzy multisets. Because of this, together with their definition, we also introduce some basic operations. In addition, we also study their relationship with intuitionistic fuzzy sets. We prove that the envelope of the hesitant fuzzy sets is an intuitionistic fuzzy set. We prove also that the operations we propose are consistent with the ones of intuitionistic fuzzy sets when applied to the envelope of the hesitant fuzzy sets. © 2010 Wiley Periodicals, Inc.

2,232 citations

Dissertation
01 Jan 1975

2,119 citations

Journal ArticleDOI
Ronald R. Yager1
TL;DR: It is noted that as q increases the space of acceptable orthopairs increases and thus gives the user more freedom in expressing their belief about membership grade, and introduces a general class of sets called q-rung orthopair fuzzy sets in which the sum of the ${\rm{q}}$th power of the support against is bonded by one.
Abstract: We note that orthopair fuzzy subsets are such that that their membership grades are pairs of values, from the unit interval, one indicating the degree of support for membership in the fuzzy set and the other support against membership. We discuss two examples, Atanassov's classic intuitionistic sets and a second kind of intuitionistic set called Pythagorean. We note that for classic intuitionistic sets the sum of the support for and against is bounded by one, while for the second kind, Pythagorean, the sum of the squares of the support for and against is bounded by one. Here we introduce a general class of these sets called q-rung orthopair fuzzy sets in which the sum of the ${\rm{q}}$ th power of the support for and the ${\rm{q}}$ th power of the support against is bonded by one. We note that as q increases the space of acceptable orthopairs increases and thus gives the user more freedom in expressing their belief about membership grade. We investigate various set operations as well as aggregation operations involving these types of sets.

1,056 citations