Orderings of fuzzy sets based on fuzzy orderings. Part I: the basic approach

The aim of this paper is to present a general framework for comparing fuzzy sets with respect to a general class of fuzzy orderings. This approach includes known techniques based on generalizing the crisp linear ordering of real numbers by means of the extension principle, however, in its general form, it is applicable to any fuzzy subsets of any kind of universe for which a fuzzy ordering is known|no matter whether linear or partialPeer Reviewe

Robust rank correlation coefficients on the basis of fuzzy

The goal of this paper is to demonstrate that established rank correlation measures are not ideally suited for measuring rank correlation for numerical data that are perturbed by noise. We propose to use robust rank correlation measures based on fuzzy orderings. We demonstrate that the new measures overcome the robustness problems of existing rank correlation coe cients. As a rst step, this is accomplished by illustrative examples. The paper closes with an outlook on future research and applicationsPeer Reviewe

The legacy of 50 years of fuzzy sets: A discussion

International audienceThis note provides a brief overview of the main ideas and notions underlying fifty years of research in fuzzy set and possibility theory, two important settings introduced by L.A. Zadeh for representing sets with unsharp boundaries and uncertainty induced by granules of information expressed with words. The discussion is organized on the basis of three potential understanding of the grades of membership to a fuzzy set, depending on what the fuzzy set intends to represent: a group of elements with borderline members, a plausibility distribution, or a preference profile. It also questions the motivations for some existing generalized fuzzy sets. This note clearly reflects the shared personal views of its authors

A new measure of consensus with reciprocal preference relations: The correlation consensus degree

Producción CientíficaThe achievement of a ‘consensual’ solution in a group decision making problem depends on experts’ ideas, principles, knowledge, experience, etc. The measurement of consensus has been widely studied from the point of view of different research areas, and consequently different consensus measures have been formulated, although a common characteristic of most of them is that they are driven by the implementation of either distance or similarity functions. In the present work though, and within the framework of experts’ opinions modelled via reciprocal preference relations, a different approach to the measurement of consensus based on the Pearson correlation coefficient is studied. The new correlation consensus degree measures the concordance between the intensities of preference for pairs of alternatives as expressed by the experts. Although a detailed study of the formal properties of the new correlation consensus degree shows that it verifies important properties that are common either to distance or to similarity functions between intensities of preferences, it is also proved that it is different to traditional consensus measures. In order to emphasise novelty, two applications of the proposed methodology are also included. The first one is used to illustrate the computation process and discussion of the results, while the second one covers a real life application that makes use of data from Clinical Decision-Making.Ministerio de Economía, Industria y Competitividad (Project ECO2012-32178

A new measure of consensus with reciprocal preference relations: The correlation consensus degree

Producción CientíficaThe achievement of a ‘consensual’ solution in a group decision making problem depends on experts’ ideas, principles, knowledge, experience, etc. The measurement of consensus has been widely studied from the point of view of different research areas, and consequently different consensus measures have been formulated, although a common characteristic of most of them is that they are driven by the implementation of either distance or similarity functions. In the present work though, and within the framework of experts’ opinions modelled via reciprocal preference relations, a different approach to the measurement of consensus based on the Pearson correlation coefficient is studied. The new correlation consensus degree measures the concordance between the intensities of preference for pairs of alternatives as expressed by the experts. Although a detailed study of the formal properties of the new correlation consensus degree shows that it verifies important properties that are common either to distance or to similarity functions between intensities of preferences, it is also proved that it is different to traditional consensus measures. In order to emphasise novelty, two applications of the proposed methodology are also included. The first one is used to illustrate the computation process and discussion of the results, while the second one covers a real life application that makes use of data from Clinical Decision-Making.Ministerio de Economía, Industria y Competitividad (Project ECO2012-32178

A Declarative Semantics for CLP with Qualification and Proximity

Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values as a generalization of uncertain truth values, and unification based on proximity relations. On the other hand, the CLP scheme has established itself as a powerful extension of LP that supports efficient computation over specialized domains while keeping a clean declarative semantics. In this paper we propose a new scheme SQCLP designed as an extension of CLP that supports qualification values and proximity relations. We show that several previous proposals can be viewed as particular cases of the new scheme, obtained by partial instantiation. We present a declarative semantics for SQCLP that is based on observables, providing fixpoint and proof-theoretical characterizations of least program models as well as an implementation-independent notion of goal solutions.Comment: 17 pages, 26th Int'l. Conference on Logic Programming (ICLP'10