Generalized Bonferroni mean operators in multi-criteria aggregation

In this paper we provide a systematic investigation of a family of composed aggregation functions which generalize the Bonferroni mean. Such extensions of the Bonferroni mean are capable of modeling the concepts of hard and soft partial conjunction and disjunction as well as that of k-tolerance and k-intolerance. There are several interesting special cases with quite an intuitive interpretation for application.

Construction of aggregation operators for automated decision making via optimal interpolation and global optimization

This paper examines methods of point wise construction of aggregation operators via optimal interpolation. It is shown that several types of application-specific requirements lead to interpolatory type constraints on the aggregation function. These constraints are translated into global optimization problems, which are the focus of this paper. We present several methods of reduction of the number of variables, and formulate suitable numerical algorithms based on Lipschitz optimization.

On Lipschitz properties of generated aggregation functions

This article discusses Lipschitz properties of generated aggregation functions. Such generated functions include triangular norms and conorms, quasi-arithmetic means, uninorms, nullnorms and continuous generated functions with a neutral element. The Lipschitz property guarantees stability of aggregation operations with respect to input inaccuracies, and is important for applications. We provide verifiable sufficient conditions to determine when a generated aggregation function holds the k-Lipschitz property, and calculate the Lipschitz constants of power means. We also establish sufficient conditions which guarantee that a generated aggregation function is not Lipschitz. We found the only 1-Lipschitz generated function with a neutral element e ∈]0, 1[.

QDFA : query-dependent feature aggregation for medical image retrieval

We propose a novel query-dependent feature aggregation (QDFA) method for medical image retrieval. The QDFA method can learn an optimal feature aggregation function for a multi-example query, which takes into account multiple features and multiple examples with different importance. The experiments demonstrate that the QDFA method outperforms three other feature aggregation methods.

Learning aggregation weights from 3-tuple comparison sets

An important task in multiple-criteria decision making is how to learn the weights and parameters of an aggregation function from empirical data. We consider this in the context of quantifying ecological diversity, where such data is to be obtained as a set of pairwise comparisons specifying that one community should be considered more diverse than another. A problem that arises is how to collect a sufficient amount of data for reliable model determination without overloading individuals with the number of comparisons they need to make. After providing an algorithm for determining criteria weights and an overall ranking from such information, we then investigate the improvement in accuracy if ranked 3-tuples are supplied instead of pairs. We found that aggregation models could be determined accurately from significantly fewer 3-tuple comparisons than pairs. © 2013 IEEE.

A review of the relationships between implication, negation and aggregation functions from the point of view of material implication

Implication and aggregation functions play important complementary roles in the field of fuzzy logic. Both have been intensively investigated since the early 1980s, revealing a tight relationship between them. However, the main results regarding this relationship, published by Fodor and Demirli DeBaets in the 1990s, have been poorly disseminated and are nowadays somewhat obsolete due to the subsequent advances in the field. The present paper deals with the translation of the classical logical equivalence p → q = ¬pvq, often called material implication, to the fuzzy framework, which establishes a one-to-one correspondence between implication functions and disjunctors (the class of aggregation functions that extend the Boolean disjunction to the unit interval). The construction of implication functions from disjunctors via negation functions, and vice versa, is reviewed, stressing the properties of disjunctors (respectively, implication functions) that ensure certain properties of implication functions (disjunctors).

On (TS,N)-fuzzy implications

This paper proposes a new class of fuzzy implications, built according to the well-known (S,N) scheme but in such a way that the t-conorm S is replaced with a compensatory TS function (an aggregation function combining a t-norm and a t-conorm). The basic properties of such implications are studied, and different examples are provided.

A fuzzy decision support method for customer preferences analysis based on Choquet integral

The explosion of the Web 2:0 platforms, with massive volume of user generated data, has presented many new opportunities as well as challenges for organizations in understanding consumer's behavior to support for business planning process. Feature based sentiment mining has been an emerging area in providing tools for automated opinion discovery and summarization to help business managers with achieving such goals. However, the current feature based sentiment mining systems were only able to provide some forms of sentiments summary with respect to product features, but impossible to provide insight into the decision making process of consumers. In this paper, we will present a relatively new decision support method based on Choquet Integral aggregation function, Shapley value and Interaction Index which is able to address such requirements of business managers. Using a study case of Hotel industry, we will demonstrate how this technique can be applied to effectively model the user's preference of (hotel) features. The presented method has potential to extend the practical capability of sentiment mining area, while, research findings and analysis are useful in helping business managers to define new target customers and to plan more effective marketing strategies.

Image reduction operators based on non-monotonic averaging functions

Image reduction is a crucial task in image processing, underpinning many practical applications. This work proposes novel image reduction operators based on non-monotonic averaging aggregation functions. The technique of penalty function minimisation is used to derive a novel mode-like estimator capable of identifying the most appropriate pixel value for representing a subset of the original image. Performance of this aggregation function and several traditional robust estimators of location are objectively assessed by applying image reduction within a facial recognition task. The FERET evaluation protocol is applied to confirm that these non-monotonic functions are able to sustain task performance compared to recognition using nonreduced images, as well as significantly improve performance on query images corrupted by noise. These results extend the state of the art in image reduction based on aggregation functions and provide a basis for efficiency and accuracy improvements in practical computer vision applications.

On some properties of weighted averaging with variable weights

Density-based means have been recently proposed as a method for dealing with outliers in the stream processing of data. Derived from a weighted arithmetic mean with variable weights that depend on the location of all data samples, these functions are not monotonic and hence cannot be classified as aggregation functions. In this article we establish the weak monotonicity of this class of averaging functions and use this to establish robust generalisations of these means. Specifically, we find that as proposed, the density based means are only robust to isolated outliers. However, by using penalty based formalisms of averaging functions and applying more sophisticated and robust density estimators, we are able to define a broader family of density based means that are more effective at filtering both isolated and clustered outliers. © 2014 Elsevier Inc. All rights reserved.

Strong fuzzy subsethood measures and strong equalities via implication functions

In this work we present the definition of strong fuzzy subsethood measure as a unifiying concept for the different notions of fuzzy subsethood that can be found in the literature. We analyze the relations of our new concept with the definitions by Kitainik ( [20]), Young ( [26]) and Sinha and Dougherty ( [23]) and we prove that the most relevant properties of the latter are preserved. We show also several construction methods. © 2014 Old City Publishing, Inc.

Discovering implicit criteria preferences reflected in tourism journal ranking lists using the Choquet Integral

Variations between journal rankings may cause confusion. As such, prior attempts were made to compare and evaluate journal ranking criteria for obtaining insightful knowledge on how different research communities have ranked journals. However, existing approaches are unable to model the journal ranking process closely enough as they are incapable of considering the relationship between multiple criteria simultaneously. In this paper, we address the challenges by introducing the Choquet Integral (CI) for evaluating journal ranking criteria. The new approach is able to account for interactions between criteria in relation to overall ranking score, using a fuzzy measure in its computation. Its properties, the Shapley value and the Interaction index, allow for good representations of importance and interactions between criteria. We demonstrate the efficiency of the CI through a case study of journal ranking lists in tourism and service journals.

On the weak monotonicity of Gini means and other mixture functions

Weak monotonicity was recently proposed as a relaxation of the monotonicity condition for averaging aggregation, and weakly monotone functions were shown to have desirable properties when averaging data corrupted with outliers or noise. We extended the study of weakly monotone averages by analyzing their ϕ-transforms, and we established weak monotonicity of several classes of averaging functions, in particular Gini means and mixture operators. Mixture operators with Gaussian weighting functions were shown to be weakly monotone for a broad range of their parameters. This study assists in identifying averaging functions suitable for data analysis and image processing tasks in the presence of outliers.