On the Informational Comparison of Qualitative Fuzzy Measures

International audienceFuzzy measures or capacities are the most general representation of uncertainty functions. However, this general class has been little explored from the point of view of its information content, when degrees of uncertainty are not supposed to be numerical, and belong to a finite qualitative scale, except in the case of possibility or necessity measures. The thrust of the paper is to define an ordering relation on the set of qualitative capacities expressing the idea that one is more informative than another, in agreement with the possibilistic notion of relative specificity. To this aim, we show that the class of qualitative capacities can be partitioned into equivalence classes of functions containing the same amount of information. They only differ by the underlying epistemic attitude such as pessimism or optimism. A meaningful information ordering between capacities can be defined on the basis of the most pessimistic (resp. optimistic) representatives of their equivalence classes. It is shown that, while qualitative capacities bear strong similarities to belief functions, such an analogy can be misleading when it comes to information content

Preassociative aggregation functions

The classical property of associativity is very often considered in aggregation function theory and fuzzy logic. In this paper we provide axiomatizations of various classes of preassociative functions, where preassociativity is a generalization of associativity recently introduced by the authors. These axiomatizations are based on existing characterizations of some noteworthy classes of associative operations, such as the class of Acz\'elian semigroups and the class of t-norms.Comment: arXiv admin note: text overlap with arXiv:1309.730

Collaborative dynamic decision making: a case study from B2B supplier selection

The problem of supplier selection can be easily modeled as a multiple-criteria decision making (MCDM) problem: businesses express their preferences with respect to suppliers, which can then be ranked and selected. This approach has two major pitfalls: first, it does not consider a dynamic scenario, in which suppliers and their ratings are constantly changing; second, it only addressed the problem from the point of view of a single business, and cannot be easily applied when considering more than one business. To overcome these problems, we introduce a method for supplier selection that builds upon the dynamic MCDM framework of Campanella and Ribeiro [1] and, by means of a linear programming model, can be used in the case of multiple collaborating businesses plan- ning their next batch of orders together.Fundação para a Ciência e a Tecnologia, Portugal, under contract CONT DOUT/49/UNINOVA/0/5902/1/200

Second-Order Belief Hidden Markov Models

Hidden Markov Models (HMMs) are learning methods for pattern recognition. The probabilistic HMMs have been one of the most used techniques based on the Bayesian model. First-order probabilistic HMMs were adapted to the theory of belief functions such that Bayesian probabilities were replaced with mass functions. In this paper, we present a second-order Hidden Markov Model using belief functions. Previous works in belief HMMs have been focused on the first-order HMMs. We extend them to the second-order model

Child Well-Being in Rich Countries: UNICEF’s Ranking Revisited, and New Symmetric Aggregating Operators Exemplified

In a report published in 2007 UNICEF measured six dimensions of child well-being for the majority of the economically advanced nations. No overall scores are given, but countries are listed in the order of their average rank on the dimensions, which are therefore implicitly assigned ‘equal importance’. In this study we take ‘equal importance’ to mean that the final aggregation is symmetrical in the scores and the ranks, i.e. permuting them leaves the aggregate unchanged. We rank the countries by aggregating the numerical information using a variety of techniques, geared to the measurement scales we distinguish (‘ordinal’, ‘interval’, ‘ratio’). The aggregators are symmetrical and mildly demanding, emphasizing good performance across the board. The rankings obtained deviate from the UNICEF ranking, but not over-dramatically. Our purpose is not only to study alternative approaches for the particular data at hand, but also to introduce and exemplify new and useful aggregation techniques: we propose ways to select weights for OWA-operators and weighted geometric means, and we suggest how to circumvent the choice of a power for the power means. In addition we extend the Borda method so that it values dominance as well

Ordered Weighted Average Based Fuzzy Rough Sets

Traditionally, membership to the fuzzy-rough lower, resp. upper approximation is determined by looking only at the worst, resp. best performing object. Consequently, when applied to data analysis problems, these approximations are sensitive to noisy and/or outlying samples. In this paper, we advocate a mitigated approach, in which membership to the lower and upper approximation is determined by means of an aggregation process using ordered weighted average operators. In comparison to the previously introduced vaguely quantified rough set model, which is based on a similar rationale, our proposal has the advantage that the approximations are monotonous w.r.t. the used fuzzy indiscernibility relation. Initial experiments involving a feature selection application confirm the potential of the OWA-based model

Solving Fuzzy Job-Shop Scheduling Problems with a Multiobjective Optimizer

International audienceIn real-world manufacturing environments, it is common to face a job-shop scheduling problem (JSP) with uncertainty. Among different sources of uncertainty, processing times uncertainty is the most common. In this paper, we investigate the use of a multiobjective genetic algorithm to address JSPs with uncertain durations. Uncertain durations in a JSP are expressed by means of triangular fuzzy numbers (TFNs). Instead of using expected values as in other work, we consider all vertices of the TFN representing the overall completion time. As a consequence, the proposed approach tries to obtain a schedule that optimizes the three component scheduling problems (corresponding to the lowest, most probable, and largest durations) all at the same time. In order to verify the quality of solutions found by the proposed approach, an experimental study was carried out across different benchmark instances. In all experiments, comparisons with previous approaches that are based on a single-objective genetic algorithm were also performed

On the Complete Lattice Structure of Ordered Functional Weighted Averaging Operators

Ordered functional weighted averaging (OFWA) operators are a generalization of the well-known ordered weighted averaging (OWA) operators in which functions, instead of single values, are considered as weights. This fact offers an extra level of flexibility; for example, in multi-criteria decision-making, it can be used to aggregate available information and provide recommendations. This paper furthers the analysis of these general operators, studying how they can be combined to obtain conservative and aggressive perspectives from experts and studying the algebraic structure of the whole set of these operators