Algorithms to Detect and Rectify Multiplicative and Ordinal Inconsistencies of Fuzzy Preference Relations

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Consistency, multiplicative and ordinal, of fuzzy preference relations (FPRs) is investigated. The geometric consistency index (GCI) approximated thresholds are extended to measure the degree of consistency for an FPR. For inconsistent FPRs, two algorithms are devised (1) to find the multiplicative inconsistent elements, and (2) to detect the ordinal inconsistent elements. An integrated algorithm is proposed to improve simultaneously the ordinal and multiplicative consistencies. Some examples, comparative analysis, and simulation experiments are provided to demonstrate the effectiveness of the proposed methods

Transitive matrices, strict preference and intensity operators

Let X be a set of alternatives and a_{ij} a positive number expressing how much the alternative x_{i} is preferred to the alternative x_{j}. Under suitable hypothesis of no indifference and transitivity over the pairwise comparison matrix A= (a_{ij}), the alternatives can be ordered as a chain . Then a coherent priority vector is a vector giving a weighted ranking agreeing with the obtained chain and an intensity vector is a coherent priority vector encoding information about the intensities of the preferences. In the paper we look for operators F that, acting on the row vectors translate the matrix A in an intensity vector

The Choquet integral for the aggregation of interval scales in multicriteria decision making

This paper addresses the question of which models fit with information concerning the preferences of the decision maker over each attribute, and his preferences about aggregation of criteria (interacting criteria). We show that the conditions induced by these information plus some intuitive conditions lead to a unique possible aggregation operator: the Choquet integral.

Practical Model-Based Diagnosis with Qualitative Possibilistic Uncertainty

An approach to fault isolation that exploits vastly incomplete models is presented. It relies on separate descriptions of each component behavior, together with the links between them, which enables focusing of the reasoning to the relevant part of the system. As normal observations do not need explanation, the behavior of the components is limited to anomaly propagation. Diagnostic solutions are disorders (fault modes or abnormal signatures) that are consistent with the observations, as well as abductive explanations. An ordinal representation of uncertainty based on possibility theory provides a simple exception-tolerant description of the component behaviors. We can for instance distinguish between effects that are more or less certainly present (or absent) and effects that are more or less certainly present (or absent) when a given anomaly is present. A realistic example illustrates the benefits of this approach.Comment: Appears in Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (UAI1995

On the priority vector associated with a fuzzy preference relation and a multiplicative preference relation.

We propose two straightforward methods for deriving the priority vector associated with a fuzzy preference relation. Then, using transformations between multiplicative preference relations and fuzzy preference relations, we study the relationships between the priority vectors associated with these two types of preference relations.pairwise comparison matrix; fuzzy preference relation; priority vector

A kernel-based framework for learning graded relations from data

Driven by a large number of potential applications in areas like bioinformatics, information retrieval and social network analysis, the problem setting of inferring relations between pairs of data objects has recently been investigated quite intensively in the machine learning community. To this end, current approaches typically consider datasets containing crisp relations, so that standard classification methods can be adopted. However, relations between objects like similarities and preferences are often expressed in a graded manner in real-world applications. A general kernel-based framework for learning relations from data is introduced here. It extends existing approaches because both crisp and graded relations are considered, and it unifies existing approaches because different types of graded relations can be modeled, including symmetric and reciprocal relations. This framework establishes important links between recent developments in fuzzy set theory and machine learning. Its usefulness is demonstrated through various experiments on synthetic and real-world data.Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl