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.

In this paper, we discussconsensus measures for typical hesitant fuzzy elements (THFE), which are the finite and nonempty fuzzy membership degrees under the scope of typical hesitant fuzzy sets (THFS). In our approach, we present a model that formally constructs consensus measures by means of aggregations functions, fuzzy implication-like functions and fuzzy negations, using admissible orders to compare the THFE, and also providing an analysis of consistency on them. Our theoretical results are applied into a problem of decision making with multicriteria illustrating our methodology to achieve consensus in a group of experts working with THFS.

A function that takes n numbers as input and outputs one number is said to be homogeneous whenever the result of multiplying each input by a certain factor λ yields the original output multiplied by that same factor.This concept has been extended by the notion of abstract homogeneity, which generalizes the product in the expression of homogeneity by a general function g and the effect of the factor λ by an automorphism.However, the effect of parameter λ remains unchanged for all the input values.In this study, we generalize further the condition of abstract homogeneity by introducing ℱ-homogeneity, which is defined with respect to a family of functions, enabling a different behavior for each of the inputs.Next, we study the properties that are satisfied by this family of functions and, moreover, we link this concept with the condition of directional monotonicity, which is a trendy property in the framework of aggregation functions.To achieve that, we generalize directional monotonicity by ℱ directional monotonicity, which is defined with respect to a family of functions ℱ and a family of vectors  .Finally, we show how the introduced concepts could be applied

This study proposes some standard and general forms of induced ordered weighted averaging (GnIOWA) operators where the inductive information is ordered weighted averaging (OWA) weight vectors instead of real numbers. It shows the usefulness of such type of generalized induced OWA in decision-making and evaluation and many other applications. We propose three weights allocation methods that are specifically designed for the proposed GnIOWA operators. For each of the proposed weights allocation methods, a numerical example is also attached accordingly. With the use of convex/concave Regular Increasing Monotone quantifiers, we further discuss some mathematical properties of these weights allocation methods.

Multi Expert-Multi Criteria Decision Making (ME-MCDM) problems have been well explored on hesitant fuzzy environments dealing with membership degrees as subsets which do not necessarily have the same cardinality. Admissible (total) orders collaborate by reducing the collapse in the ranking of alternatives related to preference relations. In such context, three classes of admissible orders are presented in a non-restrictive way, integrating the concepts of linearity and cardinality and providing support to the comparison between two typical hesitant fuzzy elements. In the sense of hesitant fuzzy logic, the study of fuzzy operators and their main properties is extended considering the admissible linear orders. Namely, the typical hesitant fuzzy aggregation functions, negations and implication functions are discussed mainly related to their (iso/anti)tonicity properties w.r.t. these admissible orders. An algorithmic procedure is introduced illustrating our strategy to solve an ME-MCDM problem, by selecting a Computer Integrating Manufacturing software and making use of the achieved theoretical results.

A new concept of equivalence between intervals and the induced indistinguishability between interval-valued (IV) fuzzy sets are proposed and considered. A new notion of the degree of IV equivalence is presented where partial or linear orders and the width of intervals are involved reflecting uncertainty. Furthermore, construction methods of the considered equivalences are provided and the relation between them and other notions of IV equivalences are studied. Finally, a methodology to apply the proposed equivalences in the field of image processing is shown, along with an illustrative example.

The notion of an orness measure for aggregation functions has been a relevant study subject whose history can be traced back to the early works of Dujmović in 1973. Intuitively, an orness measure quantifies the similarity of an aggregation function to the “or” function and results in an essential tool for decision engineering, field in which the choice of aggregation function is sometimes restricted to a desired value of orness (orness-directed aggregation). In 1988, Yager presented a particular example of orness measure for ordered weighted averaging (OWA) functions and initiated a series of contributions aiming at proposing an axiomatic definition of orness measure for OWA functions. In this paper, we go much further and present an axiomatic definition of orness measure for the whole family of aggregation functions. We end by proposing two natural construction methods for an orness measure for aggregation functions. The particular examples of the (discrete) Choquet integral and uninorms are studied in detail.

Comparison and similarity measurement have been a key topic in computer vision for a long time. There is, indeed, an extensive list of algorithms and measures for image or subimage comparison. The superiority or inferiority of different measures is hard to scrutinize, especially considering the dimensionality of their parameter space and their many different configurations. In this work, we focus on the comparison of binary images, and study different variations of Baddeley’s Delta Metric, a popular metric for such images. We study the possible parameterizations of the metric, stressing the numerical and behavioural impact of different settings. Specifically, we consider the parameter settings proposed by the original author, as well as the substitution of distance transformations by regularized distance transformations, as recently presented by Brunet and Sills. We take a qualitative perspective on the effects of the settings, and also perform quantitative experiments on separability of datasets for boundary evaluation.

It is known that the human visual system performs a hierarchical information process in which early vision cues (or primitives) are fused in the visual cortex to compose complex shapes and descriptors. While different aspects of the process have been extensively studied, such as lens adaptation or feature detection, some other aspects, such as feature fusion, have been mostly left aside. In this work, we elaborate on the fusion of early vision primitives using generalizations of the Choquet integral, and novel aggregation operators that have been extensively studied in recent years. We propose to use generalizations of the Choquet integral to sensibly fuse elementary edge cues, in an attempt to model the behaviour of neurons in the early visual cortex. Our proposal leads to a fully-framed edge detection algorithm whose performance is put to the test in state-of-the-art edge detection datasets.

Imbalanced classification problems are attracting the attention of the research community because they are prevalent in real-world problems and they impose extra difficulties for learning methods. Fuzzy rule-based classification systems have been applied to cope with these problems, mostly together with sampling techniques. In this paper, we define a new fuzzy association rule-based classifier, named FARCI, to tackle directly imbalanced classification problems. Our new proposal belongs to the algorithm modification category, since it is constructed on the basis of the state-of-the-art fuzzy classifier FARC–HD. Specifically, we modify its three learning stages, aiming at boosting the number of fuzzy rules of the minority class as well as simplifying them and, for the sake of handling unequal fuzzy rule lengths, we also change the matching degree computation, which is a key step of the inference process and it is also involved in the learning process. In the experimental study, we analyze the effectiveness of each one of the new components in terms of performance, F-score, and rule base size. Moreover, we also show the superiority of the new method when compared versus FARC–HD alongside sampling techniques, another algorithm modification approach, two cost-sensitive methods and an ensemble.

In this study, we discuss a new class of fuzzy subsethood measures between fuzzy sets. We propose a new definition of fuzzy subsethood measure as an intersection of other axiomatizations and provide two construction methods to obtain them. The advantage of this new approach is that we can construct fuzzy subsethood measures by aggregating fuzzy implication operators which may satisfy some properties widely studied in literature. We also obtain some of the classical measures such as the one defined by Goguen. The relationships with fuzzy distances, penalty functions, and similarity measures are also investigated. Finally, we provide an illustrative example which makes use of a fuzzy entropy defined by means of our fuzzy subsethood measures for choosing the best fuzzy technique for a specific problem.

Existing extensions to Yager's ordered weighted averaging (OWA) operators enlarge the application range and to encompass more principles and properties related to OWA aggregation. However, these extensions do not provide a strict and convenient way to model evaluation scenarios with complex or grouped preferences. Based on earlier studies and recent evolutionary changes in OWA operators, we propose formulation paradigms for induced OWA aggregation and a related weight function with self-contained properties that make it possible to model such complex preference-involved evaluation problems in a systematic way. The new formulations have some recursive forms that provide more ways to apply OWA aggregation and deserve further study from a mathematical perspective. In addition, the new proposal generalizes almost all of the well-known extensions to the original OWA operators. We provide an example showing the representative use of such paradigms in decision-making and evaluation problems.

Since the seminal paper of fuzzy set theory by Zadeh in 1965, many extensions have been proposed to overcome the difficulty for assigning the membership degrees. In recent years, a new extension, the hesitant fuzzy sets, has attracted a lot of interest due to its usefulness to handle those problems in which it is difficult to provide accurately a single membership value; since for hesitant sets, membership values are given by a whole set of values. On the other hand, since fuzzy negations have an important role in applications as well as in the theoretical approach to of fuzzy logics, it is important to study an extension of the concept of fuzzy negation for hesitant fuzzy degrees (elements). In this paper, we propose such a definition and we study some of the main properties of this new concept.