The main advances regarding the use of the Choquet and Sugeno integrals in multi-criteria decision aid over the last decade are reviewed. They concern mainly a bipolar extension of both the Choquet integral and the Sugeno integral, interesting particular submodels, new learning techniques, a better interpretation of the models and a better use of the Choquet integral in multi-criteria decision aid. Parallel to these theoretical works, the Choquet integral has been applied to many new fields, and several softwares and libraries dedicated to this model have been developed.

A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid

Commercial applications of artificial intelligence and machine learning have made remarkable progress recently, particularly in areas such as image recognition, natural speech processing, language translation, textual analysis, and self-learning. Progress had historically languished in these areas, such that these skills had come to seem ineffably bound to intelligence. However, these commercial advances have performed best at single-task applications in which imperfect outputs and occasional frank errors can be tolerated.The practice of anesthesiology is different. It embodies a requirement for high reliability, and a pressured cycle of interpretation, physical action, and response rather than any single cognitive act. This review covers the basics of what is meant by artificial intelligence and machine learning for the practicing anesthesiologist, describing how decision-making behaviors can emerge from simple equations. Relevant clinical questions are introduced to illustrate how machine learning might help solve them-perhaps bringing anesthesiology into an era of machine-assisted discovery.

/pdf/artificial-intelligence-and-machine-learning-in-2vz4taljx1.pdf

Artificial Intelligence and Machine Learning in Anesthesiology

The learning of predictive models that guarantee monotonicity in the input variables has received increasing attention in machine learning in recent years. By trend, the difficulty of ensuring monotonicity increases with the flexibility or, say, nonlinearity of a model. In this paper, we advocate the so-called Choquet integral as a tool for learning monotone nonlinear models. While being widely used as a flexible aggregation operator in different fields, such as multiple criteria decision making, the Choquet integral is much less known in machine learning so far. Apart from combining monotonicity and flexibility in a mathematically sound and elegant manner, the Choquet integral has additional features making it attractive from a machine learning point of view. Notably, it offers measures for quantifying the importance of individual predictor variables and the interaction between groups of variables. Analyzing the Choquet integral from a classification perspective, we provide upper and lower bounds on its VC-dimension. Moreover, as a methodological contribution, we propose a generalization of logistic regression. The basic idea of our approach, referred to as choquistic regression, is to replace the linear function of predictor variables, which is commonly used in logistic regression to model the log odds of the positive class, by the Choquet integral. First experimental results are quite promising and suggest that the combination of monotonicity and flexibility offered by the Choquet integral facilitates strong performance in practical applications.

Learning Monotone Nonlinear Models using the Choquet Integral.

Multi-Criteria Decision Making (MCDM) is a complex process. It aims to support decision makers in making their decisions more effective and consistent. MCDM provides a useful and successful alternative for handling three main types of MCDM problems, namely, choosing, ranking and sorting. The first two are the most common problems studied but the third offers a way to deal with real world MCDM problems that require alternatives to be assigned to ordered categories. The practitioners are currently developing and applying sorting methods to solve problems from different application areas. In spite of its interest and applicability, there is only one previous review on Multiple-Criteria sorting, performed almost 20 years ago. Hence, because of its interest this paper presents a new and systematic review of MCDM sorting methods that includes 30 years of research in the field. This review has systematically analyzed the conventional and non-classical methods of MCDM sorting and then classified the papers published into 16 application areas. The analysis reveals that the methodological development is still in growth phase for MCDM sorting and discovers the applied methods’ trends. It also shows the complete spectrum of the areas of the application addressed, the state of knowledge about methods, the type of contribution to the knowledge, and the application area for the four categories of the MCDM approaches. The systematic review scrutinizes each selected article in order to find out which approach from the multi-criteria sorting presents the most development based on its contribution and application of the methods. We also aim to discover which Multiple-Criteria sorting methods are the most studied in MCDM. The relevant finding is the relation between the most applied methods and the application areas together with future directions for further research.

Multiple-criteria decision-making sorting methods: A survey

New doctors ranking system based on VIKOR method

/pdf/learning-the-parameters-of-a-multiple-criteria-sorting-2nbyw6r90j.pdf

Learning the parameters of a multiple criteria sorting method from large sets of assignment examples

Learning the parameters of a Majority Rule Sorting model MR-Sort through linear programming requires to use binary variables. In the context of preference learning where large sets of alternatives and numerous attributes are involved, such an approach is not an option in view of the large computing times implied. Therefore, we propose a new metaheuristic designed to learn the parameters of an MR-Sort model. This algorithm works in two phases that are iterated. The first one consists in solving a linear program determining the weights and the majority threshold, assuming a given set of profiles. The second phase runs a metaheuristic which determines profiles for a fixed set of weights and a majority threshold. The presentation focuses on the metaheuristic and reports the results of numerical tests, providing insights on the algorithm behavior.

https://hal.archives-ouvertes.fr/hal-01249727/document

Learning a Majority Rule Model from Large Sets of Assignment Examples

Learning monotone preferences using a majority rule sorting model

https://hal.archives-ouvertes.fr/hal-01727392/document

UTA-poly and UTA-splines: Additive value functions with polynomial marginals

We consider a multicriteria sorting procedure based on a majority rule, called MR-Sort. This procedure allows to sort each object of a set, evaluated on multiple criteria, in a category selected among a set of pre-defined and ordered categories. With MR-Sort, the ordered categories are separated by profiles which are vectors of performances on the different attributes. Using the MR-Sort rule, an object is assigned to a category if it is at least as good as the category lower profile and not better than the category upper profile. To determine whether an object is as good as a profile, the weights of the criteria on which the object performances are better than the profile performances are summed up and compared to a threshold. If the sum of weights is at least equal to the threshold, then the object is considered at least as good as the profile. In view of increasing the expressiveness of the model, we substitute additive weights by a capacity to represent the power of coalitions of criteria. This corresponds to the Non-Compensatory Sorting model characterized by Bouyssou and Marchant. In the paper we describe a mixed integer program and a heuristic algorithm that enable to learn the parameters of this model from assignment examples.

/pdf/learning-the-parameters-of-a-non-compensatory-sorting-model-1o8mmgzd4t.pdf

Olivier Sobrie

Papers

Learning the parameters of a multiple criteria sorting method from large sets of assignment examples

Learning a Majority Rule Model from Large Sets of Assignment Examples

Learning monotone preferences using a majority rule sorting model

UTA-poly and UTA-splines: Additive value functions with polynomial marginals

Learning the Parameters of a Non Compensatory Sorting Model